/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/in-de41.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 10:03:08,829 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 10:03:08,830 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 10:03:08,859 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 10:03:08,861 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 10:03:08,862 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 10:03:08,862 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 10:03:08,863 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 10:03:08,864 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 10:03:08,865 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 10:03:08,866 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 10:03:08,866 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 10:03:08,866 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 10:03:08,867 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 10:03:08,868 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 10:03:08,868 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 10:03:08,869 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 10:03:08,869 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 10:03:08,870 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 10:03:08,871 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 10:03:08,872 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 10:03:08,887 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 10:03:08,888 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 10:03:08,889 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 10:03:08,889 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 10:03:08,891 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 10:03:08,891 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 10:03:08,891 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 10:03:08,891 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 10:03:08,892 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 10:03:08,892 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 10:03:08,892 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 10:03:08,893 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 10:03:08,893 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 10:03:08,894 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 10:03:08,894 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 10:03:08,894 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 10:03:08,894 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 10:03:08,895 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 10:03:08,895 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 10:03:08,895 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 10:03:08,896 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 10:03:08,896 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 10:03:08,902 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 10:03:08,902 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 10:03:08,903 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 10:03:08,903 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 10:03:08,903 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 10:03:08,903 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 10:03:08,903 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 10:03:08,903 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 10:03:08,903 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 10:03:08,903 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 10:03:08,903 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 10:03:08,903 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 10:03:08,904 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 10:03:08,904 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 10:03:08,904 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 10:03:08,904 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:03:08,904 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 10:03:08,904 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 10:03:08,904 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 10:03:08,904 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 10:03:08,904 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 10:03:08,904 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 10:03:08,904 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-08 10:03:09,032 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 10:03:09,044 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 10:03:09,045 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 10:03:09,046 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 10:03:09,047 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 10:03:09,047 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de41.c [2022-04-08 10:03:09,082 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01e621d05/329a576463f14b72bf3edf8baa068968/FLAG8a0c870a0 [2022-04-08 10:03:09,483 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 10:03:09,484 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de41.c [2022-04-08 10:03:09,487 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01e621d05/329a576463f14b72bf3edf8baa068968/FLAG8a0c870a0 [2022-04-08 10:03:09,495 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01e621d05/329a576463f14b72bf3edf8baa068968 [2022-04-08 10:03:09,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 10:03:09,498 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 10:03:09,500 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 10:03:09,500 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 10:03:09,503 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 10:03:09,503 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:03:09" (1/1) ... [2022-04-08 10:03:09,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c6f3d3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:03:09, skipping insertion in model container [2022-04-08 10:03:09,504 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:03:09" (1/1) ... [2022-04-08 10:03:09,508 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 10:03:09,516 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 10:03:09,628 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de41.c[368,381] [2022-04-08 10:03:09,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:03:09,668 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 10:03:09,677 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de41.c[368,381] [2022-04-08 10:03:09,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:03:09,692 INFO L208 MainTranslator]: Completed translation [2022-04-08 10:03:09,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:03:09 WrapperNode [2022-04-08 10:03:09,692 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 10:03:09,693 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 10:03:09,693 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 10:03:09,693 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 10:03:09,700 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:03:09" (1/1) ... [2022-04-08 10:03:09,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:03:09" (1/1) ... [2022-04-08 10:03:09,706 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:03:09" (1/1) ... [2022-04-08 10:03:09,706 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:03:09" (1/1) ... [2022-04-08 10:03:09,719 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:03:09" (1/1) ... [2022-04-08 10:03:09,725 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:03:09" (1/1) ... [2022-04-08 10:03:09,730 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:03:09" (1/1) ... [2022-04-08 10:03:09,731 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 10:03:09,732 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 10:03:09,732 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 10:03:09,732 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 10:03:09,733 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:03:09" (1/1) ... [2022-04-08 10:03:09,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:03:09,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:09,765 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-08 10:03:09,778 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-08 10:03:09,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 10:03:09,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 10:03:09,793 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 10:03:09,793 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 10:03:09,793 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 10:03:09,794 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 10:03:09,794 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 10:03:09,794 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 10:03:09,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 10:03:09,794 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 10:03:09,794 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 10:03:09,794 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 10:03:09,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 10:03:09,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 10:03:09,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 10:03:09,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 10:03:09,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 10:03:09,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 10:03:09,836 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 10:03:09,837 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 10:03:09,979 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 10:03:09,983 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 10:03:09,983 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-04-08 10:03:09,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:03:09 BoogieIcfgContainer [2022-04-08 10:03:09,984 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 10:03:10,001 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 10:03:10,001 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 10:03:10,005 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 10:03:10,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 10:03:09" (1/3) ... [2022-04-08 10:03:10,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bfa986d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:03:10, skipping insertion in model container [2022-04-08 10:03:10,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:03:09" (2/3) ... [2022-04-08 10:03:10,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bfa986d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:03:10, skipping insertion in model container [2022-04-08 10:03:10,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:03:09" (3/3) ... [2022-04-08 10:03:10,007 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de41.c [2022-04-08 10:03:10,010 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 10:03:10,010 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 10:03:10,051 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 10:03:10,056 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-08 10:03:10,057 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 10:03:10,073 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 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-08 10:03:10,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 10:03:10,078 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:10,078 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:10,078 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:10,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:10,082 INFO L85 PathProgramCache]: Analyzing trace with hash 2066875484, now seen corresponding path program 1 times [2022-04-08 10:03:10,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:10,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1617828686] [2022-04-08 10:03:10,098 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:03:10,098 INFO L85 PathProgramCache]: Analyzing trace with hash 2066875484, now seen corresponding path program 2 times [2022-04-08 10:03:10,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:10,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427618069] [2022-04-08 10:03:10,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:10,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:10,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:10,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:10,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:10,257 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26#true} is VALID [2022-04-08 10:03:10,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-08 10:03:10,257 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #72#return; {26#true} is VALID [2022-04-08 10:03:10,259 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:10,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26#true} is VALID [2022-04-08 10:03:10,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-08 10:03:10,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #72#return; {26#true} is VALID [2022-04-08 10:03:10,259 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret13 := main(); {26#true} is VALID [2022-04-08 10:03:10,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26#true} is VALID [2022-04-08 10:03:10,260 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume !(~x~0 % 4294967296 > 0); {26#true} is VALID [2022-04-08 10:03:10,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#true} ~z~0 := ~y~0; {26#true} is VALID [2022-04-08 10:03:10,260 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#true} assume !(~z~0 % 4294967296 > 0); {26#true} is VALID [2022-04-08 10:03:10,260 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#true} assume !(~y~0 % 4294967296 > 0); {26#true} is VALID [2022-04-08 10:03:10,261 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#true} assume !true; {27#false} is VALID [2022-04-08 10:03:10,261 INFO L272 TraceCheckUtils]: 11: Hoare triple {27#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {27#false} is VALID [2022-04-08 10:03:10,261 INFO L290 TraceCheckUtils]: 12: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-04-08 10:03:10,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-04-08 10:03:10,261 INFO L290 TraceCheckUtils]: 14: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-08 10:03:10,262 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-08 10:03:10,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:10,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427618069] [2022-04-08 10:03:10,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427618069] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:10,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:10,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 10:03:10,264 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:10,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1617828686] [2022-04-08 10:03:10,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1617828686] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:10,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:10,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 10:03:10,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029103231] [2022-04-08 10:03:10,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:10,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-08 10:03:10,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:10,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:10,289 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-08 10:03:10,289 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 10:03:10,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:10,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 10:03:10,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 10:03:10,304 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:10,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:10,360 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-08 10:03:10,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 10:03:10,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-08 10:03:10,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:10,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:10,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-04-08 10:03:10,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:10,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-04-08 10:03:10,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2022-04-08 10:03:10,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:10,434 INFO L225 Difference]: With dead ends: 39 [2022-04-08 10:03:10,435 INFO L226 Difference]: Without dead ends: 16 [2022-04-08 10:03:10,436 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-08 10:03:10,439 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 28 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-08 10:03:10,439 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 28 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:03:10,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-08 10:03:10,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-08 10:03:10,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:10,457 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:10,458 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:10,458 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:10,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:10,460 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-04-08 10:03:10,460 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-04-08 10:03:10,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:10,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:10,460 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-08 10:03:10,460 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-08 10:03:10,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:10,462 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-04-08 10:03:10,462 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-04-08 10:03:10,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:10,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:10,462 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:10,462 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:10,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:10,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-04-08 10:03:10,464 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 15 [2022-04-08 10:03:10,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:10,465 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-04-08 10:03:10,465 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:10,465 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 19 transitions. [2022-04-08 10:03:10,481 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:10,481 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-04-08 10:03:10,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 10:03:10,481 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:10,482 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:10,482 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 10:03:10,482 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:10,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:10,483 INFO L85 PathProgramCache]: Analyzing trace with hash 2063181400, now seen corresponding path program 1 times [2022-04-08 10:03:10,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:10,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1802413147] [2022-04-08 10:03:10,484 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:03:10,484 INFO L85 PathProgramCache]: Analyzing trace with hash 2063181400, now seen corresponding path program 2 times [2022-04-08 10:03:10,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:10,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606128327] [2022-04-08 10:03:10,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:10,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:10,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:10,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:10,780 INFO L290 TraceCheckUtils]: 0: Hoare triple {186#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {176#true} is VALID [2022-04-08 10:03:10,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {176#true} assume true; {176#true} is VALID [2022-04-08 10:03:10,780 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {176#true} {176#true} #72#return; {176#true} is VALID [2022-04-08 10:03:10,781 INFO L272 TraceCheckUtils]: 0: Hoare triple {176#true} call ULTIMATE.init(); {186#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:10,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {186#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {176#true} is VALID [2022-04-08 10:03:10,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {176#true} assume true; {176#true} is VALID [2022-04-08 10:03:10,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {176#true} {176#true} #72#return; {176#true} is VALID [2022-04-08 10:03:10,782 INFO L272 TraceCheckUtils]: 4: Hoare triple {176#true} call #t~ret13 := main(); {176#true} is VALID [2022-04-08 10:03:10,782 INFO L290 TraceCheckUtils]: 5: Hoare triple {176#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {181#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-08 10:03:10,783 INFO L290 TraceCheckUtils]: 6: Hoare triple {181#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !(~x~0 % 4294967296 > 0); {182#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-08 10:03:10,783 INFO L290 TraceCheckUtils]: 7: Hoare triple {182#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} ~z~0 := ~y~0; {182#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-08 10:03:10,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {182#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} assume !(~z~0 % 4294967296 > 0); {182#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-08 10:03:10,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {182#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} assume !(~y~0 % 4294967296 > 0); {182#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-08 10:03:10,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {182#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} assume !(~x~0 % 4294967296 > 0); {183#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (= main_~y~0 0))} is VALID [2022-04-08 10:03:10,787 INFO L272 TraceCheckUtils]: 11: Hoare triple {183#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (= main_~y~0 0))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {184#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:03:10,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {184#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {185#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:03:10,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {185#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {177#false} is VALID [2022-04-08 10:03:10,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {177#false} assume !false; {177#false} is VALID [2022-04-08 10:03:10,788 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-08 10:03:10,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:10,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606128327] [2022-04-08 10:03:10,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606128327] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:10,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:10,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 10:03:10,789 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:10,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1802413147] [2022-04-08 10:03:10,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1802413147] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:10,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:10,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 10:03:10,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415632695] [2022-04-08 10:03:10,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:10,790 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-08 10:03:10,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:10,791 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:10,805 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-08 10:03:10,805 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 10:03:10,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:10,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 10:03:10,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-04-08 10:03:10,806 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:11,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:11,110 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-08 10:03:11,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 10:03:11,110 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-08 10:03:11,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:11,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:11,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-08 10:03:11,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:11,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-08 10:03:11,114 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 46 transitions. [2022-04-08 10:03:11,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:11,154 INFO L225 Difference]: With dead ends: 35 [2022-04-08 10:03:11,154 INFO L226 Difference]: Without dead ends: 22 [2022-04-08 10:03:11,154 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-08 10:03:11,155 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 36 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:11,155 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 38 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:03:11,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-08 10:03:11,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-08 10:03:11,163 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:11,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 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-08 10:03:11,163 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 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-08 10:03:11,163 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 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-08 10:03:11,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:11,165 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-08 10:03:11,165 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-08 10:03:11,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:11,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:11,165 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 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 22 states. [2022-04-08 10:03:11,165 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 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 22 states. [2022-04-08 10:03:11,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:11,166 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-08 10:03:11,167 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-08 10:03:11,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:11,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:11,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:11,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:11,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 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-08 10:03:11,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-04-08 10:03:11,168 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 15 [2022-04-08 10:03:11,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:11,168 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-04-08 10:03:11,169 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:11,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 27 transitions. [2022-04-08 10:03:11,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:11,192 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-08 10:03:11,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 10:03:11,192 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:11,192 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:11,192 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 10:03:11,193 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:11,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:11,193 INFO L85 PathProgramCache]: Analyzing trace with hash 570818913, now seen corresponding path program 1 times [2022-04-08 10:03:11,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:11,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [757272126] [2022-04-08 10:03:11,205 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:11,205 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:11,205 INFO L85 PathProgramCache]: Analyzing trace with hash 570818913, now seen corresponding path program 2 times [2022-04-08 10:03:11,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:11,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680157535] [2022-04-08 10:03:11,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:11,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:11,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:11,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:11,273 INFO L290 TraceCheckUtils]: 0: Hoare triple {365#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {357#true} is VALID [2022-04-08 10:03:11,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {357#true} assume true; {357#true} is VALID [2022-04-08 10:03:11,273 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {357#true} {357#true} #72#return; {357#true} is VALID [2022-04-08 10:03:11,274 INFO L272 TraceCheckUtils]: 0: Hoare triple {357#true} call ULTIMATE.init(); {365#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:11,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {365#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {357#true} is VALID [2022-04-08 10:03:11,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {357#true} assume true; {357#true} is VALID [2022-04-08 10:03:11,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {357#true} {357#true} #72#return; {357#true} is VALID [2022-04-08 10:03:11,275 INFO L272 TraceCheckUtils]: 4: Hoare triple {357#true} call #t~ret13 := main(); {357#true} is VALID [2022-04-08 10:03:11,275 INFO L290 TraceCheckUtils]: 5: Hoare triple {357#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {362#(= main_~y~0 0)} is VALID [2022-04-08 10:03:11,275 INFO L290 TraceCheckUtils]: 6: Hoare triple {362#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {363#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:11,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {363#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {363#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:11,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {363#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {364#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:03:11,277 INFO L290 TraceCheckUtils]: 9: Hoare triple {364#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {358#false} is VALID [2022-04-08 10:03:11,277 INFO L290 TraceCheckUtils]: 10: Hoare triple {358#false} assume !(~y~0 % 4294967296 > 0); {358#false} is VALID [2022-04-08 10:03:11,278 INFO L290 TraceCheckUtils]: 11: Hoare triple {358#false} assume !(~x~0 % 4294967296 > 0); {358#false} is VALID [2022-04-08 10:03:11,278 INFO L272 TraceCheckUtils]: 12: Hoare triple {358#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {358#false} is VALID [2022-04-08 10:03:11,278 INFO L290 TraceCheckUtils]: 13: Hoare triple {358#false} ~cond := #in~cond; {358#false} is VALID [2022-04-08 10:03:11,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {358#false} assume 0 == ~cond; {358#false} is VALID [2022-04-08 10:03:11,278 INFO L290 TraceCheckUtils]: 15: Hoare triple {358#false} assume !false; {358#false} is VALID [2022-04-08 10:03:11,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:11,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:11,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680157535] [2022-04-08 10:03:11,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680157535] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:11,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528682823] [2022-04-08 10:03:11,279 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:03:11,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:11,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:11,281 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-08 10:03:11,307 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-08 10:03:11,351 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:03:11,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:11,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 10:03:11,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:11,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:11,583 INFO L272 TraceCheckUtils]: 0: Hoare triple {357#true} call ULTIMATE.init(); {357#true} is VALID [2022-04-08 10:03:11,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {357#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {357#true} is VALID [2022-04-08 10:03:11,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {357#true} assume true; {357#true} is VALID [2022-04-08 10:03:11,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {357#true} {357#true} #72#return; {357#true} is VALID [2022-04-08 10:03:11,584 INFO L272 TraceCheckUtils]: 4: Hoare triple {357#true} call #t~ret13 := main(); {357#true} is VALID [2022-04-08 10:03:11,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {357#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {362#(= main_~y~0 0)} is VALID [2022-04-08 10:03:11,585 INFO L290 TraceCheckUtils]: 6: Hoare triple {362#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {363#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:11,585 INFO L290 TraceCheckUtils]: 7: Hoare triple {363#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {363#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:11,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {363#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {393#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:03:11,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {393#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {358#false} is VALID [2022-04-08 10:03:11,586 INFO L290 TraceCheckUtils]: 10: Hoare triple {358#false} assume !(~y~0 % 4294967296 > 0); {358#false} is VALID [2022-04-08 10:03:11,586 INFO L290 TraceCheckUtils]: 11: Hoare triple {358#false} assume !(~x~0 % 4294967296 > 0); {358#false} is VALID [2022-04-08 10:03:11,586 INFO L272 TraceCheckUtils]: 12: Hoare triple {358#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {358#false} is VALID [2022-04-08 10:03:11,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {358#false} ~cond := #in~cond; {358#false} is VALID [2022-04-08 10:03:11,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {358#false} assume 0 == ~cond; {358#false} is VALID [2022-04-08 10:03:11,587 INFO L290 TraceCheckUtils]: 15: Hoare triple {358#false} assume !false; {358#false} is VALID [2022-04-08 10:03:11,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:11,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:11,660 INFO L290 TraceCheckUtils]: 15: Hoare triple {358#false} assume !false; {358#false} is VALID [2022-04-08 10:03:11,660 INFO L290 TraceCheckUtils]: 14: Hoare triple {358#false} assume 0 == ~cond; {358#false} is VALID [2022-04-08 10:03:11,660 INFO L290 TraceCheckUtils]: 13: Hoare triple {358#false} ~cond := #in~cond; {358#false} is VALID [2022-04-08 10:03:11,660 INFO L272 TraceCheckUtils]: 12: Hoare triple {358#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {358#false} is VALID [2022-04-08 10:03:11,660 INFO L290 TraceCheckUtils]: 11: Hoare triple {358#false} assume !(~x~0 % 4294967296 > 0); {358#false} is VALID [2022-04-08 10:03:11,661 INFO L290 TraceCheckUtils]: 10: Hoare triple {358#false} assume !(~y~0 % 4294967296 > 0); {358#false} is VALID [2022-04-08 10:03:11,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {433#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {358#false} is VALID [2022-04-08 10:03:11,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {437#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {433#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:03:11,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {437#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {437#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:11,662 INFO L290 TraceCheckUtils]: 6: Hoare triple {444#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {437#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:11,663 INFO L290 TraceCheckUtils]: 5: Hoare triple {357#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {444#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:03:11,663 INFO L272 TraceCheckUtils]: 4: Hoare triple {357#true} call #t~ret13 := main(); {357#true} is VALID [2022-04-08 10:03:11,663 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {357#true} {357#true} #72#return; {357#true} is VALID [2022-04-08 10:03:11,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {357#true} assume true; {357#true} is VALID [2022-04-08 10:03:11,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {357#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {357#true} is VALID [2022-04-08 10:03:11,663 INFO L272 TraceCheckUtils]: 0: Hoare triple {357#true} call ULTIMATE.init(); {357#true} is VALID [2022-04-08 10:03:11,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:11,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528682823] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:11,664 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:11,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-08 10:03:11,664 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:11,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [757272126] [2022-04-08 10:03:11,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [757272126] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:11,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:11,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:03:11,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713291588] [2022-04-08 10:03:11,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:11,665 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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 16 [2022-04-08 10:03:11,665 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:11,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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-08 10:03:11,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:11,678 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 10:03:11,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:11,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 10:03:11,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-08 10:03:11,679 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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-08 10:03:11,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:11,859 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2022-04-08 10:03:11,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 10:03:11,859 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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 16 [2022-04-08 10:03:11,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:11,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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-08 10:03:11,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-04-08 10:03:11,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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-08 10:03:11,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-04-08 10:03:11,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 49 transitions. [2022-04-08 10:03:11,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:11,901 INFO L225 Difference]: With dead ends: 39 [2022-04-08 10:03:11,901 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 10:03:11,901 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-04-08 10:03:11,902 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 33 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:11,902 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 35 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:03:11,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 10:03:11,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2022-04-08 10:03:11,918 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:11,919 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 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-08 10:03:11,919 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 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-08 10:03:11,919 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 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-08 10:03:11,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:11,920 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-08 10:03:11,920 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-08 10:03:11,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:11,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:11,921 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 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 32 states. [2022-04-08 10:03:11,921 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 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 32 states. [2022-04-08 10:03:11,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:11,922 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-08 10:03:11,922 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-08 10:03:11,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:11,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:11,923 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:11,923 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:11,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 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-08 10:03:11,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2022-04-08 10:03:11,924 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 16 [2022-04-08 10:03:11,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:11,924 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-04-08 10:03:11,924 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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-08 10:03:11,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 35 transitions. [2022-04-08 10:03:11,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:11,953 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-04-08 10:03:11,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 10:03:11,953 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:11,953 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:11,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 10:03:12,167 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:12,168 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:12,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:12,168 INFO L85 PathProgramCache]: Analyzing trace with hash -417354376, now seen corresponding path program 1 times [2022-04-08 10:03:12,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:12,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2082942513] [2022-04-08 10:03:12,171 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:12,171 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:12,171 INFO L85 PathProgramCache]: Analyzing trace with hash -417354376, now seen corresponding path program 2 times [2022-04-08 10:03:12,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:12,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279442208] [2022-04-08 10:03:12,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:12,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:12,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:12,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:12,218 INFO L290 TraceCheckUtils]: 0: Hoare triple {676#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {669#true} is VALID [2022-04-08 10:03:12,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {669#true} assume true; {669#true} is VALID [2022-04-08 10:03:12,218 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {669#true} {669#true} #72#return; {669#true} is VALID [2022-04-08 10:03:12,219 INFO L272 TraceCheckUtils]: 0: Hoare triple {669#true} call ULTIMATE.init(); {676#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:12,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {676#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {669#true} is VALID [2022-04-08 10:03:12,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {669#true} assume true; {669#true} is VALID [2022-04-08 10:03:12,219 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {669#true} {669#true} #72#return; {669#true} is VALID [2022-04-08 10:03:12,219 INFO L272 TraceCheckUtils]: 4: Hoare triple {669#true} call #t~ret13 := main(); {669#true} is VALID [2022-04-08 10:03:12,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {669#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {674#(= main_~y~0 0)} is VALID [2022-04-08 10:03:12,220 INFO L290 TraceCheckUtils]: 6: Hoare triple {674#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {674#(= main_~y~0 0)} is VALID [2022-04-08 10:03:12,220 INFO L290 TraceCheckUtils]: 7: Hoare triple {674#(= main_~y~0 0)} ~z~0 := ~y~0; {675#(= main_~z~0 0)} is VALID [2022-04-08 10:03:12,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {675#(= main_~z~0 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {670#false} is VALID [2022-04-08 10:03:12,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {670#false} assume !(~z~0 % 4294967296 > 0); {670#false} is VALID [2022-04-08 10:03:12,221 INFO L290 TraceCheckUtils]: 10: Hoare triple {670#false} assume !(~y~0 % 4294967296 > 0); {670#false} is VALID [2022-04-08 10:03:12,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {670#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {670#false} is VALID [2022-04-08 10:03:12,221 INFO L290 TraceCheckUtils]: 12: Hoare triple {670#false} assume !(~x~0 % 4294967296 > 0); {670#false} is VALID [2022-04-08 10:03:12,221 INFO L272 TraceCheckUtils]: 13: Hoare triple {670#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {670#false} is VALID [2022-04-08 10:03:12,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {670#false} ~cond := #in~cond; {670#false} is VALID [2022-04-08 10:03:12,222 INFO L290 TraceCheckUtils]: 15: Hoare triple {670#false} assume 0 == ~cond; {670#false} is VALID [2022-04-08 10:03:12,222 INFO L290 TraceCheckUtils]: 16: Hoare triple {670#false} assume !false; {670#false} is VALID [2022-04-08 10:03:12,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 10:03:12,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:12,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279442208] [2022-04-08 10:03:12,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279442208] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:12,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:12,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:03:12,222 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:12,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2082942513] [2022-04-08 10:03:12,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2082942513] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:12,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:12,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:03:12,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221779217] [2022-04-08 10:03:12,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:12,223 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 10:03:12,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:12,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:12,233 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-08 10:03:12,233 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 10:03:12,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:12,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 10:03:12,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 10:03:12,234 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:12,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:12,312 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-08 10:03:12,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 10:03:12,312 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 10:03:12,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:12,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:12,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 10:03:12,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:12,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 10:03:12,314 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-08 10:03:12,340 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:12,340 INFO L225 Difference]: With dead ends: 34 [2022-04-08 10:03:12,340 INFO L226 Difference]: Without dead ends: 23 [2022-04-08 10:03:12,341 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-08 10:03:12,341 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 16 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:12,341 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 29 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:03:12,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-08 10:03:12,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-08 10:03:12,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:12,352 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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-08 10:03:12,352 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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-08 10:03:12,352 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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-08 10:03:12,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:12,353 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-08 10:03:12,353 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-08 10:03:12,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:12,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:12,353 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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 23 states. [2022-04-08 10:03:12,353 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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 23 states. [2022-04-08 10:03:12,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:12,354 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-08 10:03:12,354 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-08 10:03:12,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:12,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:12,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:12,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:12,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 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-08 10:03:12,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-04-08 10:03:12,355 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 17 [2022-04-08 10:03:12,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:12,355 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-04-08 10:03:12,355 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:12,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 28 transitions. [2022-04-08 10:03:12,376 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-08 10:03:12,376 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-08 10:03:12,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 10:03:12,377 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:12,377 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:12,377 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 10:03:12,377 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:12,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:12,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1552222072, now seen corresponding path program 3 times [2022-04-08 10:03:12,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:12,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [29579851] [2022-04-08 10:03:12,380 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:12,380 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:12,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1552222072, now seen corresponding path program 4 times [2022-04-08 10:03:12,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:12,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056022080] [2022-04-08 10:03:12,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:12,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:12,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:12,440 INFO L290 TraceCheckUtils]: 0: Hoare triple {852#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {843#true} is VALID [2022-04-08 10:03:12,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {843#true} assume true; {843#true} is VALID [2022-04-08 10:03:12,441 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {843#true} {843#true} #72#return; {843#true} is VALID [2022-04-08 10:03:12,441 INFO L272 TraceCheckUtils]: 0: Hoare triple {843#true} call ULTIMATE.init(); {852#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:12,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {852#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {843#true} is VALID [2022-04-08 10:03:12,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {843#true} assume true; {843#true} is VALID [2022-04-08 10:03:12,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {843#true} {843#true} #72#return; {843#true} is VALID [2022-04-08 10:03:12,442 INFO L272 TraceCheckUtils]: 4: Hoare triple {843#true} call #t~ret13 := main(); {843#true} is VALID [2022-04-08 10:03:12,442 INFO L290 TraceCheckUtils]: 5: Hoare triple {843#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {848#(= main_~y~0 0)} is VALID [2022-04-08 10:03:12,442 INFO L290 TraceCheckUtils]: 6: Hoare triple {848#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {849#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:12,443 INFO L290 TraceCheckUtils]: 7: Hoare triple {849#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {850#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:12,443 INFO L290 TraceCheckUtils]: 8: Hoare triple {850#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {850#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:12,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {850#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {851#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-08 10:03:12,444 INFO L290 TraceCheckUtils]: 10: Hoare triple {851#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {844#false} is VALID [2022-04-08 10:03:12,444 INFO L290 TraceCheckUtils]: 11: Hoare triple {844#false} assume !(~y~0 % 4294967296 > 0); {844#false} is VALID [2022-04-08 10:03:12,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {844#false} assume !(~x~0 % 4294967296 > 0); {844#false} is VALID [2022-04-08 10:03:12,444 INFO L272 TraceCheckUtils]: 13: Hoare triple {844#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {844#false} is VALID [2022-04-08 10:03:12,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {844#false} ~cond := #in~cond; {844#false} is VALID [2022-04-08 10:03:12,445 INFO L290 TraceCheckUtils]: 15: Hoare triple {844#false} assume 0 == ~cond; {844#false} is VALID [2022-04-08 10:03:12,445 INFO L290 TraceCheckUtils]: 16: Hoare triple {844#false} assume !false; {844#false} is VALID [2022-04-08 10:03:12,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:12,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:12,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056022080] [2022-04-08 10:03:12,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056022080] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:12,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584936222] [2022-04-08 10:03:12,445 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:03:12,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:12,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:12,446 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:03:12,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 10:03:12,495 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:03:12,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:12,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 10:03:12,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:12,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:12,675 INFO L272 TraceCheckUtils]: 0: Hoare triple {843#true} call ULTIMATE.init(); {843#true} is VALID [2022-04-08 10:03:12,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {843#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {843#true} is VALID [2022-04-08 10:03:12,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {843#true} assume true; {843#true} is VALID [2022-04-08 10:03:12,675 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {843#true} {843#true} #72#return; {843#true} is VALID [2022-04-08 10:03:12,675 INFO L272 TraceCheckUtils]: 4: Hoare triple {843#true} call #t~ret13 := main(); {843#true} is VALID [2022-04-08 10:03:12,676 INFO L290 TraceCheckUtils]: 5: Hoare triple {843#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {848#(= main_~y~0 0)} is VALID [2022-04-08 10:03:12,676 INFO L290 TraceCheckUtils]: 6: Hoare triple {848#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {849#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:12,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {849#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {850#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:12,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {850#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {850#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:12,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {850#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {883#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:03:12,678 INFO L290 TraceCheckUtils]: 10: Hoare triple {883#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {844#false} is VALID [2022-04-08 10:03:12,678 INFO L290 TraceCheckUtils]: 11: Hoare triple {844#false} assume !(~y~0 % 4294967296 > 0); {844#false} is VALID [2022-04-08 10:03:12,678 INFO L290 TraceCheckUtils]: 12: Hoare triple {844#false} assume !(~x~0 % 4294967296 > 0); {844#false} is VALID [2022-04-08 10:03:12,678 INFO L272 TraceCheckUtils]: 13: Hoare triple {844#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {844#false} is VALID [2022-04-08 10:03:12,678 INFO L290 TraceCheckUtils]: 14: Hoare triple {844#false} ~cond := #in~cond; {844#false} is VALID [2022-04-08 10:03:12,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {844#false} assume 0 == ~cond; {844#false} is VALID [2022-04-08 10:03:12,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {844#false} assume !false; {844#false} is VALID [2022-04-08 10:03:12,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:12,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:12,767 INFO L290 TraceCheckUtils]: 16: Hoare triple {844#false} assume !false; {844#false} is VALID [2022-04-08 10:03:12,767 INFO L290 TraceCheckUtils]: 15: Hoare triple {844#false} assume 0 == ~cond; {844#false} is VALID [2022-04-08 10:03:12,767 INFO L290 TraceCheckUtils]: 14: Hoare triple {844#false} ~cond := #in~cond; {844#false} is VALID [2022-04-08 10:03:12,767 INFO L272 TraceCheckUtils]: 13: Hoare triple {844#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {844#false} is VALID [2022-04-08 10:03:12,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {844#false} assume !(~x~0 % 4294967296 > 0); {844#false} is VALID [2022-04-08 10:03:12,768 INFO L290 TraceCheckUtils]: 11: Hoare triple {844#false} assume !(~y~0 % 4294967296 > 0); {844#false} is VALID [2022-04-08 10:03:12,768 INFO L290 TraceCheckUtils]: 10: Hoare triple {923#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {844#false} is VALID [2022-04-08 10:03:12,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {927#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {923#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:03:12,769 INFO L290 TraceCheckUtils]: 8: Hoare triple {927#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {927#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:12,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {934#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {927#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:12,770 INFO L290 TraceCheckUtils]: 6: Hoare triple {938#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {934#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:03:12,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {843#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {938#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:03:12,771 INFO L272 TraceCheckUtils]: 4: Hoare triple {843#true} call #t~ret13 := main(); {843#true} is VALID [2022-04-08 10:03:12,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {843#true} {843#true} #72#return; {843#true} is VALID [2022-04-08 10:03:12,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {843#true} assume true; {843#true} is VALID [2022-04-08 10:03:12,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {843#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {843#true} is VALID [2022-04-08 10:03:12,771 INFO L272 TraceCheckUtils]: 0: Hoare triple {843#true} call ULTIMATE.init(); {843#true} is VALID [2022-04-08 10:03:12,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:12,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584936222] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:12,772 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:12,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-08 10:03:12,772 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:12,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [29579851] [2022-04-08 10:03:12,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [29579851] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:12,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:12,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 10:03:12,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198035573] [2022-04-08 10:03:12,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:12,772 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 10:03:12,773 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:12,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:12,784 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-08 10:03:12,785 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 10:03:12,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:12,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 10:03:12,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-08 10:03:12,785 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:13,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:13,037 INFO L93 Difference]: Finished difference Result 43 states and 58 transitions. [2022-04-08 10:03:13,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 10:03:13,037 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 10:03:13,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:13,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:13,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-08 10:03:13,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:13,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-08 10:03:13,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 55 transitions. [2022-04-08 10:03:13,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:13,082 INFO L225 Difference]: With dead ends: 43 [2022-04-08 10:03:13,082 INFO L226 Difference]: Without dead ends: 36 [2022-04-08 10:03:13,082 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-04-08 10:03:13,083 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 34 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:13,083 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 42 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:03:13,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-08 10:03:13,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2022-04-08 10:03:13,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:13,101 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 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-08 10:03:13,101 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 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-08 10:03:13,101 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 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-08 10:03:13,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:13,102 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-04-08 10:03:13,102 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-04-08 10:03:13,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:13,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:13,102 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 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 36 states. [2022-04-08 10:03:13,103 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 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 36 states. [2022-04-08 10:03:13,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:13,104 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-04-08 10:03:13,104 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-04-08 10:03:13,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:13,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:13,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:13,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:13,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 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-08 10:03:13,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2022-04-08 10:03:13,105 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 17 [2022-04-08 10:03:13,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:13,105 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-04-08 10:03:13,105 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:13,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 35 transitions. [2022-04-08 10:03:13,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:13,133 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-04-08 10:03:13,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 10:03:13,134 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:13,134 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:13,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 10:03:13,343 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:13,344 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:13,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:13,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1344200880, now seen corresponding path program 1 times [2022-04-08 10:03:13,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:13,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [938128370] [2022-04-08 10:03:13,347 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:13,347 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:13,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1344200880, now seen corresponding path program 2 times [2022-04-08 10:03:13,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:13,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485471495] [2022-04-08 10:03:13,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:13,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:13,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:13,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:13,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:13,417 INFO L290 TraceCheckUtils]: 0: Hoare triple {1188#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1181#true} is VALID [2022-04-08 10:03:13,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {1181#true} assume true; {1181#true} is VALID [2022-04-08 10:03:13,417 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1181#true} {1181#true} #72#return; {1181#true} is VALID [2022-04-08 10:03:13,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {1181#true} call ULTIMATE.init(); {1188#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:13,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {1188#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1181#true} is VALID [2022-04-08 10:03:13,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {1181#true} assume true; {1181#true} is VALID [2022-04-08 10:03:13,418 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1181#true} {1181#true} #72#return; {1181#true} is VALID [2022-04-08 10:03:13,418 INFO L272 TraceCheckUtils]: 4: Hoare triple {1181#true} call #t~ret13 := main(); {1181#true} is VALID [2022-04-08 10:03:13,418 INFO L290 TraceCheckUtils]: 5: Hoare triple {1181#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1181#true} is VALID [2022-04-08 10:03:13,419 INFO L290 TraceCheckUtils]: 6: Hoare triple {1181#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1186#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:03:13,420 INFO L290 TraceCheckUtils]: 7: Hoare triple {1186#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {1186#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:03:13,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {1186#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {1186#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:03:13,421 INFO L290 TraceCheckUtils]: 9: Hoare triple {1186#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1187#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-08 10:03:13,421 INFO L290 TraceCheckUtils]: 10: Hoare triple {1187#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1187#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-08 10:03:13,422 INFO L290 TraceCheckUtils]: 11: Hoare triple {1187#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1187#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-08 10:03:13,422 INFO L290 TraceCheckUtils]: 12: Hoare triple {1187#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1187#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-08 10:03:13,422 INFO L290 TraceCheckUtils]: 13: Hoare triple {1187#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1182#false} is VALID [2022-04-08 10:03:13,422 INFO L272 TraceCheckUtils]: 14: Hoare triple {1182#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1182#false} is VALID [2022-04-08 10:03:13,423 INFO L290 TraceCheckUtils]: 15: Hoare triple {1182#false} ~cond := #in~cond; {1182#false} is VALID [2022-04-08 10:03:13,423 INFO L290 TraceCheckUtils]: 16: Hoare triple {1182#false} assume 0 == ~cond; {1182#false} is VALID [2022-04-08 10:03:13,423 INFO L290 TraceCheckUtils]: 17: Hoare triple {1182#false} assume !false; {1182#false} is VALID [2022-04-08 10:03:13,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 10:03:13,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:13,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485471495] [2022-04-08 10:03:13,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485471495] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:13,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641046856] [2022-04-08 10:03:13,423 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:03:13,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:13,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:13,424 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:03:13,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 10:03:13,458 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:03:13,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:13,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 10:03:13,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:13,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:13,924 INFO L272 TraceCheckUtils]: 0: Hoare triple {1181#true} call ULTIMATE.init(); {1181#true} is VALID [2022-04-08 10:03:13,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {1181#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1181#true} is VALID [2022-04-08 10:03:13,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {1181#true} assume true; {1181#true} is VALID [2022-04-08 10:03:13,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1181#true} {1181#true} #72#return; {1181#true} is VALID [2022-04-08 10:03:13,925 INFO L272 TraceCheckUtils]: 4: Hoare triple {1181#true} call #t~ret13 := main(); {1181#true} is VALID [2022-04-08 10:03:13,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {1181#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1207#(= main_~n~0 main_~x~0)} is VALID [2022-04-08 10:03:13,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {1207#(= main_~n~0 main_~x~0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1211#(= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-08 10:03:13,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {1211#(= (+ main_~x~0 1) main_~n~0)} assume !(~x~0 % 4294967296 > 0); {1211#(= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-08 10:03:13,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {1211#(= (+ main_~x~0 1) main_~n~0)} ~z~0 := ~y~0; {1211#(= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-08 10:03:13,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {1211#(= (+ main_~x~0 1) main_~n~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1207#(= main_~n~0 main_~x~0)} is VALID [2022-04-08 10:03:13,927 INFO L290 TraceCheckUtils]: 10: Hoare triple {1207#(= main_~n~0 main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1207#(= main_~n~0 main_~x~0)} is VALID [2022-04-08 10:03:13,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {1207#(= main_~n~0 main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1207#(= main_~n~0 main_~x~0)} is VALID [2022-04-08 10:03:13,928 INFO L290 TraceCheckUtils]: 12: Hoare triple {1207#(= main_~n~0 main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1230#(and (= main_~n~0 main_~x~0) (not (< 0 (mod main_~y~0 4294967296))))} is VALID [2022-04-08 10:03:13,928 INFO L290 TraceCheckUtils]: 13: Hoare triple {1230#(and (= main_~n~0 main_~x~0) (not (< 0 (mod main_~y~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {1234#(and (not (< 0 (mod main_~y~0 4294967296))) (not (< 0 (mod main_~n~0 4294967296))))} is VALID [2022-04-08 10:03:13,929 INFO L272 TraceCheckUtils]: 14: Hoare triple {1234#(and (not (< 0 (mod main_~y~0 4294967296))) (not (< 0 (mod main_~n~0 4294967296))))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1238#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:03:13,929 INFO L290 TraceCheckUtils]: 15: Hoare triple {1238#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1242#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:03:13,930 INFO L290 TraceCheckUtils]: 16: Hoare triple {1242#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1182#false} is VALID [2022-04-08 10:03:13,930 INFO L290 TraceCheckUtils]: 17: Hoare triple {1182#false} assume !false; {1182#false} is VALID [2022-04-08 10:03:13,930 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 10:03:13,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:14,287 INFO L290 TraceCheckUtils]: 17: Hoare triple {1182#false} assume !false; {1182#false} is VALID [2022-04-08 10:03:14,290 INFO L290 TraceCheckUtils]: 16: Hoare triple {1242#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1182#false} is VALID [2022-04-08 10:03:14,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {1238#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1242#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:03:14,291 INFO L272 TraceCheckUtils]: 14: Hoare triple {1258#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1238#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:03:14,292 INFO L290 TraceCheckUtils]: 13: Hoare triple {1262#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {1258#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:14,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {1266#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {1262#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:03:14,292 INFO L290 TraceCheckUtils]: 11: Hoare triple {1266#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1266#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:14,293 INFO L290 TraceCheckUtils]: 10: Hoare triple {1266#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {1266#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:14,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {1276#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1266#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:14,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {1276#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} ~z~0 := ~y~0; {1276#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-08 10:03:14,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {1276#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {1276#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-08 10:03:14,295 INFO L290 TraceCheckUtils]: 6: Hoare triple {1266#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1276#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-08 10:03:14,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {1181#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1266#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:14,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {1181#true} call #t~ret13 := main(); {1181#true} is VALID [2022-04-08 10:03:14,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1181#true} {1181#true} #72#return; {1181#true} is VALID [2022-04-08 10:03:14,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {1181#true} assume true; {1181#true} is VALID [2022-04-08 10:03:14,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {1181#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1181#true} is VALID [2022-04-08 10:03:14,295 INFO L272 TraceCheckUtils]: 0: Hoare triple {1181#true} call ULTIMATE.init(); {1181#true} is VALID [2022-04-08 10:03:14,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 10:03:14,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641046856] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:14,296 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:14,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 15 [2022-04-08 10:03:14,296 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:14,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [938128370] [2022-04-08 10:03:14,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [938128370] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:14,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:14,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:03:14,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601411704] [2022-04-08 10:03:14,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:14,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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 18 [2022-04-08 10:03:14,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:14,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-08 10:03:14,316 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:14,317 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 10:03:14,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:14,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 10:03:14,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-04-08 10:03:14,317 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-08 10:03:14,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:14,445 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-08 10:03:14,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 10:03:14,446 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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 18 [2022-04-08 10:03:14,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:14,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-08 10:03:14,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-08 10:03:14,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-08 10:03:14,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-08 10:03:14,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-04-08 10:03:14,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:14,476 INFO L225 Difference]: With dead ends: 44 [2022-04-08 10:03:14,476 INFO L226 Difference]: Without dead ends: 39 [2022-04-08 10:03:14,476 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2022-04-08 10:03:14,477 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 22 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:14,477 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 30 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:03:14,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-08 10:03:14,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2022-04-08 10:03:14,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:14,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 37 states, 32 states have (on average 1.40625) internal successors, (45), 32 states have internal predecessors, (45), 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-08 10:03:14,510 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 37 states, 32 states have (on average 1.40625) internal successors, (45), 32 states have internal predecessors, (45), 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-08 10:03:14,510 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 37 states, 32 states have (on average 1.40625) internal successors, (45), 32 states have internal predecessors, (45), 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-08 10:03:14,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:14,511 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2022-04-08 10:03:14,511 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2022-04-08 10:03:14,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:14,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:14,511 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.40625) internal successors, (45), 32 states have internal predecessors, (45), 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 39 states. [2022-04-08 10:03:14,512 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.40625) internal successors, (45), 32 states have internal predecessors, (45), 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 39 states. [2022-04-08 10:03:14,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:14,513 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2022-04-08 10:03:14,513 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2022-04-08 10:03:14,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:14,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:14,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:14,513 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:14,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.40625) internal successors, (45), 32 states have internal predecessors, (45), 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-08 10:03:14,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2022-04-08 10:03:14,514 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 18 [2022-04-08 10:03:14,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:14,514 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2022-04-08 10:03:14,514 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-08 10:03:14,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 49 transitions. [2022-04-08 10:03:14,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:14,559 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2022-04-08 10:03:14,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 10:03:14,559 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:14,559 INFO L499 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:14,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 10:03:14,759 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:14,760 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:14,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:14,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1910948929, now seen corresponding path program 5 times [2022-04-08 10:03:14,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:14,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [799361859] [2022-04-08 10:03:14,763 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:14,763 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:14,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1910948929, now seen corresponding path program 6 times [2022-04-08 10:03:14,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:14,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363234505] [2022-04-08 10:03:14,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:14,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:14,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:14,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:14,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:14,834 INFO L290 TraceCheckUtils]: 0: Hoare triple {1560#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1550#true} is VALID [2022-04-08 10:03:14,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {1550#true} assume true; {1550#true} is VALID [2022-04-08 10:03:14,834 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1550#true} {1550#true} #72#return; {1550#true} is VALID [2022-04-08 10:03:14,835 INFO L272 TraceCheckUtils]: 0: Hoare triple {1550#true} call ULTIMATE.init(); {1560#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:14,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {1560#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1550#true} is VALID [2022-04-08 10:03:14,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {1550#true} assume true; {1550#true} is VALID [2022-04-08 10:03:14,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1550#true} {1550#true} #72#return; {1550#true} is VALID [2022-04-08 10:03:14,835 INFO L272 TraceCheckUtils]: 4: Hoare triple {1550#true} call #t~ret13 := main(); {1550#true} is VALID [2022-04-08 10:03:14,836 INFO L290 TraceCheckUtils]: 5: Hoare triple {1550#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1555#(= main_~y~0 0)} is VALID [2022-04-08 10:03:14,836 INFO L290 TraceCheckUtils]: 6: Hoare triple {1555#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1556#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:14,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {1556#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1557#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:14,837 INFO L290 TraceCheckUtils]: 8: Hoare triple {1557#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1558#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:14,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {1558#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {1558#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:14,838 INFO L290 TraceCheckUtils]: 10: Hoare triple {1558#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {1559#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:03:14,838 INFO L290 TraceCheckUtils]: 11: Hoare triple {1559#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {1551#false} is VALID [2022-04-08 10:03:14,838 INFO L290 TraceCheckUtils]: 12: Hoare triple {1551#false} assume !(~y~0 % 4294967296 > 0); {1551#false} is VALID [2022-04-08 10:03:14,839 INFO L290 TraceCheckUtils]: 13: Hoare triple {1551#false} assume !(~x~0 % 4294967296 > 0); {1551#false} is VALID [2022-04-08 10:03:14,839 INFO L272 TraceCheckUtils]: 14: Hoare triple {1551#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1551#false} is VALID [2022-04-08 10:03:14,839 INFO L290 TraceCheckUtils]: 15: Hoare triple {1551#false} ~cond := #in~cond; {1551#false} is VALID [2022-04-08 10:03:14,839 INFO L290 TraceCheckUtils]: 16: Hoare triple {1551#false} assume 0 == ~cond; {1551#false} is VALID [2022-04-08 10:03:14,839 INFO L290 TraceCheckUtils]: 17: Hoare triple {1551#false} assume !false; {1551#false} is VALID [2022-04-08 10:03:14,839 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:14,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:14,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363234505] [2022-04-08 10:03:14,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363234505] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:14,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132318405] [2022-04-08 10:03:14,839 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:03:14,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:14,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:14,840 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:03:14,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 10:03:14,883 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:03:14,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:14,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 10:03:14,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:14,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:15,056 INFO L272 TraceCheckUtils]: 0: Hoare triple {1550#true} call ULTIMATE.init(); {1550#true} is VALID [2022-04-08 10:03:15,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {1550#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1550#true} is VALID [2022-04-08 10:03:15,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {1550#true} assume true; {1550#true} is VALID [2022-04-08 10:03:15,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1550#true} {1550#true} #72#return; {1550#true} is VALID [2022-04-08 10:03:15,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {1550#true} call #t~ret13 := main(); {1550#true} is VALID [2022-04-08 10:03:15,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {1550#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1555#(= main_~y~0 0)} is VALID [2022-04-08 10:03:15,063 INFO L290 TraceCheckUtils]: 6: Hoare triple {1555#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1556#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:15,065 INFO L290 TraceCheckUtils]: 7: Hoare triple {1556#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1557#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:15,066 INFO L290 TraceCheckUtils]: 8: Hoare triple {1557#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1558#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:15,067 INFO L290 TraceCheckUtils]: 9: Hoare triple {1558#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {1558#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:15,067 INFO L290 TraceCheckUtils]: 10: Hoare triple {1558#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {1594#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:03:15,068 INFO L290 TraceCheckUtils]: 11: Hoare triple {1594#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {1551#false} is VALID [2022-04-08 10:03:15,068 INFO L290 TraceCheckUtils]: 12: Hoare triple {1551#false} assume !(~y~0 % 4294967296 > 0); {1551#false} is VALID [2022-04-08 10:03:15,069 INFO L290 TraceCheckUtils]: 13: Hoare triple {1551#false} assume !(~x~0 % 4294967296 > 0); {1551#false} is VALID [2022-04-08 10:03:15,069 INFO L272 TraceCheckUtils]: 14: Hoare triple {1551#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1551#false} is VALID [2022-04-08 10:03:15,069 INFO L290 TraceCheckUtils]: 15: Hoare triple {1551#false} ~cond := #in~cond; {1551#false} is VALID [2022-04-08 10:03:15,071 INFO L290 TraceCheckUtils]: 16: Hoare triple {1551#false} assume 0 == ~cond; {1551#false} is VALID [2022-04-08 10:03:15,071 INFO L290 TraceCheckUtils]: 17: Hoare triple {1551#false} assume !false; {1551#false} is VALID [2022-04-08 10:03:15,071 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:15,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:15,162 INFO L290 TraceCheckUtils]: 17: Hoare triple {1551#false} assume !false; {1551#false} is VALID [2022-04-08 10:03:15,162 INFO L290 TraceCheckUtils]: 16: Hoare triple {1551#false} assume 0 == ~cond; {1551#false} is VALID [2022-04-08 10:03:15,162 INFO L290 TraceCheckUtils]: 15: Hoare triple {1551#false} ~cond := #in~cond; {1551#false} is VALID [2022-04-08 10:03:15,162 INFO L272 TraceCheckUtils]: 14: Hoare triple {1551#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1551#false} is VALID [2022-04-08 10:03:15,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {1551#false} assume !(~x~0 % 4294967296 > 0); {1551#false} is VALID [2022-04-08 10:03:15,162 INFO L290 TraceCheckUtils]: 12: Hoare triple {1551#false} assume !(~y~0 % 4294967296 > 0); {1551#false} is VALID [2022-04-08 10:03:15,162 INFO L290 TraceCheckUtils]: 11: Hoare triple {1634#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1551#false} is VALID [2022-04-08 10:03:15,163 INFO L290 TraceCheckUtils]: 10: Hoare triple {1638#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {1634#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:03:15,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {1638#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {1638#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:15,164 INFO L290 TraceCheckUtils]: 8: Hoare triple {1645#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1638#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:15,164 INFO L290 TraceCheckUtils]: 7: Hoare triple {1649#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1645#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:03:15,165 INFO L290 TraceCheckUtils]: 6: Hoare triple {1653#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1649#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:03:15,165 INFO L290 TraceCheckUtils]: 5: Hoare triple {1550#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1653#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:03:15,165 INFO L272 TraceCheckUtils]: 4: Hoare triple {1550#true} call #t~ret13 := main(); {1550#true} is VALID [2022-04-08 10:03:15,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1550#true} {1550#true} #72#return; {1550#true} is VALID [2022-04-08 10:03:15,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {1550#true} assume true; {1550#true} is VALID [2022-04-08 10:03:15,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {1550#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1550#true} is VALID [2022-04-08 10:03:15,165 INFO L272 TraceCheckUtils]: 0: Hoare triple {1550#true} call ULTIMATE.init(); {1550#true} is VALID [2022-04-08 10:03:15,166 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:15,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132318405] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:15,166 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:15,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-08 10:03:15,166 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:15,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [799361859] [2022-04-08 10:03:15,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [799361859] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:15,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:15,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 10:03:15,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521816444] [2022-04-08 10:03:15,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:15,167 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 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 18 [2022-04-08 10:03:15,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:15,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 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-08 10:03:15,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:15,176 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 10:03:15,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:15,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 10:03:15,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-08 10:03:15,177 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 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-08 10:03:15,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:15,598 INFO L93 Difference]: Finished difference Result 68 states and 98 transitions. [2022-04-08 10:03:15,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 10:03:15,598 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 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 18 [2022-04-08 10:03:15,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:15,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 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-08 10:03:15,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2022-04-08 10:03:15,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 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-08 10:03:15,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2022-04-08 10:03:15,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 65 transitions. [2022-04-08 10:03:15,648 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:15,649 INFO L225 Difference]: With dead ends: 68 [2022-04-08 10:03:15,649 INFO L226 Difference]: Without dead ends: 59 [2022-04-08 10:03:15,650 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-04-08 10:03:15,650 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 44 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:15,650 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 52 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:03:15,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-08 10:03:15,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44. [2022-04-08 10:03:15,685 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:15,686 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 44 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 39 states have internal predecessors, (55), 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-08 10:03:15,686 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 44 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 39 states have internal predecessors, (55), 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-08 10:03:15,686 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 44 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 39 states have internal predecessors, (55), 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-08 10:03:15,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:15,687 INFO L93 Difference]: Finished difference Result 59 states and 78 transitions. [2022-04-08 10:03:15,687 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 78 transitions. [2022-04-08 10:03:15,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:15,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:15,688 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 39 states have internal predecessors, (55), 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 59 states. [2022-04-08 10:03:15,688 INFO L87 Difference]: Start difference. First operand has 44 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 39 states have internal predecessors, (55), 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 59 states. [2022-04-08 10:03:15,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:15,689 INFO L93 Difference]: Finished difference Result 59 states and 78 transitions. [2022-04-08 10:03:15,689 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 78 transitions. [2022-04-08 10:03:15,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:15,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:15,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:15,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:15,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 39 states have internal predecessors, (55), 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-08 10:03:15,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 59 transitions. [2022-04-08 10:03:15,690 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 59 transitions. Word has length 18 [2022-04-08 10:03:15,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:15,691 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 59 transitions. [2022-04-08 10:03:15,691 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 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-08 10:03:15,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 59 transitions. [2022-04-08 10:03:15,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:15,757 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 59 transitions. [2022-04-08 10:03:15,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 10:03:15,758 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:15,758 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:15,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 10:03:15,958 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:15,958 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:15,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:15,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1244950584, now seen corresponding path program 1 times [2022-04-08 10:03:15,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:15,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1708548688] [2022-04-08 10:03:15,969 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:15,969 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:15,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1244950584, now seen corresponding path program 2 times [2022-04-08 10:03:15,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:15,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277113246] [2022-04-08 10:03:15,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:15,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:16,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:16,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:16,149 INFO L290 TraceCheckUtils]: 0: Hoare triple {2038#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2026#true} is VALID [2022-04-08 10:03:16,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {2026#true} assume true; {2026#true} is VALID [2022-04-08 10:03:16,150 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2026#true} {2026#true} #72#return; {2026#true} is VALID [2022-04-08 10:03:16,150 INFO L272 TraceCheckUtils]: 0: Hoare triple {2026#true} call ULTIMATE.init(); {2038#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:16,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {2038#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2026#true} is VALID [2022-04-08 10:03:16,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {2026#true} assume true; {2026#true} is VALID [2022-04-08 10:03:16,150 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2026#true} {2026#true} #72#return; {2026#true} is VALID [2022-04-08 10:03:16,150 INFO L272 TraceCheckUtils]: 4: Hoare triple {2026#true} call #t~ret13 := main(); {2026#true} is VALID [2022-04-08 10:03:16,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {2026#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2031#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-08 10:03:16,152 INFO L290 TraceCheckUtils]: 6: Hoare triple {2031#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2032#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) main_~y~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)))} is VALID [2022-04-08 10:03:16,153 INFO L290 TraceCheckUtils]: 7: Hoare triple {2032#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) main_~y~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)))} assume !(~x~0 % 4294967296 > 0); {2033#(and (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0) main_~n~0))} is VALID [2022-04-08 10:03:16,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {2033#(and (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0) main_~n~0))} ~z~0 := ~y~0; {2033#(and (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0) main_~n~0))} is VALID [2022-04-08 10:03:16,154 INFO L290 TraceCheckUtils]: 9: Hoare triple {2033#(and (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2033#(and (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0) main_~n~0))} is VALID [2022-04-08 10:03:16,155 INFO L290 TraceCheckUtils]: 10: Hoare triple {2033#(and (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {2033#(and (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0) main_~n~0))} is VALID [2022-04-08 10:03:16,157 INFO L290 TraceCheckUtils]: 11: Hoare triple {2033#(and (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2034#(and (<= (+ (* 4294967296 (div (+ main_~n~0 4294967294 (* (- 1) main_~y~0)) 4294967296)) main_~y~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)))} is VALID [2022-04-08 10:03:16,158 INFO L290 TraceCheckUtils]: 12: Hoare triple {2034#(and (<= (+ (* 4294967296 (div (+ main_~n~0 4294967294 (* (- 1) main_~y~0)) 4294967296)) main_~y~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)))} assume !(~y~0 % 4294967296 > 0); {2034#(and (<= (+ (* 4294967296 (div (+ main_~n~0 4294967294 (* (- 1) main_~y~0)) 4294967296)) main_~y~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)))} is VALID [2022-04-08 10:03:16,160 INFO L290 TraceCheckUtils]: 13: Hoare triple {2034#(and (<= (+ (* 4294967296 (div (+ main_~n~0 4294967294 (* (- 1) main_~y~0)) 4294967296)) main_~y~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2035#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:03:16,161 INFO L290 TraceCheckUtils]: 14: Hoare triple {2035#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {2035#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:03:16,161 INFO L272 TraceCheckUtils]: 15: Hoare triple {2035#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2036#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:03:16,162 INFO L290 TraceCheckUtils]: 16: Hoare triple {2036#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2037#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:03:16,162 INFO L290 TraceCheckUtils]: 17: Hoare triple {2037#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2027#false} is VALID [2022-04-08 10:03:16,162 INFO L290 TraceCheckUtils]: 18: Hoare triple {2027#false} assume !false; {2027#false} is VALID [2022-04-08 10:03:16,162 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 10:03:16,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:16,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277113246] [2022-04-08 10:03:16,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277113246] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:16,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224088475] [2022-04-08 10:03:16,163 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:03:16,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:16,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:16,164 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:03:16,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 10:03:16,194 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:03:16,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:16,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 10:03:16,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:16,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:16,567 INFO L272 TraceCheckUtils]: 0: Hoare triple {2026#true} call ULTIMATE.init(); {2026#true} is VALID [2022-04-08 10:03:16,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {2026#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2026#true} is VALID [2022-04-08 10:03:16,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {2026#true} assume true; {2026#true} is VALID [2022-04-08 10:03:16,567 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2026#true} {2026#true} #72#return; {2026#true} is VALID [2022-04-08 10:03:16,567 INFO L272 TraceCheckUtils]: 4: Hoare triple {2026#true} call #t~ret13 := main(); {2026#true} is VALID [2022-04-08 10:03:16,568 INFO L290 TraceCheckUtils]: 5: Hoare triple {2026#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2031#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-08 10:03:16,568 INFO L290 TraceCheckUtils]: 6: Hoare triple {2031#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2060#(and (= (+ main_~x~0 1) main_~n~0) (= (+ (- 1) main_~y~0) 0) (< 0 (mod main_~n~0 4294967296)))} is VALID [2022-04-08 10:03:16,569 INFO L290 TraceCheckUtils]: 7: Hoare triple {2060#(and (= (+ main_~x~0 1) main_~n~0) (= (+ (- 1) main_~y~0) 0) (< 0 (mod main_~n~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {2064#(and (= (+ main_~x~0 1) main_~n~0) (= main_~y~0 1) (<= (mod main_~x~0 4294967296) 0))} is VALID [2022-04-08 10:03:16,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {2064#(and (= (+ main_~x~0 1) main_~n~0) (= main_~y~0 1) (<= (mod main_~x~0 4294967296) 0))} ~z~0 := ~y~0; {2068#(and (= (+ main_~x~0 1) main_~n~0) (= main_~z~0 main_~y~0) (= main_~y~0 1) (<= (mod main_~x~0 4294967296) 0))} is VALID [2022-04-08 10:03:16,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {2068#(and (= (+ main_~x~0 1) main_~n~0) (= main_~z~0 main_~y~0) (= main_~y~0 1) (<= (mod main_~x~0 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2072#(and (= main_~n~0 main_~x~0) (= main_~y~0 1) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0))} is VALID [2022-04-08 10:03:16,571 INFO L290 TraceCheckUtils]: 10: Hoare triple {2072#(and (= main_~n~0 main_~x~0) (= main_~y~0 1) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {2072#(and (= main_~n~0 main_~x~0) (= main_~y~0 1) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0))} is VALID [2022-04-08 10:03:16,571 INFO L290 TraceCheckUtils]: 11: Hoare triple {2072#(and (= main_~n~0 main_~x~0) (= main_~y~0 1) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2079#(and (= main_~n~0 main_~x~0) (= (+ main_~y~0 1) 1) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0))} is VALID [2022-04-08 10:03:16,572 INFO L290 TraceCheckUtils]: 12: Hoare triple {2079#(and (= main_~n~0 main_~x~0) (= (+ main_~y~0 1) 1) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {2079#(and (= main_~n~0 main_~x~0) (= (+ main_~y~0 1) 1) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0))} is VALID [2022-04-08 10:03:16,572 INFO L290 TraceCheckUtils]: 13: Hoare triple {2079#(and (= main_~n~0 main_~x~0) (= (+ main_~y~0 1) 1) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2086#(and (= main_~y~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-08 10:03:16,574 INFO L290 TraceCheckUtils]: 14: Hoare triple {2086#(and (= main_~y~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {2086#(and (= main_~y~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-08 10:03:16,575 INFO L272 TraceCheckUtils]: 15: Hoare triple {2086#(and (= main_~y~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2093#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:03:16,575 INFO L290 TraceCheckUtils]: 16: Hoare triple {2093#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2097#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:03:16,576 INFO L290 TraceCheckUtils]: 17: Hoare triple {2097#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2027#false} is VALID [2022-04-08 10:03:16,576 INFO L290 TraceCheckUtils]: 18: Hoare triple {2027#false} assume !false; {2027#false} is VALID [2022-04-08 10:03:16,576 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:16,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:17,033 INFO L290 TraceCheckUtils]: 18: Hoare triple {2027#false} assume !false; {2027#false} is VALID [2022-04-08 10:03:17,033 INFO L290 TraceCheckUtils]: 17: Hoare triple {2097#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2027#false} is VALID [2022-04-08 10:03:17,033 INFO L290 TraceCheckUtils]: 16: Hoare triple {2093#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2097#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:03:17,034 INFO L272 TraceCheckUtils]: 15: Hoare triple {2035#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2093#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:03:17,035 INFO L290 TraceCheckUtils]: 14: Hoare triple {2035#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {2035#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:03:17,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {2119#(and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2035#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:03:17,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {2119#(and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {2119#(and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:03:17,037 INFO L290 TraceCheckUtils]: 11: Hoare triple {2035#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2119#(and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:03:17,037 INFO L290 TraceCheckUtils]: 10: Hoare triple {2035#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {2035#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:03:17,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {2132#(or (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))) (<= (mod main_~z~0 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2035#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:03:17,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {2136#(or (<= (mod main_~y~0 4294967296) 0) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} ~z~0 := ~y~0; {2132#(or (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:03:17,039 INFO L290 TraceCheckUtils]: 7: Hoare triple {2140#(or (<= (mod main_~y~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} assume !(~x~0 % 4294967296 > 0); {2136#(or (<= (mod main_~y~0 4294967296) 0) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-08 10:03:17,041 INFO L290 TraceCheckUtils]: 6: Hoare triple {2144#(or (<= (mod (+ main_~y~0 1) 4294967296) 0) (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2140#(or (<= (mod main_~y~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-08 10:03:17,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {2026#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2144#(or (<= (mod (+ main_~y~0 1) 4294967296) 0) (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-08 10:03:17,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {2026#true} call #t~ret13 := main(); {2026#true} is VALID [2022-04-08 10:03:17,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2026#true} {2026#true} #72#return; {2026#true} is VALID [2022-04-08 10:03:17,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {2026#true} assume true; {2026#true} is VALID [2022-04-08 10:03:17,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {2026#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2026#true} is VALID [2022-04-08 10:03:17,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {2026#true} call ULTIMATE.init(); {2026#true} is VALID [2022-04-08 10:03:17,042 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:17,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224088475] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:17,043 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:17,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 23 [2022-04-08 10:03:17,043 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:17,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1708548688] [2022-04-08 10:03:17,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1708548688] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:17,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:17,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 10:03:17,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503764628] [2022-04-08 10:03:17,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:17,043 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-08 10:03:17,044 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:17,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.5) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:17,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:17,065 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 10:03:17,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:17,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 10:03:17,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2022-04-08 10:03:17,066 INFO L87 Difference]: Start difference. First operand 44 states and 59 transitions. Second operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:17,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:17,545 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2022-04-08 10:03:17,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 10:03:17,545 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-08 10:03:17,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:17,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:17,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2022-04-08 10:03:17,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:17,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2022-04-08 10:03:17,547 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 36 transitions. [2022-04-08 10:03:17,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:17,586 INFO L225 Difference]: With dead ends: 57 [2022-04-08 10:03:17,587 INFO L226 Difference]: Without dead ends: 52 [2022-04-08 10:03:17,587 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2022-04-08 10:03:17,587 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 31 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:17,587 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 46 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:03:17,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-08 10:03:17,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2022-04-08 10:03:17,664 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:17,665 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 50 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 45 states have internal predecessors, (62), 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-08 10:03:17,665 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 50 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 45 states have internal predecessors, (62), 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-08 10:03:17,665 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 50 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 45 states have internal predecessors, (62), 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-08 10:03:17,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:17,667 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2022-04-08 10:03:17,667 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 68 transitions. [2022-04-08 10:03:17,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:17,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:17,668 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 45 states have internal predecessors, (62), 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 52 states. [2022-04-08 10:03:17,668 INFO L87 Difference]: Start difference. First operand has 50 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 45 states have internal predecessors, (62), 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 52 states. [2022-04-08 10:03:17,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:17,669 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2022-04-08 10:03:17,669 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 68 transitions. [2022-04-08 10:03:17,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:17,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:17,670 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:17,670 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:17,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 45 states have internal predecessors, (62), 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-08 10:03:17,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2022-04-08 10:03:17,671 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 19 [2022-04-08 10:03:17,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:17,671 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 66 transitions. [2022-04-08 10:03:17,671 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:17,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 66 transitions. [2022-04-08 10:03:17,750 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:17,750 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2022-04-08 10:03:17,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 10:03:17,750 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:17,750 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:17,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-08 10:03:17,950 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:17,951 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:17,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:17,951 INFO L85 PathProgramCache]: Analyzing trace with hash -343761690, now seen corresponding path program 3 times [2022-04-08 10:03:17,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:17,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [519616146] [2022-04-08 10:03:17,954 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:17,954 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:17,954 INFO L85 PathProgramCache]: Analyzing trace with hash -343761690, now seen corresponding path program 4 times [2022-04-08 10:03:17,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:17,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776006565] [2022-04-08 10:03:17,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:17,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:18,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:18,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:18,011 INFO L290 TraceCheckUtils]: 0: Hoare triple {2504#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2495#true} is VALID [2022-04-08 10:03:18,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {2495#true} assume true; {2495#true} is VALID [2022-04-08 10:03:18,011 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2495#true} {2495#true} #72#return; {2495#true} is VALID [2022-04-08 10:03:18,012 INFO L272 TraceCheckUtils]: 0: Hoare triple {2495#true} call ULTIMATE.init(); {2504#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:18,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {2504#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2495#true} is VALID [2022-04-08 10:03:18,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {2495#true} assume true; {2495#true} is VALID [2022-04-08 10:03:18,012 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2495#true} {2495#true} #72#return; {2495#true} is VALID [2022-04-08 10:03:18,012 INFO L272 TraceCheckUtils]: 4: Hoare triple {2495#true} call #t~ret13 := main(); {2495#true} is VALID [2022-04-08 10:03:18,014 INFO L290 TraceCheckUtils]: 5: Hoare triple {2495#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2500#(= main_~y~0 0)} is VALID [2022-04-08 10:03:18,014 INFO L290 TraceCheckUtils]: 6: Hoare triple {2500#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2501#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:18,014 INFO L290 TraceCheckUtils]: 7: Hoare triple {2501#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {2501#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:18,015 INFO L290 TraceCheckUtils]: 8: Hoare triple {2501#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {2502#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:03:18,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {2502#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2503#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:03:18,016 INFO L290 TraceCheckUtils]: 10: Hoare triple {2503#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2496#false} is VALID [2022-04-08 10:03:18,016 INFO L290 TraceCheckUtils]: 11: Hoare triple {2496#false} assume !(~z~0 % 4294967296 > 0); {2496#false} is VALID [2022-04-08 10:03:18,017 INFO L290 TraceCheckUtils]: 12: Hoare triple {2496#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2496#false} is VALID [2022-04-08 10:03:18,017 INFO L290 TraceCheckUtils]: 13: Hoare triple {2496#false} assume !(~y~0 % 4294967296 > 0); {2496#false} is VALID [2022-04-08 10:03:18,017 INFO L290 TraceCheckUtils]: 14: Hoare triple {2496#false} assume !(~x~0 % 4294967296 > 0); {2496#false} is VALID [2022-04-08 10:03:18,017 INFO L272 TraceCheckUtils]: 15: Hoare triple {2496#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2496#false} is VALID [2022-04-08 10:03:18,017 INFO L290 TraceCheckUtils]: 16: Hoare triple {2496#false} ~cond := #in~cond; {2496#false} is VALID [2022-04-08 10:03:18,017 INFO L290 TraceCheckUtils]: 17: Hoare triple {2496#false} assume 0 == ~cond; {2496#false} is VALID [2022-04-08 10:03:18,017 INFO L290 TraceCheckUtils]: 18: Hoare triple {2496#false} assume !false; {2496#false} is VALID [2022-04-08 10:03:18,017 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 10:03:18,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:18,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776006565] [2022-04-08 10:03:18,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776006565] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:18,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877739124] [2022-04-08 10:03:18,017 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:03:18,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:18,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:18,018 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:03:18,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-08 10:03:18,061 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:03:18,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:18,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 10:03:18,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:18,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:18,160 INFO L272 TraceCheckUtils]: 0: Hoare triple {2495#true} call ULTIMATE.init(); {2495#true} is VALID [2022-04-08 10:03:18,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {2495#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2495#true} is VALID [2022-04-08 10:03:18,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {2495#true} assume true; {2495#true} is VALID [2022-04-08 10:03:18,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2495#true} {2495#true} #72#return; {2495#true} is VALID [2022-04-08 10:03:18,161 INFO L272 TraceCheckUtils]: 4: Hoare triple {2495#true} call #t~ret13 := main(); {2495#true} is VALID [2022-04-08 10:03:18,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {2495#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2500#(= main_~y~0 0)} is VALID [2022-04-08 10:03:18,161 INFO L290 TraceCheckUtils]: 6: Hoare triple {2500#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2501#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:18,162 INFO L290 TraceCheckUtils]: 7: Hoare triple {2501#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {2501#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:18,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {2501#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {2532#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:18,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {2532#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2536#(and (<= 1 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:18,163 INFO L290 TraceCheckUtils]: 10: Hoare triple {2536#(and (<= 1 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (<= main_~y~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2496#false} is VALID [2022-04-08 10:03:18,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {2496#false} assume !(~z~0 % 4294967296 > 0); {2496#false} is VALID [2022-04-08 10:03:18,163 INFO L290 TraceCheckUtils]: 12: Hoare triple {2496#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2496#false} is VALID [2022-04-08 10:03:18,163 INFO L290 TraceCheckUtils]: 13: Hoare triple {2496#false} assume !(~y~0 % 4294967296 > 0); {2496#false} is VALID [2022-04-08 10:03:18,163 INFO L290 TraceCheckUtils]: 14: Hoare triple {2496#false} assume !(~x~0 % 4294967296 > 0); {2496#false} is VALID [2022-04-08 10:03:18,163 INFO L272 TraceCheckUtils]: 15: Hoare triple {2496#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2496#false} is VALID [2022-04-08 10:03:18,163 INFO L290 TraceCheckUtils]: 16: Hoare triple {2496#false} ~cond := #in~cond; {2496#false} is VALID [2022-04-08 10:03:18,163 INFO L290 TraceCheckUtils]: 17: Hoare triple {2496#false} assume 0 == ~cond; {2496#false} is VALID [2022-04-08 10:03:18,163 INFO L290 TraceCheckUtils]: 18: Hoare triple {2496#false} assume !false; {2496#false} is VALID [2022-04-08 10:03:18,163 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 10:03:18,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:18,262 INFO L290 TraceCheckUtils]: 18: Hoare triple {2496#false} assume !false; {2496#false} is VALID [2022-04-08 10:03:18,262 INFO L290 TraceCheckUtils]: 17: Hoare triple {2496#false} assume 0 == ~cond; {2496#false} is VALID [2022-04-08 10:03:18,262 INFO L290 TraceCheckUtils]: 16: Hoare triple {2496#false} ~cond := #in~cond; {2496#false} is VALID [2022-04-08 10:03:18,262 INFO L272 TraceCheckUtils]: 15: Hoare triple {2496#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2496#false} is VALID [2022-04-08 10:03:18,263 INFO L290 TraceCheckUtils]: 14: Hoare triple {2496#false} assume !(~x~0 % 4294967296 > 0); {2496#false} is VALID [2022-04-08 10:03:18,263 INFO L290 TraceCheckUtils]: 13: Hoare triple {2579#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {2496#false} is VALID [2022-04-08 10:03:18,264 INFO L290 TraceCheckUtils]: 12: Hoare triple {2583#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2579#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:18,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {2583#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {2583#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:18,264 INFO L290 TraceCheckUtils]: 10: Hoare triple {2590#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2583#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:18,265 INFO L290 TraceCheckUtils]: 9: Hoare triple {2594#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2590#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-08 10:03:18,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {2495#true} ~z~0 := ~y~0; {2594#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:03:18,265 INFO L290 TraceCheckUtils]: 7: Hoare triple {2495#true} assume !(~x~0 % 4294967296 > 0); {2495#true} is VALID [2022-04-08 10:03:18,266 INFO L290 TraceCheckUtils]: 6: Hoare triple {2495#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2495#true} is VALID [2022-04-08 10:03:18,266 INFO L290 TraceCheckUtils]: 5: Hoare triple {2495#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2495#true} is VALID [2022-04-08 10:03:18,266 INFO L272 TraceCheckUtils]: 4: Hoare triple {2495#true} call #t~ret13 := main(); {2495#true} is VALID [2022-04-08 10:03:18,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2495#true} {2495#true} #72#return; {2495#true} is VALID [2022-04-08 10:03:18,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {2495#true} assume true; {2495#true} is VALID [2022-04-08 10:03:18,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {2495#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2495#true} is VALID [2022-04-08 10:03:18,266 INFO L272 TraceCheckUtils]: 0: Hoare triple {2495#true} call ULTIMATE.init(); {2495#true} is VALID [2022-04-08 10:03:18,266 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 10:03:18,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877739124] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:18,266 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:18,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2022-04-08 10:03:18,266 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:18,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [519616146] [2022-04-08 10:03:18,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [519616146] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:18,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:18,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 10:03:18,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505048302] [2022-04-08 10:03:18,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:18,267 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-08 10:03:18,267 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:18,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:18,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:18,283 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 10:03:18,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:18,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 10:03:18,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-04-08 10:03:18,284 INFO L87 Difference]: Start difference. First operand 50 states and 66 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:18,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:18,555 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2022-04-08 10:03:18,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 10:03:18,555 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-08 10:03:18,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:18,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:18,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 43 transitions. [2022-04-08 10:03:18,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:18,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 43 transitions. [2022-04-08 10:03:18,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 43 transitions. [2022-04-08 10:03:18,590 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:18,590 INFO L225 Difference]: With dead ends: 60 [2022-04-08 10:03:18,590 INFO L226 Difference]: Without dead ends: 49 [2022-04-08 10:03:18,591 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-04-08 10:03:18,591 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 24 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:18,591 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 36 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:03:18,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-08 10:03:18,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2022-04-08 10:03:18,658 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:18,659 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 46 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 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-08 10:03:18,659 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 46 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 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-08 10:03:18,660 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 46 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 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-08 10:03:18,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:18,667 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2022-04-08 10:03:18,667 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2022-04-08 10:03:18,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:18,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:18,667 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 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 49 states. [2022-04-08 10:03:18,667 INFO L87 Difference]: Start difference. First operand has 46 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 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 49 states. [2022-04-08 10:03:18,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:18,668 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2022-04-08 10:03:18,668 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2022-04-08 10:03:18,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:18,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:18,669 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:18,669 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:18,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 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-08 10:03:18,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 59 transitions. [2022-04-08 10:03:18,669 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 59 transitions. Word has length 19 [2022-04-08 10:03:18,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:18,670 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 59 transitions. [2022-04-08 10:03:18,670 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:18,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 59 transitions. [2022-04-08 10:03:18,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:18,731 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2022-04-08 10:03:18,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 10:03:18,731 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:18,731 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:18,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-08 10:03:18,931 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:18,931 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:18,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:18,932 INFO L85 PathProgramCache]: Analyzing trace with hash 146579608, now seen corresponding path program 7 times [2022-04-08 10:03:18,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:18,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [595528193] [2022-04-08 10:03:18,935 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:18,935 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:18,935 INFO L85 PathProgramCache]: Analyzing trace with hash 146579608, now seen corresponding path program 8 times [2022-04-08 10:03:18,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:18,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081141482] [2022-04-08 10:03:18,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:18,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:18,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:19,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:19,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {2957#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2946#true} is VALID [2022-04-08 10:03:19,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {2946#true} assume true; {2946#true} is VALID [2022-04-08 10:03:19,024 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2946#true} {2946#true} #72#return; {2946#true} is VALID [2022-04-08 10:03:19,024 INFO L272 TraceCheckUtils]: 0: Hoare triple {2946#true} call ULTIMATE.init(); {2957#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:19,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {2957#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2946#true} is VALID [2022-04-08 10:03:19,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {2946#true} assume true; {2946#true} is VALID [2022-04-08 10:03:19,024 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2946#true} {2946#true} #72#return; {2946#true} is VALID [2022-04-08 10:03:19,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {2946#true} call #t~ret13 := main(); {2946#true} is VALID [2022-04-08 10:03:19,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {2946#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2951#(= main_~y~0 0)} is VALID [2022-04-08 10:03:19,025 INFO L290 TraceCheckUtils]: 6: Hoare triple {2951#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2952#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:19,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {2952#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2953#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:19,026 INFO L290 TraceCheckUtils]: 8: Hoare triple {2953#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2954#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:19,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {2954#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2955#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:19,027 INFO L290 TraceCheckUtils]: 10: Hoare triple {2955#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {2955#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:19,027 INFO L290 TraceCheckUtils]: 11: Hoare triple {2955#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {2956#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:03:19,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {2956#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {2947#false} is VALID [2022-04-08 10:03:19,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {2947#false} assume !(~y~0 % 4294967296 > 0); {2947#false} is VALID [2022-04-08 10:03:19,028 INFO L290 TraceCheckUtils]: 14: Hoare triple {2947#false} assume !(~x~0 % 4294967296 > 0); {2947#false} is VALID [2022-04-08 10:03:19,028 INFO L272 TraceCheckUtils]: 15: Hoare triple {2947#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2947#false} is VALID [2022-04-08 10:03:19,028 INFO L290 TraceCheckUtils]: 16: Hoare triple {2947#false} ~cond := #in~cond; {2947#false} is VALID [2022-04-08 10:03:19,028 INFO L290 TraceCheckUtils]: 17: Hoare triple {2947#false} assume 0 == ~cond; {2947#false} is VALID [2022-04-08 10:03:19,028 INFO L290 TraceCheckUtils]: 18: Hoare triple {2947#false} assume !false; {2947#false} is VALID [2022-04-08 10:03:19,028 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:19,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:19,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081141482] [2022-04-08 10:03:19,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081141482] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:19,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300736849] [2022-04-08 10:03:19,029 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:03:19,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:19,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:19,029 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:03:19,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-08 10:03:19,066 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:03:19,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:19,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 10:03:19,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:19,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:19,204 INFO L272 TraceCheckUtils]: 0: Hoare triple {2946#true} call ULTIMATE.init(); {2946#true} is VALID [2022-04-08 10:03:19,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {2946#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2946#true} is VALID [2022-04-08 10:03:19,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {2946#true} assume true; {2946#true} is VALID [2022-04-08 10:03:19,204 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2946#true} {2946#true} #72#return; {2946#true} is VALID [2022-04-08 10:03:19,204 INFO L272 TraceCheckUtils]: 4: Hoare triple {2946#true} call #t~ret13 := main(); {2946#true} is VALID [2022-04-08 10:03:19,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {2946#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2951#(= main_~y~0 0)} is VALID [2022-04-08 10:03:19,205 INFO L290 TraceCheckUtils]: 6: Hoare triple {2951#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2952#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:19,205 INFO L290 TraceCheckUtils]: 7: Hoare triple {2952#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2953#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:19,206 INFO L290 TraceCheckUtils]: 8: Hoare triple {2953#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2954#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:19,206 INFO L290 TraceCheckUtils]: 9: Hoare triple {2954#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2955#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:19,206 INFO L290 TraceCheckUtils]: 10: Hoare triple {2955#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {2955#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:19,207 INFO L290 TraceCheckUtils]: 11: Hoare triple {2955#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {2994#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:03:19,207 INFO L290 TraceCheckUtils]: 12: Hoare triple {2994#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {2947#false} is VALID [2022-04-08 10:03:19,207 INFO L290 TraceCheckUtils]: 13: Hoare triple {2947#false} assume !(~y~0 % 4294967296 > 0); {2947#false} is VALID [2022-04-08 10:03:19,207 INFO L290 TraceCheckUtils]: 14: Hoare triple {2947#false} assume !(~x~0 % 4294967296 > 0); {2947#false} is VALID [2022-04-08 10:03:19,207 INFO L272 TraceCheckUtils]: 15: Hoare triple {2947#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2947#false} is VALID [2022-04-08 10:03:19,207 INFO L290 TraceCheckUtils]: 16: Hoare triple {2947#false} ~cond := #in~cond; {2947#false} is VALID [2022-04-08 10:03:19,207 INFO L290 TraceCheckUtils]: 17: Hoare triple {2947#false} assume 0 == ~cond; {2947#false} is VALID [2022-04-08 10:03:19,207 INFO L290 TraceCheckUtils]: 18: Hoare triple {2947#false} assume !false; {2947#false} is VALID [2022-04-08 10:03:19,207 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:19,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:19,291 INFO L290 TraceCheckUtils]: 18: Hoare triple {2947#false} assume !false; {2947#false} is VALID [2022-04-08 10:03:19,292 INFO L290 TraceCheckUtils]: 17: Hoare triple {2947#false} assume 0 == ~cond; {2947#false} is VALID [2022-04-08 10:03:19,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {2947#false} ~cond := #in~cond; {2947#false} is VALID [2022-04-08 10:03:19,292 INFO L272 TraceCheckUtils]: 15: Hoare triple {2947#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2947#false} is VALID [2022-04-08 10:03:19,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {2947#false} assume !(~x~0 % 4294967296 > 0); {2947#false} is VALID [2022-04-08 10:03:19,292 INFO L290 TraceCheckUtils]: 13: Hoare triple {2947#false} assume !(~y~0 % 4294967296 > 0); {2947#false} is VALID [2022-04-08 10:03:19,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {3034#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {2947#false} is VALID [2022-04-08 10:03:19,292 INFO L290 TraceCheckUtils]: 11: Hoare triple {3038#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {3034#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:03:19,293 INFO L290 TraceCheckUtils]: 10: Hoare triple {3038#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {3038#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:19,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {3045#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3038#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:19,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {3049#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3045#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:03:19,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {3053#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3049#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:03:19,295 INFO L290 TraceCheckUtils]: 6: Hoare triple {3057#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3053#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:03:19,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {2946#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3057#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:03:19,297 INFO L272 TraceCheckUtils]: 4: Hoare triple {2946#true} call #t~ret13 := main(); {2946#true} is VALID [2022-04-08 10:03:19,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2946#true} {2946#true} #72#return; {2946#true} is VALID [2022-04-08 10:03:19,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {2946#true} assume true; {2946#true} is VALID [2022-04-08 10:03:19,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {2946#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2946#true} is VALID [2022-04-08 10:03:19,297 INFO L272 TraceCheckUtils]: 0: Hoare triple {2946#true} call ULTIMATE.init(); {2946#true} is VALID [2022-04-08 10:03:19,297 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:19,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300736849] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:19,297 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:19,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-08 10:03:19,297 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:19,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [595528193] [2022-04-08 10:03:19,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [595528193] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:19,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:19,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 10:03:19,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613859462] [2022-04-08 10:03:19,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:19,298 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-08 10:03:19,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:19,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:19,309 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:19,309 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 10:03:19,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:19,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 10:03:19,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-04-08 10:03:19,310 INFO L87 Difference]: Start difference. First operand 46 states and 59 transitions. Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:19,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:19,819 INFO L93 Difference]: Finished difference Result 82 states and 116 transitions. [2022-04-08 10:03:19,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 10:03:19,819 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-08 10:03:19,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:19,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:19,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 75 transitions. [2022-04-08 10:03:19,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:19,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 75 transitions. [2022-04-08 10:03:19,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 75 transitions. [2022-04-08 10:03:19,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:19,864 INFO L225 Difference]: With dead ends: 82 [2022-04-08 10:03:19,864 INFO L226 Difference]: Without dead ends: 73 [2022-04-08 10:03:19,864 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2022-04-08 10:03:19,865 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 52 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:19,865 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 62 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:03:19,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-08 10:03:19,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 53. [2022-04-08 10:03:19,928 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:19,929 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 53 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 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-08 10:03:19,929 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 53 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 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-08 10:03:19,938 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 53 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 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-08 10:03:19,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:19,940 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2022-04-08 10:03:19,940 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 94 transitions. [2022-04-08 10:03:19,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:19,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:19,941 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 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 73 states. [2022-04-08 10:03:19,941 INFO L87 Difference]: Start difference. First operand has 53 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 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 73 states. [2022-04-08 10:03:19,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:19,942 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2022-04-08 10:03:19,942 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 94 transitions. [2022-04-08 10:03:19,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:19,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:19,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:19,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:19,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 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-08 10:03:19,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 69 transitions. [2022-04-08 10:03:19,943 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 69 transitions. Word has length 19 [2022-04-08 10:03:19,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:19,943 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 69 transitions. [2022-04-08 10:03:19,943 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:03:19,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 69 transitions. [2022-04-08 10:03:20,005 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:20,005 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 69 transitions. [2022-04-08 10:03:20,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 10:03:20,005 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:20,005 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:20,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-08 10:03:20,206 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:20,206 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:20,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:20,206 INFO L85 PathProgramCache]: Analyzing trace with hash 95732656, now seen corresponding path program 3 times [2022-04-08 10:03:20,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:20,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1303617223] [2022-04-08 10:03:20,209 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:20,209 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:20,210 INFO L85 PathProgramCache]: Analyzing trace with hash 95732656, now seen corresponding path program 4 times [2022-04-08 10:03:20,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:20,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954758684] [2022-04-08 10:03:20,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:20,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:20,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:20,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:20,263 INFO L290 TraceCheckUtils]: 0: Hoare triple {3513#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3506#true} is VALID [2022-04-08 10:03:20,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {3506#true} assume true; {3506#true} is VALID [2022-04-08 10:03:20,264 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3506#true} {3506#true} #72#return; {3506#true} is VALID [2022-04-08 10:03:20,264 INFO L272 TraceCheckUtils]: 0: Hoare triple {3506#true} call ULTIMATE.init(); {3513#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:20,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {3513#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3506#true} is VALID [2022-04-08 10:03:20,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {3506#true} assume true; {3506#true} is VALID [2022-04-08 10:03:20,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3506#true} {3506#true} #72#return; {3506#true} is VALID [2022-04-08 10:03:20,264 INFO L272 TraceCheckUtils]: 4: Hoare triple {3506#true} call #t~ret13 := main(); {3506#true} is VALID [2022-04-08 10:03:20,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {3506#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3506#true} is VALID [2022-04-08 10:03:20,264 INFO L290 TraceCheckUtils]: 6: Hoare triple {3506#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3506#true} is VALID [2022-04-08 10:03:20,265 INFO L290 TraceCheckUtils]: 7: Hoare triple {3506#true} assume !(~x~0 % 4294967296 > 0); {3511#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:20,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {3511#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {3511#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:20,266 INFO L290 TraceCheckUtils]: 9: Hoare triple {3511#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3512#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:03:20,266 INFO L290 TraceCheckUtils]: 10: Hoare triple {3512#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {3512#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:03:20,266 INFO L290 TraceCheckUtils]: 11: Hoare triple {3512#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3512#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:03:20,267 INFO L290 TraceCheckUtils]: 12: Hoare triple {3512#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {3512#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:03:20,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {3512#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3511#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:20,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {3511#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3507#false} is VALID [2022-04-08 10:03:20,268 INFO L290 TraceCheckUtils]: 15: Hoare triple {3507#false} assume !(~x~0 % 4294967296 > 0); {3507#false} is VALID [2022-04-08 10:03:20,268 INFO L272 TraceCheckUtils]: 16: Hoare triple {3507#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3507#false} is VALID [2022-04-08 10:03:20,268 INFO L290 TraceCheckUtils]: 17: Hoare triple {3507#false} ~cond := #in~cond; {3507#false} is VALID [2022-04-08 10:03:20,268 INFO L290 TraceCheckUtils]: 18: Hoare triple {3507#false} assume 0 == ~cond; {3507#false} is VALID [2022-04-08 10:03:20,268 INFO L290 TraceCheckUtils]: 19: Hoare triple {3507#false} assume !false; {3507#false} is VALID [2022-04-08 10:03:20,268 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:03:20,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:20,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954758684] [2022-04-08 10:03:20,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954758684] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:20,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822729205] [2022-04-08 10:03:20,269 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:03:20,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:20,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:20,284 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:03:20,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-08 10:03:20,324 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:03:20,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:20,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-08 10:03:20,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:20,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:20,516 INFO L272 TraceCheckUtils]: 0: Hoare triple {3506#true} call ULTIMATE.init(); {3506#true} is VALID [2022-04-08 10:03:20,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {3506#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3506#true} is VALID [2022-04-08 10:03:20,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {3506#true} assume true; {3506#true} is VALID [2022-04-08 10:03:20,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3506#true} {3506#true} #72#return; {3506#true} is VALID [2022-04-08 10:03:20,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {3506#true} call #t~ret13 := main(); {3506#true} is VALID [2022-04-08 10:03:20,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {3506#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3506#true} is VALID [2022-04-08 10:03:20,517 INFO L290 TraceCheckUtils]: 6: Hoare triple {3506#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3506#true} is VALID [2022-04-08 10:03:20,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {3506#true} assume !(~x~0 % 4294967296 > 0); {3511#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:20,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {3511#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {3511#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:20,518 INFO L290 TraceCheckUtils]: 9: Hoare triple {3511#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3512#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:03:20,518 INFO L290 TraceCheckUtils]: 10: Hoare triple {3512#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {3512#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:03:20,519 INFO L290 TraceCheckUtils]: 11: Hoare triple {3512#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3512#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:03:20,519 INFO L290 TraceCheckUtils]: 12: Hoare triple {3512#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {3512#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:03:20,520 INFO L290 TraceCheckUtils]: 13: Hoare triple {3512#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3511#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:20,520 INFO L290 TraceCheckUtils]: 14: Hoare triple {3511#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3507#false} is VALID [2022-04-08 10:03:20,520 INFO L290 TraceCheckUtils]: 15: Hoare triple {3507#false} assume !(~x~0 % 4294967296 > 0); {3507#false} is VALID [2022-04-08 10:03:20,520 INFO L272 TraceCheckUtils]: 16: Hoare triple {3507#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3507#false} is VALID [2022-04-08 10:03:20,520 INFO L290 TraceCheckUtils]: 17: Hoare triple {3507#false} ~cond := #in~cond; {3507#false} is VALID [2022-04-08 10:03:20,520 INFO L290 TraceCheckUtils]: 18: Hoare triple {3507#false} assume 0 == ~cond; {3507#false} is VALID [2022-04-08 10:03:20,520 INFO L290 TraceCheckUtils]: 19: Hoare triple {3507#false} assume !false; {3507#false} is VALID [2022-04-08 10:03:20,521 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:03:20,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:20,677 INFO L290 TraceCheckUtils]: 19: Hoare triple {3507#false} assume !false; {3507#false} is VALID [2022-04-08 10:03:20,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {3507#false} assume 0 == ~cond; {3507#false} is VALID [2022-04-08 10:03:20,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {3507#false} ~cond := #in~cond; {3507#false} is VALID [2022-04-08 10:03:20,678 INFO L272 TraceCheckUtils]: 16: Hoare triple {3507#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3507#false} is VALID [2022-04-08 10:03:20,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {3507#false} assume !(~x~0 % 4294967296 > 0); {3507#false} is VALID [2022-04-08 10:03:20,680 INFO L290 TraceCheckUtils]: 14: Hoare triple {3511#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3507#false} is VALID [2022-04-08 10:03:20,681 INFO L290 TraceCheckUtils]: 13: Hoare triple {3512#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3511#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:20,681 INFO L290 TraceCheckUtils]: 12: Hoare triple {3512#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {3512#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:03:20,681 INFO L290 TraceCheckUtils]: 11: Hoare triple {3512#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3512#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:03:20,682 INFO L290 TraceCheckUtils]: 10: Hoare triple {3512#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {3512#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:03:20,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {3511#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3512#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:03:20,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {3511#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {3511#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:20,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {3506#true} assume !(~x~0 % 4294967296 > 0); {3511#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:20,683 INFO L290 TraceCheckUtils]: 6: Hoare triple {3506#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3506#true} is VALID [2022-04-08 10:03:20,683 INFO L290 TraceCheckUtils]: 5: Hoare triple {3506#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3506#true} is VALID [2022-04-08 10:03:20,683 INFO L272 TraceCheckUtils]: 4: Hoare triple {3506#true} call #t~ret13 := main(); {3506#true} is VALID [2022-04-08 10:03:20,683 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3506#true} {3506#true} #72#return; {3506#true} is VALID [2022-04-08 10:03:20,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {3506#true} assume true; {3506#true} is VALID [2022-04-08 10:03:20,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {3506#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3506#true} is VALID [2022-04-08 10:03:20,684 INFO L272 TraceCheckUtils]: 0: Hoare triple {3506#true} call ULTIMATE.init(); {3506#true} is VALID [2022-04-08 10:03:20,684 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 10:03:20,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822729205] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:20,684 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:20,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-04-08 10:03:20,685 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:20,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1303617223] [2022-04-08 10:03:20,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1303617223] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:20,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:20,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:03:20,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972348210] [2022-04-08 10:03:20,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:20,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 20 [2022-04-08 10:03:20,685 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:20,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-08 10:03:20,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:20,699 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 10:03:20,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:20,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 10:03:20,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 10:03:20,700 INFO L87 Difference]: Start difference. First operand 53 states and 69 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-08 10:03:20,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:20,891 INFO L93 Difference]: Finished difference Result 62 states and 80 transitions. [2022-04-08 10:03:20,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 10:03:20,891 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 20 [2022-04-08 10:03:20,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:20,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-08 10:03:20,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-08 10:03:20,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-08 10:03:20,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-04-08 10:03:20,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-04-08 10:03:20,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:20,932 INFO L225 Difference]: With dead ends: 62 [2022-04-08 10:03:20,932 INFO L226 Difference]: Without dead ends: 49 [2022-04-08 10:03:20,932 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-08 10:03:20,933 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 22 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:20,933 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 31 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:03:20,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-08 10:03:21,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-04-08 10:03:21,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:21,028 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 44 states have internal predecessors, (61), 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-08 10:03:21,028 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 44 states have internal predecessors, (61), 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-08 10:03:21,029 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 44 states have internal predecessors, (61), 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-08 10:03:21,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:21,029 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2022-04-08 10:03:21,029 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2022-04-08 10:03:21,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:21,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:21,030 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 44 states have internal predecessors, (61), 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 49 states. [2022-04-08 10:03:21,030 INFO L87 Difference]: Start difference. First operand has 49 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 44 states have internal predecessors, (61), 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 49 states. [2022-04-08 10:03:21,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:21,031 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2022-04-08 10:03:21,031 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2022-04-08 10:03:21,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:21,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:21,031 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:21,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:21,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 44 states have internal predecessors, (61), 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-08 10:03:21,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2022-04-08 10:03:21,032 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 65 transitions. Word has length 20 [2022-04-08 10:03:21,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:21,032 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 65 transitions. [2022-04-08 10:03:21,032 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-08 10:03:21,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 65 transitions. [2022-04-08 10:03:21,110 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:21,110 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2022-04-08 10:03:21,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 10:03:21,111 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:21,111 INFO L499 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:21,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-08 10:03:21,311 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-08 10:03:21,311 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:21,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:21,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1285705505, now seen corresponding path program 9 times [2022-04-08 10:03:21,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:21,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [113491480] [2022-04-08 10:03:21,315 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:21,315 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:21,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1285705505, now seen corresponding path program 10 times [2022-04-08 10:03:21,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:21,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926534383] [2022-04-08 10:03:21,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:21,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:21,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:21,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {3969#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3957#true} is VALID [2022-04-08 10:03:21,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {3957#true} assume true; {3957#true} is VALID [2022-04-08 10:03:21,395 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3957#true} {3957#true} #72#return; {3957#true} is VALID [2022-04-08 10:03:21,396 INFO L272 TraceCheckUtils]: 0: Hoare triple {3957#true} call ULTIMATE.init(); {3969#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:21,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {3969#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3957#true} is VALID [2022-04-08 10:03:21,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {3957#true} assume true; {3957#true} is VALID [2022-04-08 10:03:21,396 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3957#true} {3957#true} #72#return; {3957#true} is VALID [2022-04-08 10:03:21,396 INFO L272 TraceCheckUtils]: 4: Hoare triple {3957#true} call #t~ret13 := main(); {3957#true} is VALID [2022-04-08 10:03:21,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {3957#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3962#(= main_~y~0 0)} is VALID [2022-04-08 10:03:21,397 INFO L290 TraceCheckUtils]: 6: Hoare triple {3962#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3963#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:21,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {3963#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3964#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:21,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {3964#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3965#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:21,398 INFO L290 TraceCheckUtils]: 9: Hoare triple {3965#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3966#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:21,399 INFO L290 TraceCheckUtils]: 10: Hoare triple {3966#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3967#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:21,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {3967#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {3967#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:21,399 INFO L290 TraceCheckUtils]: 12: Hoare triple {3967#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {3968#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:03:21,400 INFO L290 TraceCheckUtils]: 13: Hoare triple {3968#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {3958#false} is VALID [2022-04-08 10:03:21,400 INFO L290 TraceCheckUtils]: 14: Hoare triple {3958#false} assume !(~y~0 % 4294967296 > 0); {3958#false} is VALID [2022-04-08 10:03:21,400 INFO L290 TraceCheckUtils]: 15: Hoare triple {3958#false} assume !(~x~0 % 4294967296 > 0); {3958#false} is VALID [2022-04-08 10:03:21,400 INFO L272 TraceCheckUtils]: 16: Hoare triple {3958#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3958#false} is VALID [2022-04-08 10:03:21,400 INFO L290 TraceCheckUtils]: 17: Hoare triple {3958#false} ~cond := #in~cond; {3958#false} is VALID [2022-04-08 10:03:21,400 INFO L290 TraceCheckUtils]: 18: Hoare triple {3958#false} assume 0 == ~cond; {3958#false} is VALID [2022-04-08 10:03:21,400 INFO L290 TraceCheckUtils]: 19: Hoare triple {3958#false} assume !false; {3958#false} is VALID [2022-04-08 10:03:21,400 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:21,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:21,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926534383] [2022-04-08 10:03:21,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926534383] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:21,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113944294] [2022-04-08 10:03:21,401 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:03:21,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:21,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:21,401 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:03:21,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-08 10:03:21,428 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:03:21,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:21,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 10:03:21,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:21,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:21,596 INFO L272 TraceCheckUtils]: 0: Hoare triple {3957#true} call ULTIMATE.init(); {3957#true} is VALID [2022-04-08 10:03:21,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {3957#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3957#true} is VALID [2022-04-08 10:03:21,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {3957#true} assume true; {3957#true} is VALID [2022-04-08 10:03:21,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3957#true} {3957#true} #72#return; {3957#true} is VALID [2022-04-08 10:03:21,596 INFO L272 TraceCheckUtils]: 4: Hoare triple {3957#true} call #t~ret13 := main(); {3957#true} is VALID [2022-04-08 10:03:21,596 INFO L290 TraceCheckUtils]: 5: Hoare triple {3957#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3962#(= main_~y~0 0)} is VALID [2022-04-08 10:03:21,597 INFO L290 TraceCheckUtils]: 6: Hoare triple {3962#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3963#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:21,597 INFO L290 TraceCheckUtils]: 7: Hoare triple {3963#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3964#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:21,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {3964#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3965#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:21,598 INFO L290 TraceCheckUtils]: 9: Hoare triple {3965#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3966#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:21,599 INFO L290 TraceCheckUtils]: 10: Hoare triple {3966#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {3967#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:21,599 INFO L290 TraceCheckUtils]: 11: Hoare triple {3967#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {3967#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:21,599 INFO L290 TraceCheckUtils]: 12: Hoare triple {3967#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {4009#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:03:21,600 INFO L290 TraceCheckUtils]: 13: Hoare triple {4009#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {3958#false} is VALID [2022-04-08 10:03:21,600 INFO L290 TraceCheckUtils]: 14: Hoare triple {3958#false} assume !(~y~0 % 4294967296 > 0); {3958#false} is VALID [2022-04-08 10:03:21,600 INFO L290 TraceCheckUtils]: 15: Hoare triple {3958#false} assume !(~x~0 % 4294967296 > 0); {3958#false} is VALID [2022-04-08 10:03:21,600 INFO L272 TraceCheckUtils]: 16: Hoare triple {3958#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3958#false} is VALID [2022-04-08 10:03:21,600 INFO L290 TraceCheckUtils]: 17: Hoare triple {3958#false} ~cond := #in~cond; {3958#false} is VALID [2022-04-08 10:03:21,600 INFO L290 TraceCheckUtils]: 18: Hoare triple {3958#false} assume 0 == ~cond; {3958#false} is VALID [2022-04-08 10:03:21,600 INFO L290 TraceCheckUtils]: 19: Hoare triple {3958#false} assume !false; {3958#false} is VALID [2022-04-08 10:03:21,600 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:21,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:21,735 INFO L290 TraceCheckUtils]: 19: Hoare triple {3958#false} assume !false; {3958#false} is VALID [2022-04-08 10:03:21,735 INFO L290 TraceCheckUtils]: 18: Hoare triple {3958#false} assume 0 == ~cond; {3958#false} is VALID [2022-04-08 10:03:21,735 INFO L290 TraceCheckUtils]: 17: Hoare triple {3958#false} ~cond := #in~cond; {3958#false} is VALID [2022-04-08 10:03:21,735 INFO L272 TraceCheckUtils]: 16: Hoare triple {3958#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3958#false} is VALID [2022-04-08 10:03:21,735 INFO L290 TraceCheckUtils]: 15: Hoare triple {3958#false} assume !(~x~0 % 4294967296 > 0); {3958#false} is VALID [2022-04-08 10:03:21,735 INFO L290 TraceCheckUtils]: 14: Hoare triple {3958#false} assume !(~y~0 % 4294967296 > 0); {3958#false} is VALID [2022-04-08 10:03:21,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {4049#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {3958#false} is VALID [2022-04-08 10:03:21,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {4053#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {4049#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:03:21,736 INFO L290 TraceCheckUtils]: 11: Hoare triple {4053#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {4053#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:21,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {4060#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4053#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:21,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {4064#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4060#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:03:21,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {4068#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4064#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:03:21,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {4072#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4068#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:03:21,739 INFO L290 TraceCheckUtils]: 6: Hoare triple {4076#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4072#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:03:21,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {3957#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4076#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:21,739 INFO L272 TraceCheckUtils]: 4: Hoare triple {3957#true} call #t~ret13 := main(); {3957#true} is VALID [2022-04-08 10:03:21,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3957#true} {3957#true} #72#return; {3957#true} is VALID [2022-04-08 10:03:21,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {3957#true} assume true; {3957#true} is VALID [2022-04-08 10:03:21,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {3957#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3957#true} is VALID [2022-04-08 10:03:21,740 INFO L272 TraceCheckUtils]: 0: Hoare triple {3957#true} call ULTIMATE.init(); {3957#true} is VALID [2022-04-08 10:03:21,740 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:21,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113944294] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:21,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:21,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-08 10:03:21,740 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:21,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [113491480] [2022-04-08 10:03:21,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [113491480] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:21,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:21,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 10:03:21,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118433801] [2022-04-08 10:03:21,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:21,741 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 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 20 [2022-04-08 10:03:21,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:21,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 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-08 10:03:21,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:21,753 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 10:03:21,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:21,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 10:03:21,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-04-08 10:03:21,754 INFO L87 Difference]: Start difference. First operand 49 states and 65 transitions. Second operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 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-08 10:03:22,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:22,536 INFO L93 Difference]: Finished difference Result 91 states and 132 transitions. [2022-04-08 10:03:22,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 10:03:22,537 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 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 20 [2022-04-08 10:03:22,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:22,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 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-08 10:03:22,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2022-04-08 10:03:22,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 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-08 10:03:22,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2022-04-08 10:03:22,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 81 transitions. [2022-04-08 10:03:22,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:22,602 INFO L225 Difference]: With dead ends: 91 [2022-04-08 10:03:22,602 INFO L226 Difference]: Without dead ends: 80 [2022-04-08 10:03:22,602 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=457, Unknown=0, NotChecked=0, Total=600 [2022-04-08 10:03:22,602 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 54 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:22,603 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 69 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:03:22,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-08 10:03:22,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 56. [2022-04-08 10:03:22,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:22,713 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 56 states, 51 states have (on average 1.392156862745098) internal successors, (71), 51 states have internal predecessors, (71), 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-08 10:03:22,713 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 56 states, 51 states have (on average 1.392156862745098) internal successors, (71), 51 states have internal predecessors, (71), 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-08 10:03:22,713 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 56 states, 51 states have (on average 1.392156862745098) internal successors, (71), 51 states have internal predecessors, (71), 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-08 10:03:22,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:22,714 INFO L93 Difference]: Finished difference Result 80 states and 105 transitions. [2022-04-08 10:03:22,714 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 105 transitions. [2022-04-08 10:03:22,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:22,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:22,715 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 51 states have (on average 1.392156862745098) internal successors, (71), 51 states have internal predecessors, (71), 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 80 states. [2022-04-08 10:03:22,715 INFO L87 Difference]: Start difference. First operand has 56 states, 51 states have (on average 1.392156862745098) internal successors, (71), 51 states have internal predecessors, (71), 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 80 states. [2022-04-08 10:03:22,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:22,716 INFO L93 Difference]: Finished difference Result 80 states and 105 transitions. [2022-04-08 10:03:22,716 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 105 transitions. [2022-04-08 10:03:22,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:22,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:22,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:22,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:22,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.392156862745098) internal successors, (71), 51 states have internal predecessors, (71), 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-08 10:03:22,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 75 transitions. [2022-04-08 10:03:22,717 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 75 transitions. Word has length 20 [2022-04-08 10:03:22,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:22,717 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 75 transitions. [2022-04-08 10:03:22,717 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 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-08 10:03:22,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 75 transitions. [2022-04-08 10:03:22,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:22,809 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 75 transitions. [2022-04-08 10:03:22,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 10:03:22,809 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:22,809 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:22,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-08 10:03:23,019 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:23,019 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:23,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:23,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1586904504, now seen corresponding path program 5 times [2022-04-08 10:03:23,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:23,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [337597613] [2022-04-08 10:03:23,022 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:23,022 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:23,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1586904504, now seen corresponding path program 6 times [2022-04-08 10:03:23,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:23,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984072782] [2022-04-08 10:03:23,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:23,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:23,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:23,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:23,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:23,102 INFO L290 TraceCheckUtils]: 0: Hoare triple {4575#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4565#true} is VALID [2022-04-08 10:03:23,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {4565#true} assume true; {4565#true} is VALID [2022-04-08 10:03:23,103 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4565#true} {4565#true} #72#return; {4565#true} is VALID [2022-04-08 10:03:23,103 INFO L272 TraceCheckUtils]: 0: Hoare triple {4565#true} call ULTIMATE.init(); {4575#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:23,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {4575#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4565#true} is VALID [2022-04-08 10:03:23,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {4565#true} assume true; {4565#true} is VALID [2022-04-08 10:03:23,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4565#true} {4565#true} #72#return; {4565#true} is VALID [2022-04-08 10:03:23,103 INFO L272 TraceCheckUtils]: 4: Hoare triple {4565#true} call #t~ret13 := main(); {4565#true} is VALID [2022-04-08 10:03:23,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {4565#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4570#(= main_~y~0 0)} is VALID [2022-04-08 10:03:23,104 INFO L290 TraceCheckUtils]: 6: Hoare triple {4570#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4571#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:23,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {4571#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4572#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:23,105 INFO L290 TraceCheckUtils]: 8: Hoare triple {4572#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {4572#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:23,105 INFO L290 TraceCheckUtils]: 9: Hoare triple {4572#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {4573#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:03:23,106 INFO L290 TraceCheckUtils]: 10: Hoare triple {4573#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4574#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:03:23,106 INFO L290 TraceCheckUtils]: 11: Hoare triple {4574#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {4566#false} is VALID [2022-04-08 10:03:23,106 INFO L290 TraceCheckUtils]: 12: Hoare triple {4566#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4566#false} is VALID [2022-04-08 10:03:23,106 INFO L290 TraceCheckUtils]: 13: Hoare triple {4566#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4566#false} is VALID [2022-04-08 10:03:23,107 INFO L290 TraceCheckUtils]: 14: Hoare triple {4566#false} assume !(~y~0 % 4294967296 > 0); {4566#false} is VALID [2022-04-08 10:03:23,107 INFO L290 TraceCheckUtils]: 15: Hoare triple {4566#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4566#false} is VALID [2022-04-08 10:03:23,107 INFO L290 TraceCheckUtils]: 16: Hoare triple {4566#false} assume !(~x~0 % 4294967296 > 0); {4566#false} is VALID [2022-04-08 10:03:23,107 INFO L272 TraceCheckUtils]: 17: Hoare triple {4566#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4566#false} is VALID [2022-04-08 10:03:23,107 INFO L290 TraceCheckUtils]: 18: Hoare triple {4566#false} ~cond := #in~cond; {4566#false} is VALID [2022-04-08 10:03:23,107 INFO L290 TraceCheckUtils]: 19: Hoare triple {4566#false} assume 0 == ~cond; {4566#false} is VALID [2022-04-08 10:03:23,107 INFO L290 TraceCheckUtils]: 20: Hoare triple {4566#false} assume !false; {4566#false} is VALID [2022-04-08 10:03:23,107 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 10:03:23,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:23,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984072782] [2022-04-08 10:03:23,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984072782] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:23,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684172845] [2022-04-08 10:03:23,108 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:03:23,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:23,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:23,119 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:03:23,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-08 10:03:23,168 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-04-08 10:03:23,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:23,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-08 10:03:23,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:23,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:23,248 INFO L272 TraceCheckUtils]: 0: Hoare triple {4565#true} call ULTIMATE.init(); {4565#true} is VALID [2022-04-08 10:03:23,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {4565#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4565#true} is VALID [2022-04-08 10:03:23,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {4565#true} assume true; {4565#true} is VALID [2022-04-08 10:03:23,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4565#true} {4565#true} #72#return; {4565#true} is VALID [2022-04-08 10:03:23,249 INFO L272 TraceCheckUtils]: 4: Hoare triple {4565#true} call #t~ret13 := main(); {4565#true} is VALID [2022-04-08 10:03:23,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {4565#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4570#(= main_~y~0 0)} is VALID [2022-04-08 10:03:23,249 INFO L290 TraceCheckUtils]: 6: Hoare triple {4570#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4571#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:23,250 INFO L290 TraceCheckUtils]: 7: Hoare triple {4571#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4572#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:23,250 INFO L290 TraceCheckUtils]: 8: Hoare triple {4572#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {4572#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:23,250 INFO L290 TraceCheckUtils]: 9: Hoare triple {4572#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {4606#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:23,251 INFO L290 TraceCheckUtils]: 10: Hoare triple {4606#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4610#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:03:23,251 INFO L290 TraceCheckUtils]: 11: Hoare triple {4610#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {4566#false} is VALID [2022-04-08 10:03:23,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {4566#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4566#false} is VALID [2022-04-08 10:03:23,251 INFO L290 TraceCheckUtils]: 13: Hoare triple {4566#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4566#false} is VALID [2022-04-08 10:03:23,251 INFO L290 TraceCheckUtils]: 14: Hoare triple {4566#false} assume !(~y~0 % 4294967296 > 0); {4566#false} is VALID [2022-04-08 10:03:23,251 INFO L290 TraceCheckUtils]: 15: Hoare triple {4566#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4566#false} is VALID [2022-04-08 10:03:23,251 INFO L290 TraceCheckUtils]: 16: Hoare triple {4566#false} assume !(~x~0 % 4294967296 > 0); {4566#false} is VALID [2022-04-08 10:03:23,251 INFO L272 TraceCheckUtils]: 17: Hoare triple {4566#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4566#false} is VALID [2022-04-08 10:03:23,251 INFO L290 TraceCheckUtils]: 18: Hoare triple {4566#false} ~cond := #in~cond; {4566#false} is VALID [2022-04-08 10:03:23,251 INFO L290 TraceCheckUtils]: 19: Hoare triple {4566#false} assume 0 == ~cond; {4566#false} is VALID [2022-04-08 10:03:23,252 INFO L290 TraceCheckUtils]: 20: Hoare triple {4566#false} assume !false; {4566#false} is VALID [2022-04-08 10:03:23,252 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 10:03:23,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:23,338 INFO L290 TraceCheckUtils]: 20: Hoare triple {4566#false} assume !false; {4566#false} is VALID [2022-04-08 10:03:23,338 INFO L290 TraceCheckUtils]: 19: Hoare triple {4566#false} assume 0 == ~cond; {4566#false} is VALID [2022-04-08 10:03:23,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {4566#false} ~cond := #in~cond; {4566#false} is VALID [2022-04-08 10:03:23,338 INFO L272 TraceCheckUtils]: 17: Hoare triple {4566#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4566#false} is VALID [2022-04-08 10:03:23,338 INFO L290 TraceCheckUtils]: 16: Hoare triple {4566#false} assume !(~x~0 % 4294967296 > 0); {4566#false} is VALID [2022-04-08 10:03:23,338 INFO L290 TraceCheckUtils]: 15: Hoare triple {4566#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4566#false} is VALID [2022-04-08 10:03:23,338 INFO L290 TraceCheckUtils]: 14: Hoare triple {4566#false} assume !(~y~0 % 4294967296 > 0); {4566#false} is VALID [2022-04-08 10:03:23,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {4662#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4566#false} is VALID [2022-04-08 10:03:23,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {4666#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4662#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:03:23,340 INFO L290 TraceCheckUtils]: 11: Hoare triple {4670#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {4666#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:03:23,340 INFO L290 TraceCheckUtils]: 10: Hoare triple {4674#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4670#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:03:23,341 INFO L290 TraceCheckUtils]: 9: Hoare triple {4565#true} ~z~0 := ~y~0; {4674#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:03:23,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {4565#true} assume !(~x~0 % 4294967296 > 0); {4565#true} is VALID [2022-04-08 10:03:23,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {4565#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4565#true} is VALID [2022-04-08 10:03:23,341 INFO L290 TraceCheckUtils]: 6: Hoare triple {4565#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {4565#true} is VALID [2022-04-08 10:03:23,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {4565#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4565#true} is VALID [2022-04-08 10:03:23,341 INFO L272 TraceCheckUtils]: 4: Hoare triple {4565#true} call #t~ret13 := main(); {4565#true} is VALID [2022-04-08 10:03:23,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4565#true} {4565#true} #72#return; {4565#true} is VALID [2022-04-08 10:03:23,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {4565#true} assume true; {4565#true} is VALID [2022-04-08 10:03:23,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {4565#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4565#true} is VALID [2022-04-08 10:03:23,341 INFO L272 TraceCheckUtils]: 0: Hoare triple {4565#true} call ULTIMATE.init(); {4565#true} is VALID [2022-04-08 10:03:23,341 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 10:03:23,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684172845] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:23,342 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:23,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 14 [2022-04-08 10:03:23,342 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:23,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [337597613] [2022-04-08 10:03:23,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [337597613] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:23,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:23,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 10:03:23,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066274730] [2022-04-08 10:03:23,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:23,343 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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 21 [2022-04-08 10:03:23,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:23,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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-08 10:03:23,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:23,357 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 10:03:23,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:23,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 10:03:23,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-08 10:03:23,357 INFO L87 Difference]: Start difference. First operand 56 states and 75 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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-08 10:03:23,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:23,734 INFO L93 Difference]: Finished difference Result 75 states and 96 transitions. [2022-04-08 10:03:23,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 10:03:23,734 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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 21 [2022-04-08 10:03:23,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:23,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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-08 10:03:23,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-08 10:03:23,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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-08 10:03:23,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-08 10:03:23,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 49 transitions. [2022-04-08 10:03:23,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:23,771 INFO L225 Difference]: With dead ends: 75 [2022-04-08 10:03:23,771 INFO L226 Difference]: Without dead ends: 65 [2022-04-08 10:03:23,772 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-04-08 10:03:23,772 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 25 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:23,772 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 44 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:03:23,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-08 10:03:23,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2022-04-08 10:03:23,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:23,860 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 56 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 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-08 10:03:23,860 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 56 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 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-08 10:03:23,860 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 56 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 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-08 10:03:23,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:23,861 INFO L93 Difference]: Finished difference Result 65 states and 86 transitions. [2022-04-08 10:03:23,861 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 86 transitions. [2022-04-08 10:03:23,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:23,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:23,861 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 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 65 states. [2022-04-08 10:03:23,861 INFO L87 Difference]: Start difference. First operand has 56 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 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 65 states. [2022-04-08 10:03:23,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:23,862 INFO L93 Difference]: Finished difference Result 65 states and 86 transitions. [2022-04-08 10:03:23,879 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 86 transitions. [2022-04-08 10:03:23,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:23,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:23,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:23,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:23,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 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-08 10:03:23,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 74 transitions. [2022-04-08 10:03:23,880 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 74 transitions. Word has length 21 [2022-04-08 10:03:23,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:23,880 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 74 transitions. [2022-04-08 10:03:23,881 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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-08 10:03:23,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 74 transitions. [2022-04-08 10:03:23,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:23,962 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2022-04-08 10:03:23,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 10:03:23,963 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:23,963 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:23,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-08 10:03:24,163 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-08 10:03:24,164 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:24,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:24,164 INFO L85 PathProgramCache]: Analyzing trace with hash 323810136, now seen corresponding path program 5 times [2022-04-08 10:03:24,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:24,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1566035392] [2022-04-08 10:03:24,166 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:24,166 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:24,166 INFO L85 PathProgramCache]: Analyzing trace with hash 323810136, now seen corresponding path program 6 times [2022-04-08 10:03:24,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:24,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228522384] [2022-04-08 10:03:24,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:24,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:24,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:24,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:24,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:24,234 INFO L290 TraceCheckUtils]: 0: Hoare triple {5118#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5109#true} is VALID [2022-04-08 10:03:24,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {5109#true} assume true; {5109#true} is VALID [2022-04-08 10:03:24,234 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5109#true} {5109#true} #72#return; {5109#true} is VALID [2022-04-08 10:03:24,234 INFO L272 TraceCheckUtils]: 0: Hoare triple {5109#true} call ULTIMATE.init(); {5118#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:24,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {5118#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5109#true} is VALID [2022-04-08 10:03:24,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {5109#true} assume true; {5109#true} is VALID [2022-04-08 10:03:24,235 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5109#true} {5109#true} #72#return; {5109#true} is VALID [2022-04-08 10:03:24,235 INFO L272 TraceCheckUtils]: 4: Hoare triple {5109#true} call #t~ret13 := main(); {5109#true} is VALID [2022-04-08 10:03:24,235 INFO L290 TraceCheckUtils]: 5: Hoare triple {5109#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5109#true} is VALID [2022-04-08 10:03:24,236 INFO L290 TraceCheckUtils]: 6: Hoare triple {5109#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5114#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:03:24,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {5114#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5115#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:03:24,237 INFO L290 TraceCheckUtils]: 8: Hoare triple {5115#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {5115#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:03:24,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {5115#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {5115#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:03:24,238 INFO L290 TraceCheckUtils]: 10: Hoare triple {5115#(<= (* (div (+ main_~x~0 2) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5116#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-08 10:03:24,239 INFO L290 TraceCheckUtils]: 11: Hoare triple {5116#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5117#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:03:24,239 INFO L290 TraceCheckUtils]: 12: Hoare triple {5117#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {5117#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:03:24,240 INFO L290 TraceCheckUtils]: 13: Hoare triple {5117#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5117#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:03:24,240 INFO L290 TraceCheckUtils]: 14: Hoare triple {5117#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5117#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:03:24,240 INFO L290 TraceCheckUtils]: 15: Hoare triple {5117#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {5117#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:03:24,241 INFO L290 TraceCheckUtils]: 16: Hoare triple {5117#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {5110#false} is VALID [2022-04-08 10:03:24,241 INFO L272 TraceCheckUtils]: 17: Hoare triple {5110#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5110#false} is VALID [2022-04-08 10:03:24,241 INFO L290 TraceCheckUtils]: 18: Hoare triple {5110#false} ~cond := #in~cond; {5110#false} is VALID [2022-04-08 10:03:24,241 INFO L290 TraceCheckUtils]: 19: Hoare triple {5110#false} assume 0 == ~cond; {5110#false} is VALID [2022-04-08 10:03:24,241 INFO L290 TraceCheckUtils]: 20: Hoare triple {5110#false} assume !false; {5110#false} is VALID [2022-04-08 10:03:24,241 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:03:24,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:24,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228522384] [2022-04-08 10:03:24,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228522384] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:24,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371779955] [2022-04-08 10:03:24,242 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:03:24,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:24,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:24,243 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:03:24,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-08 10:03:24,281 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-04-08 10:03:24,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:24,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 10:03:24,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:24,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:24,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {5109#true} call ULTIMATE.init(); {5109#true} is VALID [2022-04-08 10:03:24,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {5109#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5109#true} is VALID [2022-04-08 10:03:24,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {5109#true} assume true; {5109#true} is VALID [2022-04-08 10:03:24,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5109#true} {5109#true} #72#return; {5109#true} is VALID [2022-04-08 10:03:24,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {5109#true} call #t~ret13 := main(); {5109#true} is VALID [2022-04-08 10:03:24,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {5109#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5137#(= main_~n~0 main_~x~0)} is VALID [2022-04-08 10:03:24,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {5137#(= main_~n~0 main_~x~0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5141#(= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-08 10:03:24,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {5141#(= (+ main_~x~0 1) main_~n~0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5145#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} is VALID [2022-04-08 10:03:24,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {5145#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} assume !(~x~0 % 4294967296 > 0); {5145#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} is VALID [2022-04-08 10:03:24,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {5145#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} ~z~0 := ~y~0; {5145#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} is VALID [2022-04-08 10:03:24,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {5145#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5141#(= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-08 10:03:24,762 INFO L290 TraceCheckUtils]: 11: Hoare triple {5141#(= (+ main_~x~0 1) main_~n~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5137#(= main_~n~0 main_~x~0)} is VALID [2022-04-08 10:03:24,762 INFO L290 TraceCheckUtils]: 12: Hoare triple {5137#(= main_~n~0 main_~x~0)} assume !(~z~0 % 4294967296 > 0); {5137#(= main_~n~0 main_~x~0)} is VALID [2022-04-08 10:03:24,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {5137#(= main_~n~0 main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5137#(= main_~n~0 main_~x~0)} is VALID [2022-04-08 10:03:24,762 INFO L290 TraceCheckUtils]: 14: Hoare triple {5137#(= main_~n~0 main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5137#(= main_~n~0 main_~x~0)} is VALID [2022-04-08 10:03:24,763 INFO L290 TraceCheckUtils]: 15: Hoare triple {5137#(= main_~n~0 main_~x~0)} assume !(~y~0 % 4294967296 > 0); {5170#(and (= main_~n~0 main_~x~0) (not (< 0 (mod main_~y~0 4294967296))))} is VALID [2022-04-08 10:03:24,763 INFO L290 TraceCheckUtils]: 16: Hoare triple {5170#(and (= main_~n~0 main_~x~0) (not (< 0 (mod main_~y~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {5174#(and (not (< 0 (mod main_~y~0 4294967296))) (not (< 0 (mod main_~n~0 4294967296))))} is VALID [2022-04-08 10:03:24,764 INFO L272 TraceCheckUtils]: 17: Hoare triple {5174#(and (not (< 0 (mod main_~y~0 4294967296))) (not (< 0 (mod main_~n~0 4294967296))))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5178#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:03:24,764 INFO L290 TraceCheckUtils]: 18: Hoare triple {5178#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5182#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:03:24,764 INFO L290 TraceCheckUtils]: 19: Hoare triple {5182#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5110#false} is VALID [2022-04-08 10:03:24,764 INFO L290 TraceCheckUtils]: 20: Hoare triple {5110#false} assume !false; {5110#false} is VALID [2022-04-08 10:03:24,765 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:03:24,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:25,154 INFO L290 TraceCheckUtils]: 20: Hoare triple {5110#false} assume !false; {5110#false} is VALID [2022-04-08 10:03:25,155 INFO L290 TraceCheckUtils]: 19: Hoare triple {5182#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5110#false} is VALID [2022-04-08 10:03:25,155 INFO L290 TraceCheckUtils]: 18: Hoare triple {5178#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5182#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:03:25,155 INFO L272 TraceCheckUtils]: 17: Hoare triple {5198#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5178#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:03:25,156 INFO L290 TraceCheckUtils]: 16: Hoare triple {5202#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {5198#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:25,156 INFO L290 TraceCheckUtils]: 15: Hoare triple {5206#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {5202#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:03:25,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {5206#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5206#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:25,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {5206#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5206#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:25,157 INFO L290 TraceCheckUtils]: 12: Hoare triple {5206#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {5206#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:25,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {5219#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5206#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:25,159 INFO L290 TraceCheckUtils]: 10: Hoare triple {5223#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod (+ main_~x~0 2) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5219#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-08 10:03:25,159 INFO L290 TraceCheckUtils]: 9: Hoare triple {5223#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod (+ main_~x~0 2) 4294967296)))} ~z~0 := ~y~0; {5223#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod (+ main_~x~0 2) 4294967296)))} is VALID [2022-04-08 10:03:25,159 INFO L290 TraceCheckUtils]: 8: Hoare triple {5223#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod (+ main_~x~0 2) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {5223#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod (+ main_~x~0 2) 4294967296)))} is VALID [2022-04-08 10:03:25,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {5219#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5223#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod (+ main_~x~0 2) 4294967296)))} is VALID [2022-04-08 10:03:25,161 INFO L290 TraceCheckUtils]: 6: Hoare triple {5206#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5219#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-08 10:03:25,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {5109#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5206#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:25,161 INFO L272 TraceCheckUtils]: 4: Hoare triple {5109#true} call #t~ret13 := main(); {5109#true} is VALID [2022-04-08 10:03:25,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5109#true} {5109#true} #72#return; {5109#true} is VALID [2022-04-08 10:03:25,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {5109#true} assume true; {5109#true} is VALID [2022-04-08 10:03:25,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {5109#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5109#true} is VALID [2022-04-08 10:03:25,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {5109#true} call ULTIMATE.init(); {5109#true} is VALID [2022-04-08 10:03:25,161 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:03:25,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371779955] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:25,162 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:25,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 19 [2022-04-08 10:03:25,162 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:25,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1566035392] [2022-04-08 10:03:25,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1566035392] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:25,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:25,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 10:03:25,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956448947] [2022-04-08 10:03:25,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:25,163 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 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 21 [2022-04-08 10:03:25,163 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:25,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 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-08 10:03:25,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:25,181 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 10:03:25,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:25,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 10:03:25,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2022-04-08 10:03:25,181 INFO L87 Difference]: Start difference. First operand 56 states and 74 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 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-08 10:03:25,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:25,516 INFO L93 Difference]: Finished difference Result 77 states and 104 transitions. [2022-04-08 10:03:25,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 10:03:25,516 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 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 21 [2022-04-08 10:03:25,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:25,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 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-08 10:03:25,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2022-04-08 10:03:25,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 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-08 10:03:25,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2022-04-08 10:03:25,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 45 transitions. [2022-04-08 10:03:25,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:25,547 INFO L225 Difference]: With dead ends: 77 [2022-04-08 10:03:25,547 INFO L226 Difference]: Without dead ends: 72 [2022-04-08 10:03:25,547 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-04-08 10:03:25,547 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 36 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:25,548 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 33 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:03:25,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-08 10:03:25,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2022-04-08 10:03:25,662 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:25,662 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 70 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 65 states have internal predecessors, (90), 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-08 10:03:25,662 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 70 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 65 states have internal predecessors, (90), 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-08 10:03:25,662 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 70 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 65 states have internal predecessors, (90), 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-08 10:03:25,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:25,663 INFO L93 Difference]: Finished difference Result 72 states and 98 transitions. [2022-04-08 10:03:25,663 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 98 transitions. [2022-04-08 10:03:25,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:25,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:25,663 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 65 states have internal predecessors, (90), 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 72 states. [2022-04-08 10:03:25,664 INFO L87 Difference]: Start difference. First operand has 70 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 65 states have internal predecessors, (90), 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 72 states. [2022-04-08 10:03:25,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:25,664 INFO L93 Difference]: Finished difference Result 72 states and 98 transitions. [2022-04-08 10:03:25,664 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 98 transitions. [2022-04-08 10:03:25,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:25,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:25,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:25,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:25,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 65 states have internal predecessors, (90), 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-08 10:03:25,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 94 transitions. [2022-04-08 10:03:25,666 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 94 transitions. Word has length 21 [2022-04-08 10:03:25,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:25,666 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 94 transitions. [2022-04-08 10:03:25,666 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 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-08 10:03:25,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 94 transitions. [2022-04-08 10:03:25,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:25,825 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 94 transitions. [2022-04-08 10:03:25,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 10:03:25,825 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:25,825 INFO L499 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:25,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-08 10:03:26,025 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-08 10:03:26,026 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:26,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:26,026 INFO L85 PathProgramCache]: Analyzing trace with hash -2056097352, now seen corresponding path program 11 times [2022-04-08 10:03:26,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:26,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [49338543] [2022-04-08 10:03:26,029 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:26,029 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:26,029 INFO L85 PathProgramCache]: Analyzing trace with hash -2056097352, now seen corresponding path program 12 times [2022-04-08 10:03:26,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:26,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683085833] [2022-04-08 10:03:26,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:26,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:26,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:26,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:26,158 INFO L290 TraceCheckUtils]: 0: Hoare triple {5715#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5702#true} is VALID [2022-04-08 10:03:26,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {5702#true} assume true; {5702#true} is VALID [2022-04-08 10:03:26,158 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5702#true} {5702#true} #72#return; {5702#true} is VALID [2022-04-08 10:03:26,158 INFO L272 TraceCheckUtils]: 0: Hoare triple {5702#true} call ULTIMATE.init(); {5715#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:26,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {5715#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5702#true} is VALID [2022-04-08 10:03:26,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {5702#true} assume true; {5702#true} is VALID [2022-04-08 10:03:26,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5702#true} {5702#true} #72#return; {5702#true} is VALID [2022-04-08 10:03:26,158 INFO L272 TraceCheckUtils]: 4: Hoare triple {5702#true} call #t~ret13 := main(); {5702#true} is VALID [2022-04-08 10:03:26,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {5702#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5707#(= main_~y~0 0)} is VALID [2022-04-08 10:03:26,159 INFO L290 TraceCheckUtils]: 6: Hoare triple {5707#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5708#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:26,159 INFO L290 TraceCheckUtils]: 7: Hoare triple {5708#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5709#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:26,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {5709#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5710#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:26,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {5710#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5711#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:26,161 INFO L290 TraceCheckUtils]: 10: Hoare triple {5711#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5712#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:26,161 INFO L290 TraceCheckUtils]: 11: Hoare triple {5712#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5713#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:26,162 INFO L290 TraceCheckUtils]: 12: Hoare triple {5713#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {5713#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:26,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {5713#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {5714#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-08 10:03:26,163 INFO L290 TraceCheckUtils]: 14: Hoare triple {5714#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {5703#false} is VALID [2022-04-08 10:03:26,163 INFO L290 TraceCheckUtils]: 15: Hoare triple {5703#false} assume !(~y~0 % 4294967296 > 0); {5703#false} is VALID [2022-04-08 10:03:26,163 INFO L290 TraceCheckUtils]: 16: Hoare triple {5703#false} assume !(~x~0 % 4294967296 > 0); {5703#false} is VALID [2022-04-08 10:03:26,163 INFO L272 TraceCheckUtils]: 17: Hoare triple {5703#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5703#false} is VALID [2022-04-08 10:03:26,163 INFO L290 TraceCheckUtils]: 18: Hoare triple {5703#false} ~cond := #in~cond; {5703#false} is VALID [2022-04-08 10:03:26,163 INFO L290 TraceCheckUtils]: 19: Hoare triple {5703#false} assume 0 == ~cond; {5703#false} is VALID [2022-04-08 10:03:26,163 INFO L290 TraceCheckUtils]: 20: Hoare triple {5703#false} assume !false; {5703#false} is VALID [2022-04-08 10:03:26,163 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:26,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:26,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683085833] [2022-04-08 10:03:26,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683085833] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:26,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944834093] [2022-04-08 10:03:26,163 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:03:26,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:26,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:26,164 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:03:26,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-08 10:03:26,198 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 10:03:26,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:26,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 10:03:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:26,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:26,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {5702#true} call ULTIMATE.init(); {5702#true} is VALID [2022-04-08 10:03:26,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {5702#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5702#true} is VALID [2022-04-08 10:03:26,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {5702#true} assume true; {5702#true} is VALID [2022-04-08 10:03:26,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5702#true} {5702#true} #72#return; {5702#true} is VALID [2022-04-08 10:03:26,397 INFO L272 TraceCheckUtils]: 4: Hoare triple {5702#true} call #t~ret13 := main(); {5702#true} is VALID [2022-04-08 10:03:26,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {5702#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5707#(= main_~y~0 0)} is VALID [2022-04-08 10:03:26,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {5707#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5708#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:26,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {5708#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5709#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:26,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {5709#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5710#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:26,400 INFO L290 TraceCheckUtils]: 9: Hoare triple {5710#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5711#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:26,400 INFO L290 TraceCheckUtils]: 10: Hoare triple {5711#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5712#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:26,401 INFO L290 TraceCheckUtils]: 11: Hoare triple {5712#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5713#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:26,401 INFO L290 TraceCheckUtils]: 12: Hoare triple {5713#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {5713#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:26,402 INFO L290 TraceCheckUtils]: 13: Hoare triple {5713#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {5758#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:03:26,402 INFO L290 TraceCheckUtils]: 14: Hoare triple {5758#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {5703#false} is VALID [2022-04-08 10:03:26,402 INFO L290 TraceCheckUtils]: 15: Hoare triple {5703#false} assume !(~y~0 % 4294967296 > 0); {5703#false} is VALID [2022-04-08 10:03:26,402 INFO L290 TraceCheckUtils]: 16: Hoare triple {5703#false} assume !(~x~0 % 4294967296 > 0); {5703#false} is VALID [2022-04-08 10:03:26,402 INFO L272 TraceCheckUtils]: 17: Hoare triple {5703#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5703#false} is VALID [2022-04-08 10:03:26,402 INFO L290 TraceCheckUtils]: 18: Hoare triple {5703#false} ~cond := #in~cond; {5703#false} is VALID [2022-04-08 10:03:26,402 INFO L290 TraceCheckUtils]: 19: Hoare triple {5703#false} assume 0 == ~cond; {5703#false} is VALID [2022-04-08 10:03:26,402 INFO L290 TraceCheckUtils]: 20: Hoare triple {5703#false} assume !false; {5703#false} is VALID [2022-04-08 10:03:26,403 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:26,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:26,551 INFO L290 TraceCheckUtils]: 20: Hoare triple {5703#false} assume !false; {5703#false} is VALID [2022-04-08 10:03:26,552 INFO L290 TraceCheckUtils]: 19: Hoare triple {5703#false} assume 0 == ~cond; {5703#false} is VALID [2022-04-08 10:03:26,552 INFO L290 TraceCheckUtils]: 18: Hoare triple {5703#false} ~cond := #in~cond; {5703#false} is VALID [2022-04-08 10:03:26,552 INFO L272 TraceCheckUtils]: 17: Hoare triple {5703#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5703#false} is VALID [2022-04-08 10:03:26,552 INFO L290 TraceCheckUtils]: 16: Hoare triple {5703#false} assume !(~x~0 % 4294967296 > 0); {5703#false} is VALID [2022-04-08 10:03:26,552 INFO L290 TraceCheckUtils]: 15: Hoare triple {5703#false} assume !(~y~0 % 4294967296 > 0); {5703#false} is VALID [2022-04-08 10:03:26,552 INFO L290 TraceCheckUtils]: 14: Hoare triple {5798#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {5703#false} is VALID [2022-04-08 10:03:26,553 INFO L290 TraceCheckUtils]: 13: Hoare triple {5802#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {5798#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:03:26,553 INFO L290 TraceCheckUtils]: 12: Hoare triple {5802#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {5802#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:26,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {5809#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5802#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:26,554 INFO L290 TraceCheckUtils]: 10: Hoare triple {5813#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5809#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:03:26,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {5817#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5813#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:03:26,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {5821#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5817#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:03:26,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {5825#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5821#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:03:26,556 INFO L290 TraceCheckUtils]: 6: Hoare triple {5829#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {5825#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:26,556 INFO L290 TraceCheckUtils]: 5: Hoare triple {5702#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5829#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:03:26,556 INFO L272 TraceCheckUtils]: 4: Hoare triple {5702#true} call #t~ret13 := main(); {5702#true} is VALID [2022-04-08 10:03:26,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5702#true} {5702#true} #72#return; {5702#true} is VALID [2022-04-08 10:03:26,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {5702#true} assume true; {5702#true} is VALID [2022-04-08 10:03:26,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {5702#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5702#true} is VALID [2022-04-08 10:03:26,556 INFO L272 TraceCheckUtils]: 0: Hoare triple {5702#true} call ULTIMATE.init(); {5702#true} is VALID [2022-04-08 10:03:26,556 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:26,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944834093] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:26,556 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:26,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-08 10:03:26,557 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:26,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [49338543] [2022-04-08 10:03:26,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [49338543] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:26,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:26,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 10:03:26,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735905876] [2022-04-08 10:03:26,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:26,558 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 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 21 [2022-04-08 10:03:26,558 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:26,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 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-08 10:03:26,566 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-08 10:03:26,566 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 10:03:26,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:26,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 10:03:26,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2022-04-08 10:03:26,567 INFO L87 Difference]: Start difference. First operand 70 states and 94 transitions. Second operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 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-08 10:03:27,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:27,341 INFO L93 Difference]: Finished difference Result 129 states and 190 transitions. [2022-04-08 10:03:27,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 10:03:27,341 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 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 21 [2022-04-08 10:03:27,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:27,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 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-08 10:03:27,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 91 transitions. [2022-04-08 10:03:27,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 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-08 10:03:27,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 91 transitions. [2022-04-08 10:03:27,363 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 91 transitions. [2022-04-08 10:03:27,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:27,410 INFO L225 Difference]: With dead ends: 129 [2022-04-08 10:03:27,410 INFO L226 Difference]: Without dead ends: 115 [2022-04-08 10:03:27,410 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:03:27,410 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 62 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:27,411 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 79 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:03:27,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-08 10:03:27,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 79. [2022-04-08 10:03:27,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:27,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 79 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 74 states have internal predecessors, (103), 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-08 10:03:27,510 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 79 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 74 states have internal predecessors, (103), 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-08 10:03:27,510 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 79 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 74 states have internal predecessors, (103), 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-08 10:03:27,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:27,512 INFO L93 Difference]: Finished difference Result 115 states and 150 transitions. [2022-04-08 10:03:27,512 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 150 transitions. [2022-04-08 10:03:27,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:27,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:27,513 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 74 states have internal predecessors, (103), 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 115 states. [2022-04-08 10:03:27,513 INFO L87 Difference]: Start difference. First operand has 79 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 74 states have internal predecessors, (103), 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 115 states. [2022-04-08 10:03:27,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:27,515 INFO L93 Difference]: Finished difference Result 115 states and 150 transitions. [2022-04-08 10:03:27,515 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 150 transitions. [2022-04-08 10:03:27,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:27,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:27,515 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:27,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:27,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 74 states have internal predecessors, (103), 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-08 10:03:27,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 107 transitions. [2022-04-08 10:03:27,517 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 107 transitions. Word has length 21 [2022-04-08 10:03:27,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:27,517 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 107 transitions. [2022-04-08 10:03:27,517 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 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-08 10:03:27,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 107 transitions. [2022-04-08 10:03:27,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:27,628 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 107 transitions. [2022-04-08 10:03:27,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 10:03:27,628 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:27,628 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:27,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-08 10:03:27,843 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-08 10:03:27,844 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:27,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:27,844 INFO L85 PathProgramCache]: Analyzing trace with hash 219580352, now seen corresponding path program 7 times [2022-04-08 10:03:27,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:27,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1339721397] [2022-04-08 10:03:27,848 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:27,848 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:27,848 INFO L85 PathProgramCache]: Analyzing trace with hash 219580352, now seen corresponding path program 8 times [2022-04-08 10:03:27,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:27,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610480427] [2022-04-08 10:03:27,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:27,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:27,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:27,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:27,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:27,918 INFO L290 TraceCheckUtils]: 0: Hoare triple {6523#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6512#true} is VALID [2022-04-08 10:03:27,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {6512#true} assume true; {6512#true} is VALID [2022-04-08 10:03:27,918 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6512#true} {6512#true} #72#return; {6512#true} is VALID [2022-04-08 10:03:27,918 INFO L272 TraceCheckUtils]: 0: Hoare triple {6512#true} call ULTIMATE.init(); {6523#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:27,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {6523#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6512#true} is VALID [2022-04-08 10:03:27,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {6512#true} assume true; {6512#true} is VALID [2022-04-08 10:03:27,919 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6512#true} {6512#true} #72#return; {6512#true} is VALID [2022-04-08 10:03:27,919 INFO L272 TraceCheckUtils]: 4: Hoare triple {6512#true} call #t~ret13 := main(); {6512#true} is VALID [2022-04-08 10:03:27,919 INFO L290 TraceCheckUtils]: 5: Hoare triple {6512#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6517#(= main_~y~0 0)} is VALID [2022-04-08 10:03:27,919 INFO L290 TraceCheckUtils]: 6: Hoare triple {6517#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6518#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:27,920 INFO L290 TraceCheckUtils]: 7: Hoare triple {6518#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6519#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:27,920 INFO L290 TraceCheckUtils]: 8: Hoare triple {6519#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {6519#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:27,920 INFO L290 TraceCheckUtils]: 9: Hoare triple {6519#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {6520#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:03:27,921 INFO L290 TraceCheckUtils]: 10: Hoare triple {6520#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6521#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:03:27,921 INFO L290 TraceCheckUtils]: 11: Hoare triple {6521#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6522#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:03:27,922 INFO L290 TraceCheckUtils]: 12: Hoare triple {6522#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6513#false} is VALID [2022-04-08 10:03:27,922 INFO L290 TraceCheckUtils]: 13: Hoare triple {6513#false} assume !(~z~0 % 4294967296 > 0); {6513#false} is VALID [2022-04-08 10:03:27,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {6513#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6513#false} is VALID [2022-04-08 10:03:27,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {6513#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6513#false} is VALID [2022-04-08 10:03:27,922 INFO L290 TraceCheckUtils]: 16: Hoare triple {6513#false} assume !(~y~0 % 4294967296 > 0); {6513#false} is VALID [2022-04-08 10:03:27,922 INFO L290 TraceCheckUtils]: 17: Hoare triple {6513#false} assume !(~x~0 % 4294967296 > 0); {6513#false} is VALID [2022-04-08 10:03:27,922 INFO L272 TraceCheckUtils]: 18: Hoare triple {6513#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6513#false} is VALID [2022-04-08 10:03:27,922 INFO L290 TraceCheckUtils]: 19: Hoare triple {6513#false} ~cond := #in~cond; {6513#false} is VALID [2022-04-08 10:03:27,922 INFO L290 TraceCheckUtils]: 20: Hoare triple {6513#false} assume 0 == ~cond; {6513#false} is VALID [2022-04-08 10:03:27,922 INFO L290 TraceCheckUtils]: 21: Hoare triple {6513#false} assume !false; {6513#false} is VALID [2022-04-08 10:03:27,922 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:03:27,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:27,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610480427] [2022-04-08 10:03:27,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610480427] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:27,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654907324] [2022-04-08 10:03:27,923 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:03:27,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:27,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:27,923 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:03:27,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-08 10:03:27,954 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:03:27,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:27,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-08 10:03:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:27,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:28,075 INFO L272 TraceCheckUtils]: 0: Hoare triple {6512#true} call ULTIMATE.init(); {6512#true} is VALID [2022-04-08 10:03:28,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {6512#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6512#true} is VALID [2022-04-08 10:03:28,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {6512#true} assume true; {6512#true} is VALID [2022-04-08 10:03:28,076 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6512#true} {6512#true} #72#return; {6512#true} is VALID [2022-04-08 10:03:28,076 INFO L272 TraceCheckUtils]: 4: Hoare triple {6512#true} call #t~ret13 := main(); {6512#true} is VALID [2022-04-08 10:03:28,076 INFO L290 TraceCheckUtils]: 5: Hoare triple {6512#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6517#(= main_~y~0 0)} is VALID [2022-04-08 10:03:28,076 INFO L290 TraceCheckUtils]: 6: Hoare triple {6517#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6518#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:28,077 INFO L290 TraceCheckUtils]: 7: Hoare triple {6518#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6519#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:28,077 INFO L290 TraceCheckUtils]: 8: Hoare triple {6519#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {6519#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:28,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {6519#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {6554#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:28,078 INFO L290 TraceCheckUtils]: 10: Hoare triple {6554#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6558#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:03:28,078 INFO L290 TraceCheckUtils]: 11: Hoare triple {6558#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6562#(and (= main_~y~0 (+ main_~z~0 2)) (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:28,079 INFO L290 TraceCheckUtils]: 12: Hoare triple {6562#(and (= main_~y~0 (+ main_~z~0 2)) (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6513#false} is VALID [2022-04-08 10:03:28,079 INFO L290 TraceCheckUtils]: 13: Hoare triple {6513#false} assume !(~z~0 % 4294967296 > 0); {6513#false} is VALID [2022-04-08 10:03:28,079 INFO L290 TraceCheckUtils]: 14: Hoare triple {6513#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6513#false} is VALID [2022-04-08 10:03:28,079 INFO L290 TraceCheckUtils]: 15: Hoare triple {6513#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6513#false} is VALID [2022-04-08 10:03:28,079 INFO L290 TraceCheckUtils]: 16: Hoare triple {6513#false} assume !(~y~0 % 4294967296 > 0); {6513#false} is VALID [2022-04-08 10:03:28,079 INFO L290 TraceCheckUtils]: 17: Hoare triple {6513#false} assume !(~x~0 % 4294967296 > 0); {6513#false} is VALID [2022-04-08 10:03:28,079 INFO L272 TraceCheckUtils]: 18: Hoare triple {6513#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6513#false} is VALID [2022-04-08 10:03:28,079 INFO L290 TraceCheckUtils]: 19: Hoare triple {6513#false} ~cond := #in~cond; {6513#false} is VALID [2022-04-08 10:03:28,079 INFO L290 TraceCheckUtils]: 20: Hoare triple {6513#false} assume 0 == ~cond; {6513#false} is VALID [2022-04-08 10:03:28,079 INFO L290 TraceCheckUtils]: 21: Hoare triple {6513#false} assume !false; {6513#false} is VALID [2022-04-08 10:03:28,080 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:03:28,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:28,224 INFO L290 TraceCheckUtils]: 21: Hoare triple {6513#false} assume !false; {6513#false} is VALID [2022-04-08 10:03:28,224 INFO L290 TraceCheckUtils]: 20: Hoare triple {6513#false} assume 0 == ~cond; {6513#false} is VALID [2022-04-08 10:03:28,224 INFO L290 TraceCheckUtils]: 19: Hoare triple {6513#false} ~cond := #in~cond; {6513#false} is VALID [2022-04-08 10:03:28,224 INFO L272 TraceCheckUtils]: 18: Hoare triple {6513#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6513#false} is VALID [2022-04-08 10:03:28,224 INFO L290 TraceCheckUtils]: 17: Hoare triple {6513#false} assume !(~x~0 % 4294967296 > 0); {6513#false} is VALID [2022-04-08 10:03:28,225 INFO L290 TraceCheckUtils]: 16: Hoare triple {6608#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {6513#false} is VALID [2022-04-08 10:03:28,225 INFO L290 TraceCheckUtils]: 15: Hoare triple {6612#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6608#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:28,226 INFO L290 TraceCheckUtils]: 14: Hoare triple {6616#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6612#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:28,226 INFO L290 TraceCheckUtils]: 13: Hoare triple {6616#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~z~0 % 4294967296 > 0); {6616#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:03:28,227 INFO L290 TraceCheckUtils]: 12: Hoare triple {6623#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6616#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:03:28,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {6627#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6623#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-08 10:03:28,229 INFO L290 TraceCheckUtils]: 10: Hoare triple {6631#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6627#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:03:28,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {6512#true} ~z~0 := ~y~0; {6631#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-08 10:03:28,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {6512#true} assume !(~x~0 % 4294967296 > 0); {6512#true} is VALID [2022-04-08 10:03:28,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {6512#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6512#true} is VALID [2022-04-08 10:03:28,229 INFO L290 TraceCheckUtils]: 6: Hoare triple {6512#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {6512#true} is VALID [2022-04-08 10:03:28,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {6512#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6512#true} is VALID [2022-04-08 10:03:28,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {6512#true} call #t~ret13 := main(); {6512#true} is VALID [2022-04-08 10:03:28,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6512#true} {6512#true} #72#return; {6512#true} is VALID [2022-04-08 10:03:28,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {6512#true} assume true; {6512#true} is VALID [2022-04-08 10:03:28,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {6512#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6512#true} is VALID [2022-04-08 10:03:28,229 INFO L272 TraceCheckUtils]: 0: Hoare triple {6512#true} call ULTIMATE.init(); {6512#true} is VALID [2022-04-08 10:03:28,230 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:03:28,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654907324] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:28,230 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:28,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-08 10:03:28,230 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:28,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1339721397] [2022-04-08 10:03:28,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1339721397] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:28,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:28,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 10:03:28,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790219786] [2022-04-08 10:03:28,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:28,231 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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 22 [2022-04-08 10:03:28,231 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:28,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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-08 10:03:28,244 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-08 10:03:28,245 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 10:03:28,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:28,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 10:03:28,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-04-08 10:03:28,245 INFO L87 Difference]: Start difference. First operand 79 states and 107 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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-08 10:03:28,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:28,800 INFO L93 Difference]: Finished difference Result 97 states and 127 transitions. [2022-04-08 10:03:28,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 10:03:28,800 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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 22 [2022-04-08 10:03:28,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:28,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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-08 10:03:28,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 49 transitions. [2022-04-08 10:03:28,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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-08 10:03:28,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 49 transitions. [2022-04-08 10:03:28,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 49 transitions. [2022-04-08 10:03:28,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:28,834 INFO L225 Difference]: With dead ends: 97 [2022-04-08 10:03:28,834 INFO L226 Difference]: Without dead ends: 87 [2022-04-08 10:03:28,835 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=595, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:03:28,835 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 26 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:28,835 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 46 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:03:28,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-08 10:03:28,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 78. [2022-04-08 10:03:28,977 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:28,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 78 states, 73 states have (on average 1.36986301369863) internal successors, (100), 73 states have internal predecessors, (100), 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-08 10:03:28,977 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 78 states, 73 states have (on average 1.36986301369863) internal successors, (100), 73 states have internal predecessors, (100), 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-08 10:03:28,977 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 78 states, 73 states have (on average 1.36986301369863) internal successors, (100), 73 states have internal predecessors, (100), 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-08 10:03:28,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:28,979 INFO L93 Difference]: Finished difference Result 87 states and 115 transitions. [2022-04-08 10:03:28,979 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 115 transitions. [2022-04-08 10:03:28,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:28,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:28,980 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 73 states have (on average 1.36986301369863) internal successors, (100), 73 states have internal predecessors, (100), 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 87 states. [2022-04-08 10:03:28,980 INFO L87 Difference]: Start difference. First operand has 78 states, 73 states have (on average 1.36986301369863) internal successors, (100), 73 states have internal predecessors, (100), 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 87 states. [2022-04-08 10:03:28,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:28,981 INFO L93 Difference]: Finished difference Result 87 states and 115 transitions. [2022-04-08 10:03:28,981 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 115 transitions. [2022-04-08 10:03:28,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:28,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:28,981 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:28,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:28,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.36986301369863) internal successors, (100), 73 states have internal predecessors, (100), 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-08 10:03:28,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 104 transitions. [2022-04-08 10:03:28,982 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 104 transitions. Word has length 22 [2022-04-08 10:03:28,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:28,982 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 104 transitions. [2022-04-08 10:03:28,982 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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-08 10:03:28,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 104 transitions. [2022-04-08 10:03:29,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:29,108 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 104 transitions. [2022-04-08 10:03:29,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 10:03:29,109 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:29,109 INFO L499 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:29,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-08 10:03:29,324 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-08 10:03:29,324 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:29,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:29,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1722196481, now seen corresponding path program 13 times [2022-04-08 10:03:29,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:29,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1058117884] [2022-04-08 10:03:29,327 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:29,327 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:29,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1722196481, now seen corresponding path program 14 times [2022-04-08 10:03:29,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:29,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319618275] [2022-04-08 10:03:29,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:29,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:29,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:29,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:29,439 INFO L290 TraceCheckUtils]: 0: Hoare triple {7222#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7208#true} is VALID [2022-04-08 10:03:29,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {7208#true} assume true; {7208#true} is VALID [2022-04-08 10:03:29,439 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7208#true} {7208#true} #72#return; {7208#true} is VALID [2022-04-08 10:03:29,439 INFO L272 TraceCheckUtils]: 0: Hoare triple {7208#true} call ULTIMATE.init(); {7222#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:29,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {7222#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7208#true} is VALID [2022-04-08 10:03:29,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {7208#true} assume true; {7208#true} is VALID [2022-04-08 10:03:29,440 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7208#true} {7208#true} #72#return; {7208#true} is VALID [2022-04-08 10:03:29,440 INFO L272 TraceCheckUtils]: 4: Hoare triple {7208#true} call #t~ret13 := main(); {7208#true} is VALID [2022-04-08 10:03:29,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {7208#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7213#(= main_~y~0 0)} is VALID [2022-04-08 10:03:29,440 INFO L290 TraceCheckUtils]: 6: Hoare triple {7213#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7214#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:29,441 INFO L290 TraceCheckUtils]: 7: Hoare triple {7214#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7215#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:29,441 INFO L290 TraceCheckUtils]: 8: Hoare triple {7215#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7216#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:29,442 INFO L290 TraceCheckUtils]: 9: Hoare triple {7216#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7217#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:29,442 INFO L290 TraceCheckUtils]: 10: Hoare triple {7217#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7218#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:29,443 INFO L290 TraceCheckUtils]: 11: Hoare triple {7218#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7219#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:29,443 INFO L290 TraceCheckUtils]: 12: Hoare triple {7219#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7220#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:29,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {7220#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {7220#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:29,444 INFO L290 TraceCheckUtils]: 14: Hoare triple {7220#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {7221#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:03:29,445 INFO L290 TraceCheckUtils]: 15: Hoare triple {7221#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {7209#false} is VALID [2022-04-08 10:03:29,445 INFO L290 TraceCheckUtils]: 16: Hoare triple {7209#false} assume !(~y~0 % 4294967296 > 0); {7209#false} is VALID [2022-04-08 10:03:29,445 INFO L290 TraceCheckUtils]: 17: Hoare triple {7209#false} assume !(~x~0 % 4294967296 > 0); {7209#false} is VALID [2022-04-08 10:03:29,445 INFO L272 TraceCheckUtils]: 18: Hoare triple {7209#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7209#false} is VALID [2022-04-08 10:03:29,445 INFO L290 TraceCheckUtils]: 19: Hoare triple {7209#false} ~cond := #in~cond; {7209#false} is VALID [2022-04-08 10:03:29,445 INFO L290 TraceCheckUtils]: 20: Hoare triple {7209#false} assume 0 == ~cond; {7209#false} is VALID [2022-04-08 10:03:29,445 INFO L290 TraceCheckUtils]: 21: Hoare triple {7209#false} assume !false; {7209#false} is VALID [2022-04-08 10:03:29,445 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:29,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:29,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319618275] [2022-04-08 10:03:29,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319618275] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:29,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585202581] [2022-04-08 10:03:29,445 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:03:29,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:29,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:29,451 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:03:29,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-08 10:03:29,479 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:03:29,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:29,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 10:03:29,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:29,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:29,713 INFO L272 TraceCheckUtils]: 0: Hoare triple {7208#true} call ULTIMATE.init(); {7208#true} is VALID [2022-04-08 10:03:29,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {7208#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7208#true} is VALID [2022-04-08 10:03:29,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {7208#true} assume true; {7208#true} is VALID [2022-04-08 10:03:29,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7208#true} {7208#true} #72#return; {7208#true} is VALID [2022-04-08 10:03:29,713 INFO L272 TraceCheckUtils]: 4: Hoare triple {7208#true} call #t~ret13 := main(); {7208#true} is VALID [2022-04-08 10:03:29,714 INFO L290 TraceCheckUtils]: 5: Hoare triple {7208#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7213#(= main_~y~0 0)} is VALID [2022-04-08 10:03:29,714 INFO L290 TraceCheckUtils]: 6: Hoare triple {7213#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7214#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:29,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {7214#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7215#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:29,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {7215#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7216#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:29,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {7216#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7217#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:29,716 INFO L290 TraceCheckUtils]: 10: Hoare triple {7217#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7218#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:29,716 INFO L290 TraceCheckUtils]: 11: Hoare triple {7218#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7219#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:29,717 INFO L290 TraceCheckUtils]: 12: Hoare triple {7219#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7220#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:29,717 INFO L290 TraceCheckUtils]: 13: Hoare triple {7220#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {7220#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:29,718 INFO L290 TraceCheckUtils]: 14: Hoare triple {7220#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {7268#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:03:29,718 INFO L290 TraceCheckUtils]: 15: Hoare triple {7268#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {7209#false} is VALID [2022-04-08 10:03:29,718 INFO L290 TraceCheckUtils]: 16: Hoare triple {7209#false} assume !(~y~0 % 4294967296 > 0); {7209#false} is VALID [2022-04-08 10:03:29,718 INFO L290 TraceCheckUtils]: 17: Hoare triple {7209#false} assume !(~x~0 % 4294967296 > 0); {7209#false} is VALID [2022-04-08 10:03:29,718 INFO L272 TraceCheckUtils]: 18: Hoare triple {7209#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7209#false} is VALID [2022-04-08 10:03:29,718 INFO L290 TraceCheckUtils]: 19: Hoare triple {7209#false} ~cond := #in~cond; {7209#false} is VALID [2022-04-08 10:03:29,718 INFO L290 TraceCheckUtils]: 20: Hoare triple {7209#false} assume 0 == ~cond; {7209#false} is VALID [2022-04-08 10:03:29,718 INFO L290 TraceCheckUtils]: 21: Hoare triple {7209#false} assume !false; {7209#false} is VALID [2022-04-08 10:03:29,719 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:29,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:29,900 INFO L290 TraceCheckUtils]: 21: Hoare triple {7209#false} assume !false; {7209#false} is VALID [2022-04-08 10:03:29,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {7209#false} assume 0 == ~cond; {7209#false} is VALID [2022-04-08 10:03:29,900 INFO L290 TraceCheckUtils]: 19: Hoare triple {7209#false} ~cond := #in~cond; {7209#false} is VALID [2022-04-08 10:03:29,900 INFO L272 TraceCheckUtils]: 18: Hoare triple {7209#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7209#false} is VALID [2022-04-08 10:03:29,900 INFO L290 TraceCheckUtils]: 17: Hoare triple {7209#false} assume !(~x~0 % 4294967296 > 0); {7209#false} is VALID [2022-04-08 10:03:29,900 INFO L290 TraceCheckUtils]: 16: Hoare triple {7209#false} assume !(~y~0 % 4294967296 > 0); {7209#false} is VALID [2022-04-08 10:03:29,900 INFO L290 TraceCheckUtils]: 15: Hoare triple {7308#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {7209#false} is VALID [2022-04-08 10:03:29,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {7312#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {7308#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:03:29,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {7312#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {7312#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:29,901 INFO L290 TraceCheckUtils]: 12: Hoare triple {7319#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7312#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:29,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {7323#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7319#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:03:29,903 INFO L290 TraceCheckUtils]: 10: Hoare triple {7327#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7323#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:03:29,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {7331#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7327#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:03:29,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {7335#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7331#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:03:29,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {7339#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7335#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:29,905 INFO L290 TraceCheckUtils]: 6: Hoare triple {7343#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {7339#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:03:29,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {7208#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7343#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:29,905 INFO L272 TraceCheckUtils]: 4: Hoare triple {7208#true} call #t~ret13 := main(); {7208#true} is VALID [2022-04-08 10:03:29,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7208#true} {7208#true} #72#return; {7208#true} is VALID [2022-04-08 10:03:29,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {7208#true} assume true; {7208#true} is VALID [2022-04-08 10:03:29,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {7208#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7208#true} is VALID [2022-04-08 10:03:29,906 INFO L272 TraceCheckUtils]: 0: Hoare triple {7208#true} call ULTIMATE.init(); {7208#true} is VALID [2022-04-08 10:03:29,906 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:29,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585202581] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:29,906 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:29,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-08 10:03:29,906 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:29,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1058117884] [2022-04-08 10:03:29,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1058117884] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:29,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:29,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 10:03:29,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324993819] [2022-04-08 10:03:29,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:29,907 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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 22 [2022-04-08 10:03:29,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:29,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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-08 10:03:29,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:29,920 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 10:03:29,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:29,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 10:03:29,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2022-04-08 10:03:29,921 INFO L87 Difference]: Start difference. First operand 78 states and 104 transitions. Second operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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-08 10:03:31,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:31,037 INFO L93 Difference]: Finished difference Result 142 states and 209 transitions. [2022-04-08 10:03:31,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 10:03:31,038 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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 22 [2022-04-08 10:03:31,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:31,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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-08 10:03:31,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 101 transitions. [2022-04-08 10:03:31,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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-08 10:03:31,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 101 transitions. [2022-04-08 10:03:31,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 101 transitions. [2022-04-08 10:03:31,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:31,091 INFO L225 Difference]: With dead ends: 142 [2022-04-08 10:03:31,091 INFO L226 Difference]: Without dead ends: 128 [2022-04-08 10:03:31,092 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=217, Invalid=713, Unknown=0, NotChecked=0, Total=930 [2022-04-08 10:03:31,092 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 72 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:31,092 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 89 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:03:31,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-04-08 10:03:31,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 87. [2022-04-08 10:03:31,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:31,207 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand has 87 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 82 states have internal predecessors, (113), 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-08 10:03:31,207 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand has 87 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 82 states have internal predecessors, (113), 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-08 10:03:31,207 INFO L87 Difference]: Start difference. First operand 128 states. Second operand has 87 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 82 states have internal predecessors, (113), 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-08 10:03:31,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:31,228 INFO L93 Difference]: Finished difference Result 128 states and 166 transitions. [2022-04-08 10:03:31,228 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 166 transitions. [2022-04-08 10:03:31,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:31,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:31,229 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 82 states have internal predecessors, (113), 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 128 states. [2022-04-08 10:03:31,229 INFO L87 Difference]: Start difference. First operand has 87 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 82 states have internal predecessors, (113), 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 128 states. [2022-04-08 10:03:31,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:31,231 INFO L93 Difference]: Finished difference Result 128 states and 166 transitions. [2022-04-08 10:03:31,231 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 166 transitions. [2022-04-08 10:03:31,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:31,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:31,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:31,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:31,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 82 states have internal predecessors, (113), 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-08 10:03:31,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 117 transitions. [2022-04-08 10:03:31,232 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 117 transitions. Word has length 22 [2022-04-08 10:03:31,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:31,232 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 117 transitions. [2022-04-08 10:03:31,232 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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-08 10:03:31,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 117 transitions. [2022-04-08 10:03:31,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:31,412 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 117 transitions. [2022-04-08 10:03:31,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 10:03:31,412 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:31,412 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:31,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-08 10:03:31,627 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:31,628 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:31,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:31,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1247228840, now seen corresponding path program 7 times [2022-04-08 10:03:31,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:31,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1385348965] [2022-04-08 10:03:31,632 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:31,632 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:31,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1247228840, now seen corresponding path program 8 times [2022-04-08 10:03:31,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:31,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894198207] [2022-04-08 10:03:31,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:31,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:31,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:31,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:31,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:31,858 INFO L290 TraceCheckUtils]: 0: Hoare triple {8110#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8096#true} is VALID [2022-04-08 10:03:31,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {8096#true} assume true; {8096#true} is VALID [2022-04-08 10:03:31,859 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8096#true} {8096#true} #72#return; {8096#true} is VALID [2022-04-08 10:03:31,859 INFO L272 TraceCheckUtils]: 0: Hoare triple {8096#true} call ULTIMATE.init(); {8110#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:31,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {8110#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8096#true} is VALID [2022-04-08 10:03:31,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {8096#true} assume true; {8096#true} is VALID [2022-04-08 10:03:31,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8096#true} {8096#true} #72#return; {8096#true} is VALID [2022-04-08 10:03:31,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {8096#true} call #t~ret13 := main(); {8096#true} is VALID [2022-04-08 10:03:31,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {8096#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8101#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-08 10:03:31,869 INFO L290 TraceCheckUtils]: 6: Hoare triple {8101#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8102#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:31,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {8102#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8103#(and (<= 2 main_~y~0) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)))} is VALID [2022-04-08 10:03:31,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {8103#(and (<= 2 main_~y~0) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)))} assume !(~x~0 % 4294967296 > 0); {8104#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:31,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {8104#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {8104#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:31,903 INFO L290 TraceCheckUtils]: 10: Hoare triple {8104#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8104#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:31,903 INFO L290 TraceCheckUtils]: 11: Hoare triple {8104#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8104#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:31,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {8104#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} assume !(~z~0 % 4294967296 > 0); {8104#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:31,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {8104#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8105#(and (<= (+ (* 4294967296 (div (+ main_~n~0 4294967294 (* (- 1) main_~y~0)) 4294967296)) 2) main_~n~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:31,905 INFO L290 TraceCheckUtils]: 14: Hoare triple {8105#(and (<= (+ (* 4294967296 (div (+ main_~n~0 4294967294 (* (- 1) main_~y~0)) 4294967296)) 2) main_~n~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8106#(and (<= (+ 2 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~y~0) 4294967293) 4294967296))) main_~n~0) (<= main_~y~0 0))} is VALID [2022-04-08 10:03:31,905 INFO L290 TraceCheckUtils]: 15: Hoare triple {8106#(and (<= (+ 2 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~y~0) 4294967293) 4294967296))) main_~n~0) (<= main_~y~0 0))} assume !(~y~0 % 4294967296 > 0); {8106#(and (<= (+ 2 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~y~0) 4294967293) 4294967296))) main_~n~0) (<= main_~y~0 0))} is VALID [2022-04-08 10:03:31,906 INFO L290 TraceCheckUtils]: 16: Hoare triple {8106#(and (<= (+ 2 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~y~0) 4294967293) 4294967296))) main_~n~0) (<= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8105#(and (<= (+ (* 4294967296 (div (+ main_~n~0 4294967294 (* (- 1) main_~y~0)) 4294967296)) 2) main_~n~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:31,907 INFO L290 TraceCheckUtils]: 17: Hoare triple {8105#(and (<= (+ (* 4294967296 (div (+ main_~n~0 4294967294 (* (- 1) main_~y~0)) 4294967296)) 2) main_~n~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8107#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:03:31,908 INFO L290 TraceCheckUtils]: 18: Hoare triple {8107#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {8107#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:03:31,909 INFO L272 TraceCheckUtils]: 19: Hoare triple {8107#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8108#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:03:31,909 INFO L290 TraceCheckUtils]: 20: Hoare triple {8108#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {8109#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:03:31,909 INFO L290 TraceCheckUtils]: 21: Hoare triple {8109#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {8097#false} is VALID [2022-04-08 10:03:31,909 INFO L290 TraceCheckUtils]: 22: Hoare triple {8097#false} assume !false; {8097#false} is VALID [2022-04-08 10:03:31,909 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:03:31,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:31,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894198207] [2022-04-08 10:03:31,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894198207] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:31,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198187271] [2022-04-08 10:03:31,910 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:03:31,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:31,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:31,920 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:03:31,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-08 10:03:31,974 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:03:31,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:31,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 10:03:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:31,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:32,913 INFO L272 TraceCheckUtils]: 0: Hoare triple {8096#true} call ULTIMATE.init(); {8096#true} is VALID [2022-04-08 10:03:32,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {8096#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8096#true} is VALID [2022-04-08 10:03:32,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {8096#true} assume true; {8096#true} is VALID [2022-04-08 10:03:32,913 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8096#true} {8096#true} #72#return; {8096#true} is VALID [2022-04-08 10:03:32,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {8096#true} call #t~ret13 := main(); {8096#true} is VALID [2022-04-08 10:03:32,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {8096#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8101#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-08 10:03:32,914 INFO L290 TraceCheckUtils]: 6: Hoare triple {8101#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8132#(and (= (+ main_~x~0 1) main_~n~0) (= main_~y~0 1))} is VALID [2022-04-08 10:03:32,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {8132#(and (= (+ main_~x~0 1) main_~n~0) (= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8136#(and (= main_~y~0 2) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} is VALID [2022-04-08 10:03:32,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {8136#(and (= main_~y~0 2) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {8140#(and (= main_~y~0 2) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-08 10:03:32,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {8140#(and (= main_~y~0 2) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)) (not (< 0 (mod main_~x~0 4294967296))))} ~z~0 := ~y~0; {8140#(and (= main_~y~0 2) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-08 10:03:32,917 INFO L290 TraceCheckUtils]: 10: Hoare triple {8140#(and (= main_~y~0 2) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)) (not (< 0 (mod main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8147#(and (= main_~y~0 2) (= main_~x~0 (+ (- 1) main_~n~0)) (not (< 0 (mod (+ main_~n~0 4294967294) 4294967296))))} is VALID [2022-04-08 10:03:32,918 INFO L290 TraceCheckUtils]: 11: Hoare triple {8147#(and (= main_~y~0 2) (= main_~x~0 (+ (- 1) main_~n~0)) (not (< 0 (mod (+ main_~n~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8104#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:32,918 INFO L290 TraceCheckUtils]: 12: Hoare triple {8104#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} assume !(~z~0 % 4294967296 > 0); {8104#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:32,919 INFO L290 TraceCheckUtils]: 13: Hoare triple {8104#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8105#(and (<= (+ (* 4294967296 (div (+ main_~n~0 4294967294 (* (- 1) main_~y~0)) 4294967296)) 2) main_~n~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:32,920 INFO L290 TraceCheckUtils]: 14: Hoare triple {8105#(and (<= (+ (* 4294967296 (div (+ main_~n~0 4294967294 (* (- 1) main_~y~0)) 4294967296)) 2) main_~n~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8106#(and (<= (+ 2 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~y~0) 4294967293) 4294967296))) main_~n~0) (<= main_~y~0 0))} is VALID [2022-04-08 10:03:32,920 INFO L290 TraceCheckUtils]: 15: Hoare triple {8106#(and (<= (+ 2 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~y~0) 4294967293) 4294967296))) main_~n~0) (<= main_~y~0 0))} assume !(~y~0 % 4294967296 > 0); {8106#(and (<= (+ 2 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~y~0) 4294967293) 4294967296))) main_~n~0) (<= main_~y~0 0))} is VALID [2022-04-08 10:03:32,921 INFO L290 TraceCheckUtils]: 16: Hoare triple {8106#(and (<= (+ 2 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~y~0) 4294967293) 4294967296))) main_~n~0) (<= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8105#(and (<= (+ (* 4294967296 (div (+ main_~n~0 4294967294 (* (- 1) main_~y~0)) 4294967296)) 2) main_~n~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:32,922 INFO L290 TraceCheckUtils]: 17: Hoare triple {8105#(and (<= (+ (* 4294967296 (div (+ main_~n~0 4294967294 (* (- 1) main_~y~0)) 4294967296)) 2) main_~n~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8104#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:32,923 INFO L290 TraceCheckUtils]: 18: Hoare triple {8104#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {8104#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:32,924 INFO L272 TraceCheckUtils]: 19: Hoare triple {8104#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8175#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:03:32,925 INFO L290 TraceCheckUtils]: 20: Hoare triple {8175#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8179#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:03:32,925 INFO L290 TraceCheckUtils]: 21: Hoare triple {8179#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8097#false} is VALID [2022-04-08 10:03:32,925 INFO L290 TraceCheckUtils]: 22: Hoare triple {8097#false} assume !false; {8097#false} is VALID [2022-04-08 10:03:32,925 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:32,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:33,369 INFO L290 TraceCheckUtils]: 22: Hoare triple {8097#false} assume !false; {8097#false} is VALID [2022-04-08 10:03:33,369 INFO L290 TraceCheckUtils]: 21: Hoare triple {8179#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8097#false} is VALID [2022-04-08 10:03:33,369 INFO L290 TraceCheckUtils]: 20: Hoare triple {8175#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8179#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:03:33,370 INFO L272 TraceCheckUtils]: 19: Hoare triple {8107#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8175#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:03:33,371 INFO L290 TraceCheckUtils]: 18: Hoare triple {8107#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {8107#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:03:33,372 INFO L290 TraceCheckUtils]: 17: Hoare triple {8201#(and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8107#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:03:33,372 INFO L290 TraceCheckUtils]: 16: Hoare triple {8205#(and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8201#(and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:03:33,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {8205#(and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0)))} assume !(~y~0 % 4294967296 > 0); {8205#(and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:03:33,374 INFO L290 TraceCheckUtils]: 14: Hoare triple {8201#(and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8205#(and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:03:33,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {8107#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8201#(and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:03:33,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {8107#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {8107#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:03:33,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {8107#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8107#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:03:33,376 INFO L290 TraceCheckUtils]: 10: Hoare triple {8107#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8107#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:03:33,376 INFO L290 TraceCheckUtils]: 9: Hoare triple {8107#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} ~z~0 := ~y~0; {8107#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:03:33,377 INFO L290 TraceCheckUtils]: 8: Hoare triple {8230#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} assume !(~x~0 % 4294967296 > 0); {8107#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:03:33,378 INFO L290 TraceCheckUtils]: 7: Hoare triple {8234#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8230#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-08 10:03:33,379 INFO L290 TraceCheckUtils]: 6: Hoare triple {8238#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8234#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-08 10:03:33,380 INFO L290 TraceCheckUtils]: 5: Hoare triple {8096#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8238#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:03:33,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {8096#true} call #t~ret13 := main(); {8096#true} is VALID [2022-04-08 10:03:33,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8096#true} {8096#true} #72#return; {8096#true} is VALID [2022-04-08 10:03:33,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {8096#true} assume true; {8096#true} is VALID [2022-04-08 10:03:33,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {8096#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8096#true} is VALID [2022-04-08 10:03:33,380 INFO L272 TraceCheckUtils]: 0: Hoare triple {8096#true} call ULTIMATE.init(); {8096#true} is VALID [2022-04-08 10:03:33,381 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:03:33,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198187271] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:33,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:33,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 10] total 23 [2022-04-08 10:03:33,381 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:33,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1385348965] [2022-04-08 10:03:33,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1385348965] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:33,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:33,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 10:03:33,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336109320] [2022-04-08 10:03:33,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:33,381 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 10 states have internal predecessors, (18), 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 23 [2022-04-08 10:03:33,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:33,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.5) internal successors, (18), 10 states have internal predecessors, (18), 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-08 10:03:33,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:33,406 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 10:03:33,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:33,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 10:03:33,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2022-04-08 10:03:33,407 INFO L87 Difference]: Start difference. First operand 87 states and 117 transitions. Second operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 10 states have internal predecessors, (18), 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-08 10:03:34,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:34,164 INFO L93 Difference]: Finished difference Result 98 states and 128 transitions. [2022-04-08 10:03:34,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 10:03:34,165 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 10 states have internal predecessors, (18), 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 23 [2022-04-08 10:03:34,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:34,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 10 states have internal predecessors, (18), 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-08 10:03:34,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 37 transitions. [2022-04-08 10:03:34,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 10 states have internal predecessors, (18), 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-08 10:03:34,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 37 transitions. [2022-04-08 10:03:34,166 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 37 transitions. [2022-04-08 10:03:34,285 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-08 10:03:34,286 INFO L225 Difference]: With dead ends: 98 [2022-04-08 10:03:34,286 INFO L226 Difference]: Without dead ends: 93 [2022-04-08 10:03:34,286 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=799, Unknown=0, NotChecked=0, Total=930 [2022-04-08 10:03:34,286 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 29 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:34,287 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 59 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:03:34,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-08 10:03:34,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2022-04-08 10:03:34,414 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:34,414 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 91 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 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-08 10:03:34,415 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 91 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 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-08 10:03:34,415 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 91 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 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-08 10:03:34,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:34,416 INFO L93 Difference]: Finished difference Result 93 states and 123 transitions. [2022-04-08 10:03:34,416 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 123 transitions. [2022-04-08 10:03:34,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:34,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:34,416 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 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 93 states. [2022-04-08 10:03:34,416 INFO L87 Difference]: Start difference. First operand has 91 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 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 93 states. [2022-04-08 10:03:34,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:34,417 INFO L93 Difference]: Finished difference Result 93 states and 123 transitions. [2022-04-08 10:03:34,417 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 123 transitions. [2022-04-08 10:03:34,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:34,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:34,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:34,418 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:34,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 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-08 10:03:34,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 121 transitions. [2022-04-08 10:03:34,419 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 121 transitions. Word has length 23 [2022-04-08 10:03:34,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:34,419 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 121 transitions. [2022-04-08 10:03:34,419 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 10 states have internal predecessors, (18), 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-08 10:03:34,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 121 transitions. [2022-04-08 10:03:34,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:34,618 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 121 transitions. [2022-04-08 10:03:34,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 10:03:34,619 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:34,619 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:34,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-08 10:03:34,819 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-08 10:03:34,819 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:34,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:34,819 INFO L85 PathProgramCache]: Analyzing trace with hash -610073592, now seen corresponding path program 9 times [2022-04-08 10:03:34,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:34,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1813553934] [2022-04-08 10:03:34,822 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:34,822 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:34,822 INFO L85 PathProgramCache]: Analyzing trace with hash -610073592, now seen corresponding path program 10 times [2022-04-08 10:03:34,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:34,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238776369] [2022-04-08 10:03:34,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:34,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:34,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:34,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:34,915 INFO L290 TraceCheckUtils]: 0: Hoare triple {8850#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8839#true} is VALID [2022-04-08 10:03:34,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {8839#true} assume true; {8839#true} is VALID [2022-04-08 10:03:34,915 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8839#true} {8839#true} #72#return; {8839#true} is VALID [2022-04-08 10:03:34,915 INFO L272 TraceCheckUtils]: 0: Hoare triple {8839#true} call ULTIMATE.init(); {8850#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:34,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {8850#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8839#true} is VALID [2022-04-08 10:03:34,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {8839#true} assume true; {8839#true} is VALID [2022-04-08 10:03:34,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8839#true} {8839#true} #72#return; {8839#true} is VALID [2022-04-08 10:03:34,916 INFO L272 TraceCheckUtils]: 4: Hoare triple {8839#true} call #t~ret13 := main(); {8839#true} is VALID [2022-04-08 10:03:34,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {8839#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8844#(= main_~y~0 0)} is VALID [2022-04-08 10:03:34,916 INFO L290 TraceCheckUtils]: 6: Hoare triple {8844#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8845#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:34,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {8845#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8846#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:34,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {8846#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8847#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:34,918 INFO L290 TraceCheckUtils]: 9: Hoare triple {8847#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {8847#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:34,918 INFO L290 TraceCheckUtils]: 10: Hoare triple {8847#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {8848#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:03:34,919 INFO L290 TraceCheckUtils]: 11: Hoare triple {8848#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8849#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-08 10:03:34,919 INFO L290 TraceCheckUtils]: 12: Hoare triple {8849#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {8840#false} is VALID [2022-04-08 10:03:34,919 INFO L290 TraceCheckUtils]: 13: Hoare triple {8840#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8840#false} is VALID [2022-04-08 10:03:34,919 INFO L290 TraceCheckUtils]: 14: Hoare triple {8840#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8840#false} is VALID [2022-04-08 10:03:34,919 INFO L290 TraceCheckUtils]: 15: Hoare triple {8840#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8840#false} is VALID [2022-04-08 10:03:34,919 INFO L290 TraceCheckUtils]: 16: Hoare triple {8840#false} assume !(~y~0 % 4294967296 > 0); {8840#false} is VALID [2022-04-08 10:03:34,919 INFO L290 TraceCheckUtils]: 17: Hoare triple {8840#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8840#false} is VALID [2022-04-08 10:03:34,920 INFO L290 TraceCheckUtils]: 18: Hoare triple {8840#false} assume !(~x~0 % 4294967296 > 0); {8840#false} is VALID [2022-04-08 10:03:34,920 INFO L272 TraceCheckUtils]: 19: Hoare triple {8840#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8840#false} is VALID [2022-04-08 10:03:34,920 INFO L290 TraceCheckUtils]: 20: Hoare triple {8840#false} ~cond := #in~cond; {8840#false} is VALID [2022-04-08 10:03:34,920 INFO L290 TraceCheckUtils]: 21: Hoare triple {8840#false} assume 0 == ~cond; {8840#false} is VALID [2022-04-08 10:03:34,920 INFO L290 TraceCheckUtils]: 22: Hoare triple {8840#false} assume !false; {8840#false} is VALID [2022-04-08 10:03:34,920 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-08 10:03:34,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:34,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238776369] [2022-04-08 10:03:34,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238776369] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:34,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559906466] [2022-04-08 10:03:34,920 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:03:34,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:34,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:34,921 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:03:34,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-08 10:03:34,959 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:03:34,959 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:34,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-08 10:03:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:34,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:35,086 INFO L272 TraceCheckUtils]: 0: Hoare triple {8839#true} call ULTIMATE.init(); {8839#true} is VALID [2022-04-08 10:03:35,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {8839#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8839#true} is VALID [2022-04-08 10:03:35,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {8839#true} assume true; {8839#true} is VALID [2022-04-08 10:03:35,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8839#true} {8839#true} #72#return; {8839#true} is VALID [2022-04-08 10:03:35,087 INFO L272 TraceCheckUtils]: 4: Hoare triple {8839#true} call #t~ret13 := main(); {8839#true} is VALID [2022-04-08 10:03:35,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {8839#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8844#(= main_~y~0 0)} is VALID [2022-04-08 10:03:35,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {8844#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8845#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:35,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {8845#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8846#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:35,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {8846#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8847#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:35,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {8847#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {8847#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:35,089 INFO L290 TraceCheckUtils]: 10: Hoare triple {8847#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {8884#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:35,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {8884#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8888#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:03:35,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {8888#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {8840#false} is VALID [2022-04-08 10:03:35,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {8840#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8840#false} is VALID [2022-04-08 10:03:35,090 INFO L290 TraceCheckUtils]: 14: Hoare triple {8840#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8840#false} is VALID [2022-04-08 10:03:35,090 INFO L290 TraceCheckUtils]: 15: Hoare triple {8840#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8840#false} is VALID [2022-04-08 10:03:35,090 INFO L290 TraceCheckUtils]: 16: Hoare triple {8840#false} assume !(~y~0 % 4294967296 > 0); {8840#false} is VALID [2022-04-08 10:03:35,090 INFO L290 TraceCheckUtils]: 17: Hoare triple {8840#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8840#false} is VALID [2022-04-08 10:03:35,090 INFO L290 TraceCheckUtils]: 18: Hoare triple {8840#false} assume !(~x~0 % 4294967296 > 0); {8840#false} is VALID [2022-04-08 10:03:35,090 INFO L272 TraceCheckUtils]: 19: Hoare triple {8840#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8840#false} is VALID [2022-04-08 10:03:35,091 INFO L290 TraceCheckUtils]: 20: Hoare triple {8840#false} ~cond := #in~cond; {8840#false} is VALID [2022-04-08 10:03:35,091 INFO L290 TraceCheckUtils]: 21: Hoare triple {8840#false} assume 0 == ~cond; {8840#false} is VALID [2022-04-08 10:03:35,091 INFO L290 TraceCheckUtils]: 22: Hoare triple {8840#false} assume !false; {8840#false} is VALID [2022-04-08 10:03:35,091 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-08 10:03:35,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:35,191 INFO L290 TraceCheckUtils]: 22: Hoare triple {8840#false} assume !false; {8840#false} is VALID [2022-04-08 10:03:35,191 INFO L290 TraceCheckUtils]: 21: Hoare triple {8840#false} assume 0 == ~cond; {8840#false} is VALID [2022-04-08 10:03:35,191 INFO L290 TraceCheckUtils]: 20: Hoare triple {8840#false} ~cond := #in~cond; {8840#false} is VALID [2022-04-08 10:03:35,191 INFO L272 TraceCheckUtils]: 19: Hoare triple {8840#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8840#false} is VALID [2022-04-08 10:03:35,191 INFO L290 TraceCheckUtils]: 18: Hoare triple {8840#false} assume !(~x~0 % 4294967296 > 0); {8840#false} is VALID [2022-04-08 10:03:35,191 INFO L290 TraceCheckUtils]: 17: Hoare triple {8840#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8840#false} is VALID [2022-04-08 10:03:35,192 INFO L290 TraceCheckUtils]: 16: Hoare triple {8840#false} assume !(~y~0 % 4294967296 > 0); {8840#false} is VALID [2022-04-08 10:03:35,192 INFO L290 TraceCheckUtils]: 15: Hoare triple {8840#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8840#false} is VALID [2022-04-08 10:03:35,192 INFO L290 TraceCheckUtils]: 14: Hoare triple {8946#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8840#false} is VALID [2022-04-08 10:03:35,193 INFO L290 TraceCheckUtils]: 13: Hoare triple {8950#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8946#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:03:35,193 INFO L290 TraceCheckUtils]: 12: Hoare triple {8954#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {8950#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:03:35,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {8958#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8954#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:03:35,194 INFO L290 TraceCheckUtils]: 10: Hoare triple {8839#true} ~z~0 := ~y~0; {8958#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:03:35,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {8839#true} assume !(~x~0 % 4294967296 > 0); {8839#true} is VALID [2022-04-08 10:03:35,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {8839#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8839#true} is VALID [2022-04-08 10:03:35,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {8839#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8839#true} is VALID [2022-04-08 10:03:35,194 INFO L290 TraceCheckUtils]: 6: Hoare triple {8839#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {8839#true} is VALID [2022-04-08 10:03:35,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {8839#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8839#true} is VALID [2022-04-08 10:03:35,195 INFO L272 TraceCheckUtils]: 4: Hoare triple {8839#true} call #t~ret13 := main(); {8839#true} is VALID [2022-04-08 10:03:35,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8839#true} {8839#true} #72#return; {8839#true} is VALID [2022-04-08 10:03:35,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {8839#true} assume true; {8839#true} is VALID [2022-04-08 10:03:35,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {8839#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8839#true} is VALID [2022-04-08 10:03:35,195 INFO L272 TraceCheckUtils]: 0: Hoare triple {8839#true} call ULTIMATE.init(); {8839#true} is VALID [2022-04-08 10:03:35,195 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-08 10:03:35,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559906466] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:35,195 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:35,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 15 [2022-04-08 10:03:35,195 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:35,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1813553934] [2022-04-08 10:03:35,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1813553934] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:35,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:35,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 10:03:35,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978496026] [2022-04-08 10:03:35,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:35,196 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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 23 [2022-04-08 10:03:35,196 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:35,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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-08 10:03:35,209 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-08 10:03:35,210 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 10:03:35,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:35,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 10:03:35,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-04-08 10:03:35,210 INFO L87 Difference]: Start difference. First operand 91 states and 121 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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-08 10:03:35,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:35,773 INFO L93 Difference]: Finished difference Result 122 states and 155 transitions. [2022-04-08 10:03:35,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 10:03:35,773 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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 23 [2022-04-08 10:03:35,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:35,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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-08 10:03:35,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-08 10:03:35,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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-08 10:03:35,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-08 10:03:35,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 59 transitions. [2022-04-08 10:03:35,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:35,846 INFO L225 Difference]: With dead ends: 122 [2022-04-08 10:03:35,846 INFO L226 Difference]: Without dead ends: 111 [2022-04-08 10:03:35,846 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2022-04-08 10:03:35,847 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 33 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:35,847 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 55 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:03:35,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-08 10:03:36,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 91. [2022-04-08 10:03:36,015 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:36,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 91 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 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-08 10:03:36,015 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 91 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 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-08 10:03:36,015 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 91 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 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-08 10:03:36,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:36,016 INFO L93 Difference]: Finished difference Result 111 states and 144 transitions. [2022-04-08 10:03:36,016 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 144 transitions. [2022-04-08 10:03:36,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:36,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:36,017 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 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 111 states. [2022-04-08 10:03:36,017 INFO L87 Difference]: Start difference. First operand has 91 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 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 111 states. [2022-04-08 10:03:36,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:36,020 INFO L93 Difference]: Finished difference Result 111 states and 144 transitions. [2022-04-08 10:03:36,021 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 144 transitions. [2022-04-08 10:03:36,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:36,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:36,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:36,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:36,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 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-08 10:03:36,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 120 transitions. [2022-04-08 10:03:36,023 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 120 transitions. Word has length 23 [2022-04-08 10:03:36,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:36,023 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 120 transitions. [2022-04-08 10:03:36,023 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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-08 10:03:36,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 120 transitions. [2022-04-08 10:03:36,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:36,221 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 120 transitions. [2022-04-08 10:03:36,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 10:03:36,221 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:36,221 INFO L499 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:36,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-08 10:03:36,422 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:36,422 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:36,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:36,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1409778984, now seen corresponding path program 15 times [2022-04-08 10:03:36,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:36,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1112539895] [2022-04-08 10:03:36,425 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:36,425 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:36,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1409778984, now seen corresponding path program 16 times [2022-04-08 10:03:36,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:36,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500015782] [2022-04-08 10:03:36,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:36,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:36,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:36,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:36,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:36,571 INFO L290 TraceCheckUtils]: 0: Hoare triple {9671#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9656#true} is VALID [2022-04-08 10:03:36,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {9656#true} assume true; {9656#true} is VALID [2022-04-08 10:03:36,571 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9656#true} {9656#true} #72#return; {9656#true} is VALID [2022-04-08 10:03:36,572 INFO L272 TraceCheckUtils]: 0: Hoare triple {9656#true} call ULTIMATE.init(); {9671#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:36,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {9671#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9656#true} is VALID [2022-04-08 10:03:36,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {9656#true} assume true; {9656#true} is VALID [2022-04-08 10:03:36,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9656#true} {9656#true} #72#return; {9656#true} is VALID [2022-04-08 10:03:36,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {9656#true} call #t~ret13 := main(); {9656#true} is VALID [2022-04-08 10:03:36,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {9656#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9661#(= main_~y~0 0)} is VALID [2022-04-08 10:03:36,573 INFO L290 TraceCheckUtils]: 6: Hoare triple {9661#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9662#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:36,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {9662#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9663#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:36,574 INFO L290 TraceCheckUtils]: 8: Hoare triple {9663#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9664#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:36,574 INFO L290 TraceCheckUtils]: 9: Hoare triple {9664#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9665#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:36,575 INFO L290 TraceCheckUtils]: 10: Hoare triple {9665#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9666#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:36,575 INFO L290 TraceCheckUtils]: 11: Hoare triple {9666#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9667#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:36,576 INFO L290 TraceCheckUtils]: 12: Hoare triple {9667#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9668#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:36,577 INFO L290 TraceCheckUtils]: 13: Hoare triple {9668#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9669#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:36,577 INFO L290 TraceCheckUtils]: 14: Hoare triple {9669#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {9669#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:36,577 INFO L290 TraceCheckUtils]: 15: Hoare triple {9669#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {9670#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:03:36,578 INFO L290 TraceCheckUtils]: 16: Hoare triple {9670#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {9657#false} is VALID [2022-04-08 10:03:36,578 INFO L290 TraceCheckUtils]: 17: Hoare triple {9657#false} assume !(~y~0 % 4294967296 > 0); {9657#false} is VALID [2022-04-08 10:03:36,578 INFO L290 TraceCheckUtils]: 18: Hoare triple {9657#false} assume !(~x~0 % 4294967296 > 0); {9657#false} is VALID [2022-04-08 10:03:36,578 INFO L272 TraceCheckUtils]: 19: Hoare triple {9657#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9657#false} is VALID [2022-04-08 10:03:36,578 INFO L290 TraceCheckUtils]: 20: Hoare triple {9657#false} ~cond := #in~cond; {9657#false} is VALID [2022-04-08 10:03:36,578 INFO L290 TraceCheckUtils]: 21: Hoare triple {9657#false} assume 0 == ~cond; {9657#false} is VALID [2022-04-08 10:03:36,578 INFO L290 TraceCheckUtils]: 22: Hoare triple {9657#false} assume !false; {9657#false} is VALID [2022-04-08 10:03:36,578 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:36,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:36,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500015782] [2022-04-08 10:03:36,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500015782] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:36,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329284812] [2022-04-08 10:03:36,579 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:03:36,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:36,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:36,580 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:03:36,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-08 10:03:36,610 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:03:36,610 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:36,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 10:03:36,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:36,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:36,825 INFO L272 TraceCheckUtils]: 0: Hoare triple {9656#true} call ULTIMATE.init(); {9656#true} is VALID [2022-04-08 10:03:36,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {9656#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9656#true} is VALID [2022-04-08 10:03:36,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {9656#true} assume true; {9656#true} is VALID [2022-04-08 10:03:36,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9656#true} {9656#true} #72#return; {9656#true} is VALID [2022-04-08 10:03:36,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {9656#true} call #t~ret13 := main(); {9656#true} is VALID [2022-04-08 10:03:36,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {9656#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9661#(= main_~y~0 0)} is VALID [2022-04-08 10:03:36,826 INFO L290 TraceCheckUtils]: 6: Hoare triple {9661#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9662#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:36,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {9662#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9663#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:36,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {9663#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9664#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:36,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {9664#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9665#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:36,828 INFO L290 TraceCheckUtils]: 10: Hoare triple {9665#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9666#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:36,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {9666#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9667#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:36,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {9667#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9668#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:36,830 INFO L290 TraceCheckUtils]: 13: Hoare triple {9668#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9669#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:36,830 INFO L290 TraceCheckUtils]: 14: Hoare triple {9669#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {9669#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:36,830 INFO L290 TraceCheckUtils]: 15: Hoare triple {9669#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {9720#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:03:36,831 INFO L290 TraceCheckUtils]: 16: Hoare triple {9720#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {9657#false} is VALID [2022-04-08 10:03:36,831 INFO L290 TraceCheckUtils]: 17: Hoare triple {9657#false} assume !(~y~0 % 4294967296 > 0); {9657#false} is VALID [2022-04-08 10:03:36,831 INFO L290 TraceCheckUtils]: 18: Hoare triple {9657#false} assume !(~x~0 % 4294967296 > 0); {9657#false} is VALID [2022-04-08 10:03:36,831 INFO L272 TraceCheckUtils]: 19: Hoare triple {9657#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9657#false} is VALID [2022-04-08 10:03:36,831 INFO L290 TraceCheckUtils]: 20: Hoare triple {9657#false} ~cond := #in~cond; {9657#false} is VALID [2022-04-08 10:03:36,831 INFO L290 TraceCheckUtils]: 21: Hoare triple {9657#false} assume 0 == ~cond; {9657#false} is VALID [2022-04-08 10:03:36,831 INFO L290 TraceCheckUtils]: 22: Hoare triple {9657#false} assume !false; {9657#false} is VALID [2022-04-08 10:03:36,831 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:36,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:37,052 INFO L290 TraceCheckUtils]: 22: Hoare triple {9657#false} assume !false; {9657#false} is VALID [2022-04-08 10:03:37,053 INFO L290 TraceCheckUtils]: 21: Hoare triple {9657#false} assume 0 == ~cond; {9657#false} is VALID [2022-04-08 10:03:37,053 INFO L290 TraceCheckUtils]: 20: Hoare triple {9657#false} ~cond := #in~cond; {9657#false} is VALID [2022-04-08 10:03:37,053 INFO L272 TraceCheckUtils]: 19: Hoare triple {9657#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9657#false} is VALID [2022-04-08 10:03:37,053 INFO L290 TraceCheckUtils]: 18: Hoare triple {9657#false} assume !(~x~0 % 4294967296 > 0); {9657#false} is VALID [2022-04-08 10:03:37,053 INFO L290 TraceCheckUtils]: 17: Hoare triple {9657#false} assume !(~y~0 % 4294967296 > 0); {9657#false} is VALID [2022-04-08 10:03:37,053 INFO L290 TraceCheckUtils]: 16: Hoare triple {9760#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {9657#false} is VALID [2022-04-08 10:03:37,053 INFO L290 TraceCheckUtils]: 15: Hoare triple {9764#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {9760#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:03:37,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {9764#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {9764#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:37,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {9771#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9764#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:37,055 INFO L290 TraceCheckUtils]: 12: Hoare triple {9775#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9771#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:03:37,055 INFO L290 TraceCheckUtils]: 11: Hoare triple {9779#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9775#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:03:37,056 INFO L290 TraceCheckUtils]: 10: Hoare triple {9783#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9779#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:03:37,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {9787#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9783#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:03:37,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {9791#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9787#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:37,058 INFO L290 TraceCheckUtils]: 7: Hoare triple {9795#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9791#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:03:37,058 INFO L290 TraceCheckUtils]: 6: Hoare triple {9799#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {9795#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:37,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {9656#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9799#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:03:37,059 INFO L272 TraceCheckUtils]: 4: Hoare triple {9656#true} call #t~ret13 := main(); {9656#true} is VALID [2022-04-08 10:03:37,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9656#true} {9656#true} #72#return; {9656#true} is VALID [2022-04-08 10:03:37,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {9656#true} assume true; {9656#true} is VALID [2022-04-08 10:03:37,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {9656#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9656#true} is VALID [2022-04-08 10:03:37,059 INFO L272 TraceCheckUtils]: 0: Hoare triple {9656#true} call ULTIMATE.init(); {9656#true} is VALID [2022-04-08 10:03:37,059 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:37,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329284812] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:37,059 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:37,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-08 10:03:37,060 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:37,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1112539895] [2022-04-08 10:03:37,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1112539895] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:37,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:37,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 10:03:37,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367666841] [2022-04-08 10:03:37,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:37,060 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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 23 [2022-04-08 10:03:37,060 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:37,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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-08 10:03:37,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:37,075 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 10:03:37,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:37,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 10:03:37,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2022-04-08 10:03:37,075 INFO L87 Difference]: Start difference. First operand 91 states and 120 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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-08 10:03:38,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:38,795 INFO L93 Difference]: Finished difference Result 162 states and 236 transitions. [2022-04-08 10:03:38,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 10:03:38,795 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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 23 [2022-04-08 10:03:38,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:38,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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-08 10:03:38,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 111 transitions. [2022-04-08 10:03:38,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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-08 10:03:38,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 111 transitions. [2022-04-08 10:03:38,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 111 transitions. [2022-04-08 10:03:38,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:38,883 INFO L225 Difference]: With dead ends: 162 [2022-04-08 10:03:38,883 INFO L226 Difference]: Without dead ends: 148 [2022-04-08 10:03:38,883 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=260, Invalid=862, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 10:03:38,884 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 81 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:38,884 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 99 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 10:03:38,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-04-08 10:03:39,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 100. [2022-04-08 10:03:39,105 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:39,105 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand has 100 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 95 states have internal predecessors, (129), 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-08 10:03:39,105 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand has 100 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 95 states have internal predecessors, (129), 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-08 10:03:39,105 INFO L87 Difference]: Start difference. First operand 148 states. Second operand has 100 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 95 states have internal predecessors, (129), 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-08 10:03:39,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:39,107 INFO L93 Difference]: Finished difference Result 148 states and 190 transitions. [2022-04-08 10:03:39,107 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 190 transitions. [2022-04-08 10:03:39,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:39,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:39,108 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 95 states have internal predecessors, (129), 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 148 states. [2022-04-08 10:03:39,108 INFO L87 Difference]: Start difference. First operand has 100 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 95 states have internal predecessors, (129), 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 148 states. [2022-04-08 10:03:39,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:39,109 INFO L93 Difference]: Finished difference Result 148 states and 190 transitions. [2022-04-08 10:03:39,109 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 190 transitions. [2022-04-08 10:03:39,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:39,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:39,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:39,110 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:39,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 95 states have internal predecessors, (129), 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-08 10:03:39,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 133 transitions. [2022-04-08 10:03:39,111 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 133 transitions. Word has length 23 [2022-04-08 10:03:39,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:39,111 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 133 transitions. [2022-04-08 10:03:39,111 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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-08 10:03:39,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 133 transitions. [2022-04-08 10:03:39,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:39,308 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 133 transitions. [2022-04-08 10:03:39,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 10:03:39,308 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:39,308 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:39,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-08 10:03:39,524 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:39,525 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:39,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:39,525 INFO L85 PathProgramCache]: Analyzing trace with hash 25106720, now seen corresponding path program 11 times [2022-04-08 10:03:39,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:39,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1373346667] [2022-04-08 10:03:39,527 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:39,527 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:39,527 INFO L85 PathProgramCache]: Analyzing trace with hash 25106720, now seen corresponding path program 12 times [2022-04-08 10:03:39,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:39,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382656731] [2022-04-08 10:03:39,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:39,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:39,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:39,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:39,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:39,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {10668#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10660#true} is VALID [2022-04-08 10:03:39,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {10660#true} assume true; {10660#true} is VALID [2022-04-08 10:03:39,584 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10660#true} {10660#true} #72#return; {10660#true} is VALID [2022-04-08 10:03:39,584 INFO L272 TraceCheckUtils]: 0: Hoare triple {10660#true} call ULTIMATE.init(); {10668#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:39,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {10668#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10660#true} is VALID [2022-04-08 10:03:39,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {10660#true} assume true; {10660#true} is VALID [2022-04-08 10:03:39,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10660#true} {10660#true} #72#return; {10660#true} is VALID [2022-04-08 10:03:39,585 INFO L272 TraceCheckUtils]: 4: Hoare triple {10660#true} call #t~ret13 := main(); {10660#true} is VALID [2022-04-08 10:03:39,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {10660#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10660#true} is VALID [2022-04-08 10:03:39,585 INFO L290 TraceCheckUtils]: 6: Hoare triple {10660#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10660#true} is VALID [2022-04-08 10:03:39,585 INFO L290 TraceCheckUtils]: 7: Hoare triple {10660#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10660#true} is VALID [2022-04-08 10:03:39,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {10660#true} assume !(~x~0 % 4294967296 > 0); {10665#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:39,585 INFO L290 TraceCheckUtils]: 9: Hoare triple {10665#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {10665#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:39,586 INFO L290 TraceCheckUtils]: 10: Hoare triple {10665#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10666#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:03:39,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {10666#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:39,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:39,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:39,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:39,587 INFO L290 TraceCheckUtils]: 15: Hoare triple {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:39,588 INFO L290 TraceCheckUtils]: 16: Hoare triple {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10666#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:03:39,589 INFO L290 TraceCheckUtils]: 17: Hoare triple {10666#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10665#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:39,589 INFO L290 TraceCheckUtils]: 18: Hoare triple {10665#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10661#false} is VALID [2022-04-08 10:03:39,589 INFO L290 TraceCheckUtils]: 19: Hoare triple {10661#false} assume !(~x~0 % 4294967296 > 0); {10661#false} is VALID [2022-04-08 10:03:39,589 INFO L272 TraceCheckUtils]: 20: Hoare triple {10661#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10661#false} is VALID [2022-04-08 10:03:39,589 INFO L290 TraceCheckUtils]: 21: Hoare triple {10661#false} ~cond := #in~cond; {10661#false} is VALID [2022-04-08 10:03:39,589 INFO L290 TraceCheckUtils]: 22: Hoare triple {10661#false} assume 0 == ~cond; {10661#false} is VALID [2022-04-08 10:03:39,590 INFO L290 TraceCheckUtils]: 23: Hoare triple {10661#false} assume !false; {10661#false} is VALID [2022-04-08 10:03:39,590 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:03:39,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:39,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382656731] [2022-04-08 10:03:39,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382656731] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:39,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130571205] [2022-04-08 10:03:39,590 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:03:39,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:39,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:39,591 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:03:39,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-08 10:03:39,622 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:03:39,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:39,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 10:03:39,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:39,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:39,835 INFO L272 TraceCheckUtils]: 0: Hoare triple {10660#true} call ULTIMATE.init(); {10660#true} is VALID [2022-04-08 10:03:39,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {10660#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10660#true} is VALID [2022-04-08 10:03:39,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {10660#true} assume true; {10660#true} is VALID [2022-04-08 10:03:39,836 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10660#true} {10660#true} #72#return; {10660#true} is VALID [2022-04-08 10:03:39,836 INFO L272 TraceCheckUtils]: 4: Hoare triple {10660#true} call #t~ret13 := main(); {10660#true} is VALID [2022-04-08 10:03:39,836 INFO L290 TraceCheckUtils]: 5: Hoare triple {10660#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10660#true} is VALID [2022-04-08 10:03:39,836 INFO L290 TraceCheckUtils]: 6: Hoare triple {10660#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10660#true} is VALID [2022-04-08 10:03:39,836 INFO L290 TraceCheckUtils]: 7: Hoare triple {10660#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10660#true} is VALID [2022-04-08 10:03:39,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {10660#true} assume !(~x~0 % 4294967296 > 0); {10665#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:39,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {10665#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {10665#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:39,837 INFO L290 TraceCheckUtils]: 10: Hoare triple {10665#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10666#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:03:39,838 INFO L290 TraceCheckUtils]: 11: Hoare triple {10666#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:39,838 INFO L290 TraceCheckUtils]: 12: Hoare triple {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:39,839 INFO L290 TraceCheckUtils]: 13: Hoare triple {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:39,839 INFO L290 TraceCheckUtils]: 14: Hoare triple {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:39,839 INFO L290 TraceCheckUtils]: 15: Hoare triple {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:39,840 INFO L290 TraceCheckUtils]: 16: Hoare triple {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10666#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:03:39,841 INFO L290 TraceCheckUtils]: 17: Hoare triple {10666#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10665#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:39,841 INFO L290 TraceCheckUtils]: 18: Hoare triple {10665#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10661#false} is VALID [2022-04-08 10:03:39,841 INFO L290 TraceCheckUtils]: 19: Hoare triple {10661#false} assume !(~x~0 % 4294967296 > 0); {10661#false} is VALID [2022-04-08 10:03:39,841 INFO L272 TraceCheckUtils]: 20: Hoare triple {10661#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10661#false} is VALID [2022-04-08 10:03:39,841 INFO L290 TraceCheckUtils]: 21: Hoare triple {10661#false} ~cond := #in~cond; {10661#false} is VALID [2022-04-08 10:03:39,842 INFO L290 TraceCheckUtils]: 22: Hoare triple {10661#false} assume 0 == ~cond; {10661#false} is VALID [2022-04-08 10:03:39,842 INFO L290 TraceCheckUtils]: 23: Hoare triple {10661#false} assume !false; {10661#false} is VALID [2022-04-08 10:03:39,842 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:03:39,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:39,962 INFO L290 TraceCheckUtils]: 23: Hoare triple {10661#false} assume !false; {10661#false} is VALID [2022-04-08 10:03:39,963 INFO L290 TraceCheckUtils]: 22: Hoare triple {10661#false} assume 0 == ~cond; {10661#false} is VALID [2022-04-08 10:03:39,963 INFO L290 TraceCheckUtils]: 21: Hoare triple {10661#false} ~cond := #in~cond; {10661#false} is VALID [2022-04-08 10:03:39,963 INFO L272 TraceCheckUtils]: 20: Hoare triple {10661#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10661#false} is VALID [2022-04-08 10:03:39,963 INFO L290 TraceCheckUtils]: 19: Hoare triple {10661#false} assume !(~x~0 % 4294967296 > 0); {10661#false} is VALID [2022-04-08 10:03:39,963 INFO L290 TraceCheckUtils]: 18: Hoare triple {10665#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10661#false} is VALID [2022-04-08 10:03:39,964 INFO L290 TraceCheckUtils]: 17: Hoare triple {10666#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10665#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:39,964 INFO L290 TraceCheckUtils]: 16: Hoare triple {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10666#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:03:39,965 INFO L290 TraceCheckUtils]: 15: Hoare triple {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:39,965 INFO L290 TraceCheckUtils]: 14: Hoare triple {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:39,965 INFO L290 TraceCheckUtils]: 13: Hoare triple {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:39,965 INFO L290 TraceCheckUtils]: 12: Hoare triple {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:39,966 INFO L290 TraceCheckUtils]: 11: Hoare triple {10666#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10667#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:39,966 INFO L290 TraceCheckUtils]: 10: Hoare triple {10665#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10666#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:03:39,966 INFO L290 TraceCheckUtils]: 9: Hoare triple {10665#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {10665#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:39,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {10660#true} assume !(~x~0 % 4294967296 > 0); {10665#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:03:39,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {10660#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10660#true} is VALID [2022-04-08 10:03:39,967 INFO L290 TraceCheckUtils]: 6: Hoare triple {10660#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {10660#true} is VALID [2022-04-08 10:03:39,967 INFO L290 TraceCheckUtils]: 5: Hoare triple {10660#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10660#true} is VALID [2022-04-08 10:03:39,967 INFO L272 TraceCheckUtils]: 4: Hoare triple {10660#true} call #t~ret13 := main(); {10660#true} is VALID [2022-04-08 10:03:39,967 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10660#true} {10660#true} #72#return; {10660#true} is VALID [2022-04-08 10:03:39,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {10660#true} assume true; {10660#true} is VALID [2022-04-08 10:03:39,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {10660#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10660#true} is VALID [2022-04-08 10:03:39,967 INFO L272 TraceCheckUtils]: 0: Hoare triple {10660#true} call ULTIMATE.init(); {10660#true} is VALID [2022-04-08 10:03:39,967 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:03:39,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130571205] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:39,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:39,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2022-04-08 10:03:39,968 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:39,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1373346667] [2022-04-08 10:03:39,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1373346667] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:39,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:39,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:03:39,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868155967] [2022-04-08 10:03:39,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:39,968 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 24 [2022-04-08 10:03:39,968 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:39,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-08 10:03:39,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:39,979 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 10:03:39,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:39,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 10:03:39,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 10:03:39,980 INFO L87 Difference]: Start difference. First operand 100 states and 133 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-08 10:03:40,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:40,278 INFO L93 Difference]: Finished difference Result 109 states and 143 transitions. [2022-04-08 10:03:40,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 10:03:40,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 24 [2022-04-08 10:03:40,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:40,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-08 10:03:40,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-08 10:03:40,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-08 10:03:40,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-08 10:03:40,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2022-04-08 10:03:40,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:40,326 INFO L225 Difference]: With dead ends: 109 [2022-04-08 10:03:40,326 INFO L226 Difference]: Without dead ends: 93 [2022-04-08 10:03:40,327 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-08 10:03:40,327 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 24 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:40,327 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 40 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:03:40,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-08 10:03:40,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2022-04-08 10:03:40,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:40,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 91 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 86 states have internal predecessors, (119), 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-08 10:03:40,452 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 91 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 86 states have internal predecessors, (119), 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-08 10:03:40,453 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 91 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 86 states have internal predecessors, (119), 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-08 10:03:40,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:40,454 INFO L93 Difference]: Finished difference Result 93 states and 125 transitions. [2022-04-08 10:03:40,454 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 125 transitions. [2022-04-08 10:03:40,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:40,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:40,454 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 86 states have internal predecessors, (119), 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 93 states. [2022-04-08 10:03:40,454 INFO L87 Difference]: Start difference. First operand has 91 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 86 states have internal predecessors, (119), 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 93 states. [2022-04-08 10:03:40,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:40,455 INFO L93 Difference]: Finished difference Result 93 states and 125 transitions. [2022-04-08 10:03:40,455 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 125 transitions. [2022-04-08 10:03:40,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:40,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:40,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:40,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:40,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 86 states have internal predecessors, (119), 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-08 10:03:40,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 123 transitions. [2022-04-08 10:03:40,456 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 123 transitions. Word has length 24 [2022-04-08 10:03:40,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:40,456 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 123 transitions. [2022-04-08 10:03:40,456 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-08 10:03:40,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 123 transitions. [2022-04-08 10:03:40,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:40,646 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 123 transitions. [2022-04-08 10:03:40,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 10:03:40,646 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:40,646 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:40,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-08 10:03:40,846 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:40,847 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:40,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:40,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1347388208, now seen corresponding path program 9 times [2022-04-08 10:03:40,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:40,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [542312206] [2022-04-08 10:03:40,850 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:40,850 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:40,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1347388208, now seen corresponding path program 10 times [2022-04-08 10:03:40,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:40,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52836368] [2022-04-08 10:03:40,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:40,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:40,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:40,938 INFO L290 TraceCheckUtils]: 0: Hoare triple {11415#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11404#true} is VALID [2022-04-08 10:03:40,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {11404#true} assume true; {11404#true} is VALID [2022-04-08 10:03:40,938 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11404#true} {11404#true} #72#return; {11404#true} is VALID [2022-04-08 10:03:40,938 INFO L272 TraceCheckUtils]: 0: Hoare triple {11404#true} call ULTIMATE.init(); {11415#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:40,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {11415#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11404#true} is VALID [2022-04-08 10:03:40,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {11404#true} assume true; {11404#true} is VALID [2022-04-08 10:03:40,939 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11404#true} {11404#true} #72#return; {11404#true} is VALID [2022-04-08 10:03:40,939 INFO L272 TraceCheckUtils]: 4: Hoare triple {11404#true} call #t~ret13 := main(); {11404#true} is VALID [2022-04-08 10:03:40,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {11404#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11404#true} is VALID [2022-04-08 10:03:40,939 INFO L290 TraceCheckUtils]: 6: Hoare triple {11404#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11409#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:03:40,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {11409#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11410#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-08 10:03:40,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {11410#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11411#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:03:40,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {11411#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {11411#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:03:40,943 INFO L290 TraceCheckUtils]: 10: Hoare triple {11411#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} ~z~0 := ~y~0; {11411#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:03:40,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {11411#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11412#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-08 10:03:40,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {11412#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11413#(<= (+ 2 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:03:40,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {11413#(<= (+ 2 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11414#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:03:40,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {11414#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {11414#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:03:40,945 INFO L290 TraceCheckUtils]: 15: Hoare triple {11414#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11414#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:03:40,946 INFO L290 TraceCheckUtils]: 16: Hoare triple {11414#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11414#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:03:40,946 INFO L290 TraceCheckUtils]: 17: Hoare triple {11414#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11414#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:03:40,946 INFO L290 TraceCheckUtils]: 18: Hoare triple {11414#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {11414#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:03:40,947 INFO L290 TraceCheckUtils]: 19: Hoare triple {11414#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {11405#false} is VALID [2022-04-08 10:03:40,947 INFO L272 TraceCheckUtils]: 20: Hoare triple {11405#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11405#false} is VALID [2022-04-08 10:03:40,947 INFO L290 TraceCheckUtils]: 21: Hoare triple {11405#false} ~cond := #in~cond; {11405#false} is VALID [2022-04-08 10:03:40,947 INFO L290 TraceCheckUtils]: 22: Hoare triple {11405#false} assume 0 == ~cond; {11405#false} is VALID [2022-04-08 10:03:40,947 INFO L290 TraceCheckUtils]: 23: Hoare triple {11405#false} assume !false; {11405#false} is VALID [2022-04-08 10:03:40,947 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:03:40,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:40,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52836368] [2022-04-08 10:03:40,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52836368] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:40,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842431730] [2022-04-08 10:03:40,947 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:03:40,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:40,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:40,948 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:03:40,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-08 10:03:40,985 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:03:40,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:40,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-08 10:03:40,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:40,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:41,146 INFO L272 TraceCheckUtils]: 0: Hoare triple {11404#true} call ULTIMATE.init(); {11404#true} is VALID [2022-04-08 10:03:41,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {11404#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11404#true} is VALID [2022-04-08 10:03:41,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {11404#true} assume true; {11404#true} is VALID [2022-04-08 10:03:41,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11404#true} {11404#true} #72#return; {11404#true} is VALID [2022-04-08 10:03:41,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {11404#true} call #t~ret13 := main(); {11404#true} is VALID [2022-04-08 10:03:41,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {11404#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11404#true} is VALID [2022-04-08 10:03:41,147 INFO L290 TraceCheckUtils]: 6: Hoare triple {11404#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11409#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:03:41,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {11409#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11440#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:03:41,148 INFO L290 TraceCheckUtils]: 8: Hoare triple {11440#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11444#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:41,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {11444#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {11444#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:41,149 INFO L290 TraceCheckUtils]: 10: Hoare triple {11444#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} ~z~0 := ~y~0; {11444#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:41,149 INFO L290 TraceCheckUtils]: 11: Hoare triple {11444#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11440#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:03:41,150 INFO L290 TraceCheckUtils]: 12: Hoare triple {11440#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11409#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:03:41,150 INFO L290 TraceCheckUtils]: 13: Hoare triple {11409#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:41,150 INFO L290 TraceCheckUtils]: 14: Hoare triple {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:41,151 INFO L290 TraceCheckUtils]: 15: Hoare triple {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:41,151 INFO L290 TraceCheckUtils]: 16: Hoare triple {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:41,151 INFO L290 TraceCheckUtils]: 17: Hoare triple {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:41,151 INFO L290 TraceCheckUtils]: 18: Hoare triple {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:41,152 INFO L290 TraceCheckUtils]: 19: Hoare triple {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {11405#false} is VALID [2022-04-08 10:03:41,152 INFO L272 TraceCheckUtils]: 20: Hoare triple {11405#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11405#false} is VALID [2022-04-08 10:03:41,152 INFO L290 TraceCheckUtils]: 21: Hoare triple {11405#false} ~cond := #in~cond; {11405#false} is VALID [2022-04-08 10:03:41,152 INFO L290 TraceCheckUtils]: 22: Hoare triple {11405#false} assume 0 == ~cond; {11405#false} is VALID [2022-04-08 10:03:41,152 INFO L290 TraceCheckUtils]: 23: Hoare triple {11405#false} assume !false; {11405#false} is VALID [2022-04-08 10:03:41,152 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:03:41,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:41,245 INFO L290 TraceCheckUtils]: 23: Hoare triple {11405#false} assume !false; {11405#false} is VALID [2022-04-08 10:03:41,245 INFO L290 TraceCheckUtils]: 22: Hoare triple {11405#false} assume 0 == ~cond; {11405#false} is VALID [2022-04-08 10:03:41,245 INFO L290 TraceCheckUtils]: 21: Hoare triple {11405#false} ~cond := #in~cond; {11405#false} is VALID [2022-04-08 10:03:41,245 INFO L272 TraceCheckUtils]: 20: Hoare triple {11405#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11405#false} is VALID [2022-04-08 10:03:41,246 INFO L290 TraceCheckUtils]: 19: Hoare triple {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {11405#false} is VALID [2022-04-08 10:03:41,246 INFO L290 TraceCheckUtils]: 18: Hoare triple {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:41,246 INFO L290 TraceCheckUtils]: 17: Hoare triple {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:41,246 INFO L290 TraceCheckUtils]: 16: Hoare triple {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:41,246 INFO L290 TraceCheckUtils]: 15: Hoare triple {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:41,247 INFO L290 TraceCheckUtils]: 14: Hoare triple {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:41,247 INFO L290 TraceCheckUtils]: 13: Hoare triple {11409#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11460#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:41,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {11440#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11409#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:03:41,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {11444#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11440#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:03:41,249 INFO L290 TraceCheckUtils]: 10: Hoare triple {11444#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} ~z~0 := ~y~0; {11444#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:41,249 INFO L290 TraceCheckUtils]: 9: Hoare triple {11444#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {11444#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:41,250 INFO L290 TraceCheckUtils]: 8: Hoare triple {11440#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11444#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:03:41,250 INFO L290 TraceCheckUtils]: 7: Hoare triple {11409#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11440#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:03:41,251 INFO L290 TraceCheckUtils]: 6: Hoare triple {11404#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {11409#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:03:41,251 INFO L290 TraceCheckUtils]: 5: Hoare triple {11404#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11404#true} is VALID [2022-04-08 10:03:41,251 INFO L272 TraceCheckUtils]: 4: Hoare triple {11404#true} call #t~ret13 := main(); {11404#true} is VALID [2022-04-08 10:03:41,251 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11404#true} {11404#true} #72#return; {11404#true} is VALID [2022-04-08 10:03:41,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {11404#true} assume true; {11404#true} is VALID [2022-04-08 10:03:41,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {11404#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11404#true} is VALID [2022-04-08 10:03:41,251 INFO L272 TraceCheckUtils]: 0: Hoare triple {11404#true} call ULTIMATE.init(); {11404#true} is VALID [2022-04-08 10:03:41,251 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:03:41,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842431730] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:41,251 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:41,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 12 [2022-04-08 10:03:41,254 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:41,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [542312206] [2022-04-08 10:03:41,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [542312206] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:41,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:41,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 10:03:41,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595230263] [2022-04-08 10:03:41,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:41,254 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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 24 [2022-04-08 10:03:41,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:41,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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-08 10:03:41,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:41,268 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 10:03:41,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:41,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 10:03:41,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-08 10:03:41,269 INFO L87 Difference]: Start difference. First operand 91 states and 123 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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-08 10:03:41,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:41,712 INFO L93 Difference]: Finished difference Result 119 states and 164 transitions. [2022-04-08 10:03:41,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 10:03:41,716 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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 24 [2022-04-08 10:03:41,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:41,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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-08 10:03:41,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-08 10:03:41,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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-08 10:03:41,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 54 transitions. [2022-04-08 10:03:41,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 54 transitions. [2022-04-08 10:03:41,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:41,760 INFO L225 Difference]: With dead ends: 119 [2022-04-08 10:03:41,760 INFO L226 Difference]: Without dead ends: 114 [2022-04-08 10:03:41,761 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-04-08 10:03:41,761 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 43 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:41,761 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 46 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:03:41,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-04-08 10:03:41,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2022-04-08 10:03:41,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:41,939 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand has 111 states, 106 states have (on average 1.3867924528301887) internal successors, (147), 106 states have internal predecessors, (147), 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-08 10:03:41,939 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand has 111 states, 106 states have (on average 1.3867924528301887) internal successors, (147), 106 states have internal predecessors, (147), 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-08 10:03:41,939 INFO L87 Difference]: Start difference. First operand 114 states. Second operand has 111 states, 106 states have (on average 1.3867924528301887) internal successors, (147), 106 states have internal predecessors, (147), 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-08 10:03:41,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:41,941 INFO L93 Difference]: Finished difference Result 114 states and 157 transitions. [2022-04-08 10:03:41,941 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 157 transitions. [2022-04-08 10:03:41,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:41,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:41,941 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 106 states have (on average 1.3867924528301887) internal successors, (147), 106 states have internal predecessors, (147), 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 114 states. [2022-04-08 10:03:41,941 INFO L87 Difference]: Start difference. First operand has 111 states, 106 states have (on average 1.3867924528301887) internal successors, (147), 106 states have internal predecessors, (147), 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 114 states. [2022-04-08 10:03:41,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:41,942 INFO L93 Difference]: Finished difference Result 114 states and 157 transitions. [2022-04-08 10:03:41,942 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 157 transitions. [2022-04-08 10:03:41,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:41,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:41,943 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:41,943 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:41,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.3867924528301887) internal successors, (147), 106 states have internal predecessors, (147), 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-08 10:03:41,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 151 transitions. [2022-04-08 10:03:41,944 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 151 transitions. Word has length 24 [2022-04-08 10:03:41,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:41,944 INFO L478 AbstractCegarLoop]: Abstraction has 111 states and 151 transitions. [2022-04-08 10:03:41,944 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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-08 10:03:41,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 111 states and 151 transitions. [2022-04-08 10:03:42,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:42,203 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 151 transitions. [2022-04-08 10:03:42,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 10:03:42,203 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:42,203 INFO L499 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:42,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-08 10:03:42,418 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:42,418 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:42,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:42,419 INFO L85 PathProgramCache]: Analyzing trace with hash 283229409, now seen corresponding path program 17 times [2022-04-08 10:03:42,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:42,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [248321773] [2022-04-08 10:03:42,421 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:42,421 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:42,421 INFO L85 PathProgramCache]: Analyzing trace with hash 283229409, now seen corresponding path program 18 times [2022-04-08 10:03:42,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:42,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092233731] [2022-04-08 10:03:42,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:42,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:42,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:42,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:42,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {12278#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12262#true} is VALID [2022-04-08 10:03:42,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {12262#true} assume true; {12262#true} is VALID [2022-04-08 10:03:42,588 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12262#true} {12262#true} #72#return; {12262#true} is VALID [2022-04-08 10:03:42,588 INFO L272 TraceCheckUtils]: 0: Hoare triple {12262#true} call ULTIMATE.init(); {12278#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:42,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {12278#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12262#true} is VALID [2022-04-08 10:03:42,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {12262#true} assume true; {12262#true} is VALID [2022-04-08 10:03:42,589 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12262#true} {12262#true} #72#return; {12262#true} is VALID [2022-04-08 10:03:42,589 INFO L272 TraceCheckUtils]: 4: Hoare triple {12262#true} call #t~ret13 := main(); {12262#true} is VALID [2022-04-08 10:03:42,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {12262#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12267#(= main_~y~0 0)} is VALID [2022-04-08 10:03:42,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {12267#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12268#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:42,590 INFO L290 TraceCheckUtils]: 7: Hoare triple {12268#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12269#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:42,590 INFO L290 TraceCheckUtils]: 8: Hoare triple {12269#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12270#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:42,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {12270#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12271#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:42,591 INFO L290 TraceCheckUtils]: 10: Hoare triple {12271#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12272#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:42,592 INFO L290 TraceCheckUtils]: 11: Hoare triple {12272#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12273#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:42,592 INFO L290 TraceCheckUtils]: 12: Hoare triple {12273#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12274#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:42,593 INFO L290 TraceCheckUtils]: 13: Hoare triple {12274#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12275#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:42,593 INFO L290 TraceCheckUtils]: 14: Hoare triple {12275#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12276#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:03:42,593 INFO L290 TraceCheckUtils]: 15: Hoare triple {12276#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {12276#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:03:42,594 INFO L290 TraceCheckUtils]: 16: Hoare triple {12276#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {12277#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:03:42,594 INFO L290 TraceCheckUtils]: 17: Hoare triple {12277#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {12263#false} is VALID [2022-04-08 10:03:42,594 INFO L290 TraceCheckUtils]: 18: Hoare triple {12263#false} assume !(~y~0 % 4294967296 > 0); {12263#false} is VALID [2022-04-08 10:03:42,594 INFO L290 TraceCheckUtils]: 19: Hoare triple {12263#false} assume !(~x~0 % 4294967296 > 0); {12263#false} is VALID [2022-04-08 10:03:42,594 INFO L272 TraceCheckUtils]: 20: Hoare triple {12263#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12263#false} is VALID [2022-04-08 10:03:42,595 INFO L290 TraceCheckUtils]: 21: Hoare triple {12263#false} ~cond := #in~cond; {12263#false} is VALID [2022-04-08 10:03:42,595 INFO L290 TraceCheckUtils]: 22: Hoare triple {12263#false} assume 0 == ~cond; {12263#false} is VALID [2022-04-08 10:03:42,595 INFO L290 TraceCheckUtils]: 23: Hoare triple {12263#false} assume !false; {12263#false} is VALID [2022-04-08 10:03:42,595 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:42,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:42,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092233731] [2022-04-08 10:03:42,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092233731] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:42,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145929939] [2022-04-08 10:03:42,595 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:03:42,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:42,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:42,596 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:03:42,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-08 10:03:42,636 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-08 10:03:42,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:42,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 10:03:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:42,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:42,795 INFO L272 TraceCheckUtils]: 0: Hoare triple {12262#true} call ULTIMATE.init(); {12262#true} is VALID [2022-04-08 10:03:42,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {12262#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12262#true} is VALID [2022-04-08 10:03:42,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {12262#true} assume true; {12262#true} is VALID [2022-04-08 10:03:42,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12262#true} {12262#true} #72#return; {12262#true} is VALID [2022-04-08 10:03:42,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {12262#true} call #t~ret13 := main(); {12262#true} is VALID [2022-04-08 10:03:42,796 INFO L290 TraceCheckUtils]: 5: Hoare triple {12262#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12267#(= main_~y~0 0)} is VALID [2022-04-08 10:03:42,796 INFO L290 TraceCheckUtils]: 6: Hoare triple {12267#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12268#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:42,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {12268#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12269#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:42,797 INFO L290 TraceCheckUtils]: 8: Hoare triple {12269#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12270#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:42,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {12270#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12271#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:42,798 INFO L290 TraceCheckUtils]: 10: Hoare triple {12271#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12272#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:42,798 INFO L290 TraceCheckUtils]: 11: Hoare triple {12272#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12273#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:42,798 INFO L290 TraceCheckUtils]: 12: Hoare triple {12273#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12274#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:42,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {12274#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12275#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:42,799 INFO L290 TraceCheckUtils]: 14: Hoare triple {12275#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12276#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:03:42,799 INFO L290 TraceCheckUtils]: 15: Hoare triple {12276#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {12276#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:03:42,800 INFO L290 TraceCheckUtils]: 16: Hoare triple {12276#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {12330#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:03:42,800 INFO L290 TraceCheckUtils]: 17: Hoare triple {12330#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~z~0 % 4294967296 > 0); {12263#false} is VALID [2022-04-08 10:03:42,800 INFO L290 TraceCheckUtils]: 18: Hoare triple {12263#false} assume !(~y~0 % 4294967296 > 0); {12263#false} is VALID [2022-04-08 10:03:42,800 INFO L290 TraceCheckUtils]: 19: Hoare triple {12263#false} assume !(~x~0 % 4294967296 > 0); {12263#false} is VALID [2022-04-08 10:03:42,800 INFO L272 TraceCheckUtils]: 20: Hoare triple {12263#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12263#false} is VALID [2022-04-08 10:03:42,800 INFO L290 TraceCheckUtils]: 21: Hoare triple {12263#false} ~cond := #in~cond; {12263#false} is VALID [2022-04-08 10:03:42,800 INFO L290 TraceCheckUtils]: 22: Hoare triple {12263#false} assume 0 == ~cond; {12263#false} is VALID [2022-04-08 10:03:42,800 INFO L290 TraceCheckUtils]: 23: Hoare triple {12263#false} assume !false; {12263#false} is VALID [2022-04-08 10:03:42,800 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:42,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:43,000 INFO L290 TraceCheckUtils]: 23: Hoare triple {12263#false} assume !false; {12263#false} is VALID [2022-04-08 10:03:43,001 INFO L290 TraceCheckUtils]: 22: Hoare triple {12263#false} assume 0 == ~cond; {12263#false} is VALID [2022-04-08 10:03:43,001 INFO L290 TraceCheckUtils]: 21: Hoare triple {12263#false} ~cond := #in~cond; {12263#false} is VALID [2022-04-08 10:03:43,001 INFO L272 TraceCheckUtils]: 20: Hoare triple {12263#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12263#false} is VALID [2022-04-08 10:03:43,001 INFO L290 TraceCheckUtils]: 19: Hoare triple {12263#false} assume !(~x~0 % 4294967296 > 0); {12263#false} is VALID [2022-04-08 10:03:43,001 INFO L290 TraceCheckUtils]: 18: Hoare triple {12263#false} assume !(~y~0 % 4294967296 > 0); {12263#false} is VALID [2022-04-08 10:03:43,001 INFO L290 TraceCheckUtils]: 17: Hoare triple {12370#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {12263#false} is VALID [2022-04-08 10:03:43,001 INFO L290 TraceCheckUtils]: 16: Hoare triple {12374#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {12370#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:03:43,002 INFO L290 TraceCheckUtils]: 15: Hoare triple {12374#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {12374#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:43,002 INFO L290 TraceCheckUtils]: 14: Hoare triple {12381#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12374#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:43,003 INFO L290 TraceCheckUtils]: 13: Hoare triple {12385#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12381#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:03:43,003 INFO L290 TraceCheckUtils]: 12: Hoare triple {12389#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12385#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:03:43,004 INFO L290 TraceCheckUtils]: 11: Hoare triple {12393#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12389#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:03:43,027 INFO L290 TraceCheckUtils]: 10: Hoare triple {12397#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12393#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:03:43,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {12401#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12397#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:43,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {12405#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12401#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:03:43,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {12409#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12405#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:43,029 INFO L290 TraceCheckUtils]: 6: Hoare triple {12413#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {12409#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:03:43,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {12262#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12413#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:03:43,030 INFO L272 TraceCheckUtils]: 4: Hoare triple {12262#true} call #t~ret13 := main(); {12262#true} is VALID [2022-04-08 10:03:43,030 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12262#true} {12262#true} #72#return; {12262#true} is VALID [2022-04-08 10:03:43,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {12262#true} assume true; {12262#true} is VALID [2022-04-08 10:03:43,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {12262#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12262#true} is VALID [2022-04-08 10:03:43,030 INFO L272 TraceCheckUtils]: 0: Hoare triple {12262#true} call ULTIMATE.init(); {12262#true} is VALID [2022-04-08 10:03:43,030 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:43,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145929939] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:43,030 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:43,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-08 10:03:43,031 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:43,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [248321773] [2022-04-08 10:03:43,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [248321773] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:43,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:43,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 10:03:43,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587645392] [2022-04-08 10:03:43,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:43,031 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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 24 [2022-04-08 10:03:43,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:43,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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-08 10:03:43,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:43,044 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 10:03:43,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:43,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 10:03:43,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2022-04-08 10:03:43,044 INFO L87 Difference]: Start difference. First operand 111 states and 151 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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-08 10:03:44,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:44,884 INFO L93 Difference]: Finished difference Result 203 states and 304 transitions. [2022-04-08 10:03:44,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 10:03:44,884 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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 24 [2022-04-08 10:03:44,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:44,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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-08 10:03:44,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 117 transitions. [2022-04-08 10:03:44,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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-08 10:03:44,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 117 transitions. [2022-04-08 10:03:44,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 117 transitions. [2022-04-08 10:03:44,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:44,978 INFO L225 Difference]: With dead ends: 203 [2022-04-08 10:03:44,978 INFO L226 Difference]: Without dead ends: 186 [2022-04-08 10:03:44,979 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=307, Invalid=1025, Unknown=0, NotChecked=0, Total=1332 [2022-04-08 10:03:44,979 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 83 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:44,979 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 106 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 10:03:44,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-04-08 10:03:45,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 122. [2022-04-08 10:03:45,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:45,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand has 122 states, 117 states have (on average 1.393162393162393) internal successors, (163), 117 states have internal predecessors, (163), 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-08 10:03:45,300 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand has 122 states, 117 states have (on average 1.393162393162393) internal successors, (163), 117 states have internal predecessors, (163), 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-08 10:03:45,300 INFO L87 Difference]: Start difference. First operand 186 states. Second operand has 122 states, 117 states have (on average 1.393162393162393) internal successors, (163), 117 states have internal predecessors, (163), 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-08 10:03:45,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:45,302 INFO L93 Difference]: Finished difference Result 186 states and 241 transitions. [2022-04-08 10:03:45,302 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 241 transitions. [2022-04-08 10:03:45,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:45,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:45,303 INFO L74 IsIncluded]: Start isIncluded. First operand has 122 states, 117 states have (on average 1.393162393162393) internal successors, (163), 117 states have internal predecessors, (163), 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 186 states. [2022-04-08 10:03:45,303 INFO L87 Difference]: Start difference. First operand has 122 states, 117 states have (on average 1.393162393162393) internal successors, (163), 117 states have internal predecessors, (163), 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 186 states. [2022-04-08 10:03:45,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:45,305 INFO L93 Difference]: Finished difference Result 186 states and 241 transitions. [2022-04-08 10:03:45,305 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 241 transitions. [2022-04-08 10:03:45,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:45,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:45,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:45,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:45,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 117 states have (on average 1.393162393162393) internal successors, (163), 117 states have internal predecessors, (163), 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-08 10:03:45,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 167 transitions. [2022-04-08 10:03:45,307 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 167 transitions. Word has length 24 [2022-04-08 10:03:45,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:45,307 INFO L478 AbstractCegarLoop]: Abstraction has 122 states and 167 transitions. [2022-04-08 10:03:45,307 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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-08 10:03:45,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 122 states and 167 transitions. [2022-04-08 10:03:45,659 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:45,659 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 167 transitions. [2022-04-08 10:03:45,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 10:03:45,659 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:45,660 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:45,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-08 10:03:45,860 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-04-08 10:03:45,860 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:45,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:45,860 INFO L85 PathProgramCache]: Analyzing trace with hash 467119846, now seen corresponding path program 13 times [2022-04-08 10:03:45,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:45,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [49532974] [2022-04-08 10:03:45,862 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:45,862 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:45,862 INFO L85 PathProgramCache]: Analyzing trace with hash 467119846, now seen corresponding path program 14 times [2022-04-08 10:03:45,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:45,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388714500] [2022-04-08 10:03:45,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:45,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:45,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:45,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:45,941 INFO L290 TraceCheckUtils]: 0: Hoare triple {13490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13478#true} is VALID [2022-04-08 10:03:45,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {13478#true} assume true; {13478#true} is VALID [2022-04-08 10:03:45,942 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13478#true} {13478#true} #72#return; {13478#true} is VALID [2022-04-08 10:03:45,942 INFO L272 TraceCheckUtils]: 0: Hoare triple {13478#true} call ULTIMATE.init(); {13490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:45,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {13490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13478#true} is VALID [2022-04-08 10:03:45,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {13478#true} assume true; {13478#true} is VALID [2022-04-08 10:03:45,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13478#true} {13478#true} #72#return; {13478#true} is VALID [2022-04-08 10:03:45,942 INFO L272 TraceCheckUtils]: 4: Hoare triple {13478#true} call #t~ret13 := main(); {13478#true} is VALID [2022-04-08 10:03:45,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {13478#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13483#(= main_~y~0 0)} is VALID [2022-04-08 10:03:45,943 INFO L290 TraceCheckUtils]: 6: Hoare triple {13483#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13484#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:45,943 INFO L290 TraceCheckUtils]: 7: Hoare triple {13484#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13485#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:45,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {13485#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13486#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:45,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {13486#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {13486#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:45,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {13486#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {13487#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:03:45,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {13487#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13488#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:03:45,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {13488#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13489#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-08 10:03:45,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {13489#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {13479#false} is VALID [2022-04-08 10:03:45,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {13479#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13479#false} is VALID [2022-04-08 10:03:45,945 INFO L290 TraceCheckUtils]: 15: Hoare triple {13479#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13479#false} is VALID [2022-04-08 10:03:45,945 INFO L290 TraceCheckUtils]: 16: Hoare triple {13479#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13479#false} is VALID [2022-04-08 10:03:45,945 INFO L290 TraceCheckUtils]: 17: Hoare triple {13479#false} assume !(~y~0 % 4294967296 > 0); {13479#false} is VALID [2022-04-08 10:03:45,945 INFO L290 TraceCheckUtils]: 18: Hoare triple {13479#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {13479#false} is VALID [2022-04-08 10:03:45,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {13479#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {13479#false} is VALID [2022-04-08 10:03:45,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {13479#false} assume !(~x~0 % 4294967296 > 0); {13479#false} is VALID [2022-04-08 10:03:45,946 INFO L272 TraceCheckUtils]: 21: Hoare triple {13479#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13479#false} is VALID [2022-04-08 10:03:45,946 INFO L290 TraceCheckUtils]: 22: Hoare triple {13479#false} ~cond := #in~cond; {13479#false} is VALID [2022-04-08 10:03:45,946 INFO L290 TraceCheckUtils]: 23: Hoare triple {13479#false} assume 0 == ~cond; {13479#false} is VALID [2022-04-08 10:03:45,946 INFO L290 TraceCheckUtils]: 24: Hoare triple {13479#false} assume !false; {13479#false} is VALID [2022-04-08 10:03:45,946 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-08 10:03:45,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:45,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388714500] [2022-04-08 10:03:45,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388714500] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:45,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274292291] [2022-04-08 10:03:45,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:03:45,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:45,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:45,955 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:03:45,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-08 10:03:45,996 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:03:45,996 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:45,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-08 10:03:46,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:46,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:46,077 INFO L272 TraceCheckUtils]: 0: Hoare triple {13478#true} call ULTIMATE.init(); {13478#true} is VALID [2022-04-08 10:03:46,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {13478#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13478#true} is VALID [2022-04-08 10:03:46,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {13478#true} assume true; {13478#true} is VALID [2022-04-08 10:03:46,078 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13478#true} {13478#true} #72#return; {13478#true} is VALID [2022-04-08 10:03:46,078 INFO L272 TraceCheckUtils]: 4: Hoare triple {13478#true} call #t~ret13 := main(); {13478#true} is VALID [2022-04-08 10:03:46,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {13478#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13483#(= main_~y~0 0)} is VALID [2022-04-08 10:03:46,078 INFO L290 TraceCheckUtils]: 6: Hoare triple {13483#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13484#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:46,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {13484#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13485#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:46,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {13485#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13486#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:46,079 INFO L290 TraceCheckUtils]: 9: Hoare triple {13486#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {13486#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:46,079 INFO L290 TraceCheckUtils]: 10: Hoare triple {13486#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {13524#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:46,080 INFO L290 TraceCheckUtils]: 11: Hoare triple {13524#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13528#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:03:46,080 INFO L290 TraceCheckUtils]: 12: Hoare triple {13528#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13532#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:03:46,080 INFO L290 TraceCheckUtils]: 13: Hoare triple {13532#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} assume !(~z~0 % 4294967296 > 0); {13479#false} is VALID [2022-04-08 10:03:46,081 INFO L290 TraceCheckUtils]: 14: Hoare triple {13479#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13479#false} is VALID [2022-04-08 10:03:46,081 INFO L290 TraceCheckUtils]: 15: Hoare triple {13479#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13479#false} is VALID [2022-04-08 10:03:46,081 INFO L290 TraceCheckUtils]: 16: Hoare triple {13479#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13479#false} is VALID [2022-04-08 10:03:46,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {13479#false} assume !(~y~0 % 4294967296 > 0); {13479#false} is VALID [2022-04-08 10:03:46,081 INFO L290 TraceCheckUtils]: 18: Hoare triple {13479#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {13479#false} is VALID [2022-04-08 10:03:46,081 INFO L290 TraceCheckUtils]: 19: Hoare triple {13479#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {13479#false} is VALID [2022-04-08 10:03:46,081 INFO L290 TraceCheckUtils]: 20: Hoare triple {13479#false} assume !(~x~0 % 4294967296 > 0); {13479#false} is VALID [2022-04-08 10:03:46,081 INFO L272 TraceCheckUtils]: 21: Hoare triple {13479#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13479#false} is VALID [2022-04-08 10:03:46,081 INFO L290 TraceCheckUtils]: 22: Hoare triple {13479#false} ~cond := #in~cond; {13479#false} is VALID [2022-04-08 10:03:46,081 INFO L290 TraceCheckUtils]: 23: Hoare triple {13479#false} assume 0 == ~cond; {13479#false} is VALID [2022-04-08 10:03:46,081 INFO L290 TraceCheckUtils]: 24: Hoare triple {13479#false} assume !false; {13479#false} is VALID [2022-04-08 10:03:46,081 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-08 10:03:46,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:46,200 INFO L290 TraceCheckUtils]: 24: Hoare triple {13479#false} assume !false; {13479#false} is VALID [2022-04-08 10:03:46,200 INFO L290 TraceCheckUtils]: 23: Hoare triple {13479#false} assume 0 == ~cond; {13479#false} is VALID [2022-04-08 10:03:46,200 INFO L290 TraceCheckUtils]: 22: Hoare triple {13479#false} ~cond := #in~cond; {13479#false} is VALID [2022-04-08 10:03:46,200 INFO L272 TraceCheckUtils]: 21: Hoare triple {13479#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13479#false} is VALID [2022-04-08 10:03:46,200 INFO L290 TraceCheckUtils]: 20: Hoare triple {13479#false} assume !(~x~0 % 4294967296 > 0); {13479#false} is VALID [2022-04-08 10:03:46,200 INFO L290 TraceCheckUtils]: 19: Hoare triple {13479#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {13479#false} is VALID [2022-04-08 10:03:46,200 INFO L290 TraceCheckUtils]: 18: Hoare triple {13479#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {13479#false} is VALID [2022-04-08 10:03:46,200 INFO L290 TraceCheckUtils]: 17: Hoare triple {13479#false} assume !(~y~0 % 4294967296 > 0); {13479#false} is VALID [2022-04-08 10:03:46,201 INFO L290 TraceCheckUtils]: 16: Hoare triple {13593#(<= (mod main_~y~0 4294967296) 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13479#false} is VALID [2022-04-08 10:03:46,201 INFO L290 TraceCheckUtils]: 15: Hoare triple {13597#(<= (mod (+ main_~y~0 4294967295) 4294967296) 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13593#(<= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-08 10:03:46,202 INFO L290 TraceCheckUtils]: 14: Hoare triple {13601#(<= (mod (+ main_~y~0 4294967294) 4294967296) 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13597#(<= (mod (+ main_~y~0 4294967295) 4294967296) 0)} is VALID [2022-04-08 10:03:46,202 INFO L290 TraceCheckUtils]: 13: Hoare triple {13605#(or (< 0 (mod main_~z~0 4294967296)) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {13601#(<= (mod (+ main_~y~0 4294967294) 4294967296) 0)} is VALID [2022-04-08 10:03:46,203 INFO L290 TraceCheckUtils]: 12: Hoare triple {13609#(or (<= (mod (+ main_~y~0 4294967294) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13605#(or (< 0 (mod main_~z~0 4294967296)) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-08 10:03:46,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {13613#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13609#(or (<= (mod (+ main_~y~0 4294967294) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:03:46,203 INFO L290 TraceCheckUtils]: 10: Hoare triple {13478#true} ~z~0 := ~y~0; {13613#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-08 10:03:46,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {13478#true} assume !(~x~0 % 4294967296 > 0); {13478#true} is VALID [2022-04-08 10:03:46,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {13478#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13478#true} is VALID [2022-04-08 10:03:46,204 INFO L290 TraceCheckUtils]: 7: Hoare triple {13478#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13478#true} is VALID [2022-04-08 10:03:46,204 INFO L290 TraceCheckUtils]: 6: Hoare triple {13478#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {13478#true} is VALID [2022-04-08 10:03:46,204 INFO L290 TraceCheckUtils]: 5: Hoare triple {13478#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13478#true} is VALID [2022-04-08 10:03:46,204 INFO L272 TraceCheckUtils]: 4: Hoare triple {13478#true} call #t~ret13 := main(); {13478#true} is VALID [2022-04-08 10:03:46,204 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13478#true} {13478#true} #72#return; {13478#true} is VALID [2022-04-08 10:03:46,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {13478#true} assume true; {13478#true} is VALID [2022-04-08 10:03:46,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {13478#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13478#true} is VALID [2022-04-08 10:03:46,204 INFO L272 TraceCheckUtils]: 0: Hoare triple {13478#true} call ULTIMATE.init(); {13478#true} is VALID [2022-04-08 10:03:46,204 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-08 10:03:46,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274292291] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:46,204 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:46,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 19 [2022-04-08 10:03:46,205 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:46,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [49532974] [2022-04-08 10:03:46,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [49532974] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:46,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:46,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 10:03:46,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736426880] [2022-04-08 10:03:46,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:46,206 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 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 25 [2022-04-08 10:03:46,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:46,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 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-08 10:03:46,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:46,215 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 10:03:46,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:46,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 10:03:46,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-04-08 10:03:46,215 INFO L87 Difference]: Start difference. First operand 122 states and 167 transitions. Second operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 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-08 10:03:46,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:46,785 INFO L93 Difference]: Finished difference Result 153 states and 201 transitions. [2022-04-08 10:03:46,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 10:03:46,785 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 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 25 [2022-04-08 10:03:46,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:46,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 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-08 10:03:46,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 55 transitions. [2022-04-08 10:03:46,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 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-08 10:03:46,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 55 transitions. [2022-04-08 10:03:46,789 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 55 transitions. [2022-04-08 10:03:46,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:46,816 INFO L225 Difference]: With dead ends: 153 [2022-04-08 10:03:46,816 INFO L226 Difference]: Without dead ends: 141 [2022-04-08 10:03:46,818 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2022-04-08 10:03:46,819 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 25 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:46,819 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 53 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:03:46,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-04-08 10:03:47,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 122. [2022-04-08 10:03:47,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:47,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand has 122 states, 117 states have (on average 1.3846153846153846) internal successors, (162), 117 states have internal predecessors, (162), 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-08 10:03:47,021 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand has 122 states, 117 states have (on average 1.3846153846153846) internal successors, (162), 117 states have internal predecessors, (162), 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-08 10:03:47,021 INFO L87 Difference]: Start difference. First operand 141 states. Second operand has 122 states, 117 states have (on average 1.3846153846153846) internal successors, (162), 117 states have internal predecessors, (162), 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-08 10:03:47,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:47,049 INFO L93 Difference]: Finished difference Result 141 states and 189 transitions. [2022-04-08 10:03:47,049 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 189 transitions. [2022-04-08 10:03:47,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:47,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:47,049 INFO L74 IsIncluded]: Start isIncluded. First operand has 122 states, 117 states have (on average 1.3846153846153846) internal successors, (162), 117 states have internal predecessors, (162), 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 141 states. [2022-04-08 10:03:47,050 INFO L87 Difference]: Start difference. First operand has 122 states, 117 states have (on average 1.3846153846153846) internal successors, (162), 117 states have internal predecessors, (162), 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 141 states. [2022-04-08 10:03:47,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:47,052 INFO L93 Difference]: Finished difference Result 141 states and 189 transitions. [2022-04-08 10:03:47,052 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 189 transitions. [2022-04-08 10:03:47,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:47,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:47,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:47,052 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:47,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 117 states have (on average 1.3846153846153846) internal successors, (162), 117 states have internal predecessors, (162), 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-08 10:03:47,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 166 transitions. [2022-04-08 10:03:47,054 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 166 transitions. Word has length 25 [2022-04-08 10:03:47,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:47,055 INFO L478 AbstractCegarLoop]: Abstraction has 122 states and 166 transitions. [2022-04-08 10:03:47,055 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 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-08 10:03:47,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 122 states and 166 transitions. [2022-04-08 10:03:47,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:47,408 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 166 transitions. [2022-04-08 10:03:47,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 10:03:47,408 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:47,409 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:47,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-08 10:03:47,609 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-04-08 10:03:47,609 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:47,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:47,609 INFO L85 PathProgramCache]: Analyzing trace with hash -782542170, now seen corresponding path program 11 times [2022-04-08 10:03:47,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:47,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1815080779] [2022-04-08 10:03:47,612 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:47,612 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:47,612 INFO L85 PathProgramCache]: Analyzing trace with hash -782542170, now seen corresponding path program 12 times [2022-04-08 10:03:47,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:47,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403597315] [2022-04-08 10:03:47,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:47,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:47,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:47,687 INFO L290 TraceCheckUtils]: 0: Hoare triple {14508#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14495#true} is VALID [2022-04-08 10:03:47,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {14495#true} assume true; {14495#true} is VALID [2022-04-08 10:03:47,687 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14495#true} {14495#true} #72#return; {14495#true} is VALID [2022-04-08 10:03:47,688 INFO L272 TraceCheckUtils]: 0: Hoare triple {14495#true} call ULTIMATE.init(); {14508#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:47,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {14508#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14495#true} is VALID [2022-04-08 10:03:47,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {14495#true} assume true; {14495#true} is VALID [2022-04-08 10:03:47,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14495#true} {14495#true} #72#return; {14495#true} is VALID [2022-04-08 10:03:47,688 INFO L272 TraceCheckUtils]: 4: Hoare triple {14495#true} call #t~ret13 := main(); {14495#true} is VALID [2022-04-08 10:03:47,688 INFO L290 TraceCheckUtils]: 5: Hoare triple {14495#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14500#(= main_~y~0 0)} is VALID [2022-04-08 10:03:47,688 INFO L290 TraceCheckUtils]: 6: Hoare triple {14500#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14501#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:47,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {14501#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14502#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:47,689 INFO L290 TraceCheckUtils]: 8: Hoare triple {14502#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14503#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:47,689 INFO L290 TraceCheckUtils]: 9: Hoare triple {14503#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {14503#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:47,690 INFO L290 TraceCheckUtils]: 10: Hoare triple {14503#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {14504#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:03:47,690 INFO L290 TraceCheckUtils]: 11: Hoare triple {14504#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14505#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:03:47,690 INFO L290 TraceCheckUtils]: 12: Hoare triple {14505#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14506#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:03:47,691 INFO L290 TraceCheckUtils]: 13: Hoare triple {14506#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14507#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:03:47,691 INFO L290 TraceCheckUtils]: 14: Hoare triple {14507#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14496#false} is VALID [2022-04-08 10:03:47,691 INFO L290 TraceCheckUtils]: 15: Hoare triple {14496#false} assume !(~z~0 % 4294967296 > 0); {14496#false} is VALID [2022-04-08 10:03:47,691 INFO L290 TraceCheckUtils]: 16: Hoare triple {14496#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14496#false} is VALID [2022-04-08 10:03:47,691 INFO L290 TraceCheckUtils]: 17: Hoare triple {14496#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14496#false} is VALID [2022-04-08 10:03:47,691 INFO L290 TraceCheckUtils]: 18: Hoare triple {14496#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14496#false} is VALID [2022-04-08 10:03:47,691 INFO L290 TraceCheckUtils]: 19: Hoare triple {14496#false} assume !(~y~0 % 4294967296 > 0); {14496#false} is VALID [2022-04-08 10:03:47,691 INFO L290 TraceCheckUtils]: 20: Hoare triple {14496#false} assume !(~x~0 % 4294967296 > 0); {14496#false} is VALID [2022-04-08 10:03:47,692 INFO L272 TraceCheckUtils]: 21: Hoare triple {14496#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14496#false} is VALID [2022-04-08 10:03:47,692 INFO L290 TraceCheckUtils]: 22: Hoare triple {14496#false} ~cond := #in~cond; {14496#false} is VALID [2022-04-08 10:03:47,692 INFO L290 TraceCheckUtils]: 23: Hoare triple {14496#false} assume 0 == ~cond; {14496#false} is VALID [2022-04-08 10:03:47,692 INFO L290 TraceCheckUtils]: 24: Hoare triple {14496#false} assume !false; {14496#false} is VALID [2022-04-08 10:03:47,692 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:03:47,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:47,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403597315] [2022-04-08 10:03:47,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403597315] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:47,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439800883] [2022-04-08 10:03:47,692 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:03:47,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:47,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:47,693 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:03:47,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-08 10:03:47,729 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:03:47,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:47,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 10:03:47,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:47,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:47,885 INFO L272 TraceCheckUtils]: 0: Hoare triple {14495#true} call ULTIMATE.init(); {14495#true} is VALID [2022-04-08 10:03:47,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {14495#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14495#true} is VALID [2022-04-08 10:03:47,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {14495#true} assume true; {14495#true} is VALID [2022-04-08 10:03:47,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14495#true} {14495#true} #72#return; {14495#true} is VALID [2022-04-08 10:03:47,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {14495#true} call #t~ret13 := main(); {14495#true} is VALID [2022-04-08 10:03:47,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {14495#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14500#(= main_~y~0 0)} is VALID [2022-04-08 10:03:47,887 INFO L290 TraceCheckUtils]: 6: Hoare triple {14500#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14501#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:47,887 INFO L290 TraceCheckUtils]: 7: Hoare triple {14501#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14502#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:47,888 INFO L290 TraceCheckUtils]: 8: Hoare triple {14502#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14503#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:47,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {14503#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {14503#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:47,888 INFO L290 TraceCheckUtils]: 10: Hoare triple {14503#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {14542#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:47,889 INFO L290 TraceCheckUtils]: 11: Hoare triple {14542#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14546#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:03:47,889 INFO L290 TraceCheckUtils]: 12: Hoare triple {14546#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14550#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:03:47,890 INFO L290 TraceCheckUtils]: 13: Hoare triple {14550#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14554#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:47,890 INFO L290 TraceCheckUtils]: 14: Hoare triple {14554#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14496#false} is VALID [2022-04-08 10:03:47,891 INFO L290 TraceCheckUtils]: 15: Hoare triple {14496#false} assume !(~z~0 % 4294967296 > 0); {14496#false} is VALID [2022-04-08 10:03:47,891 INFO L290 TraceCheckUtils]: 16: Hoare triple {14496#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14496#false} is VALID [2022-04-08 10:03:47,891 INFO L290 TraceCheckUtils]: 17: Hoare triple {14496#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14496#false} is VALID [2022-04-08 10:03:47,891 INFO L290 TraceCheckUtils]: 18: Hoare triple {14496#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14496#false} is VALID [2022-04-08 10:03:47,891 INFO L290 TraceCheckUtils]: 19: Hoare triple {14496#false} assume !(~y~0 % 4294967296 > 0); {14496#false} is VALID [2022-04-08 10:03:47,891 INFO L290 TraceCheckUtils]: 20: Hoare triple {14496#false} assume !(~x~0 % 4294967296 > 0); {14496#false} is VALID [2022-04-08 10:03:47,891 INFO L272 TraceCheckUtils]: 21: Hoare triple {14496#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14496#false} is VALID [2022-04-08 10:03:47,891 INFO L290 TraceCheckUtils]: 22: Hoare triple {14496#false} ~cond := #in~cond; {14496#false} is VALID [2022-04-08 10:03:47,891 INFO L290 TraceCheckUtils]: 23: Hoare triple {14496#false} assume 0 == ~cond; {14496#false} is VALID [2022-04-08 10:03:47,891 INFO L290 TraceCheckUtils]: 24: Hoare triple {14496#false} assume !false; {14496#false} is VALID [2022-04-08 10:03:47,891 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:03:47,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:48,090 INFO L290 TraceCheckUtils]: 24: Hoare triple {14496#false} assume !false; {14496#false} is VALID [2022-04-08 10:03:48,091 INFO L290 TraceCheckUtils]: 23: Hoare triple {14496#false} assume 0 == ~cond; {14496#false} is VALID [2022-04-08 10:03:48,091 INFO L290 TraceCheckUtils]: 22: Hoare triple {14496#false} ~cond := #in~cond; {14496#false} is VALID [2022-04-08 10:03:48,091 INFO L272 TraceCheckUtils]: 21: Hoare triple {14496#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14496#false} is VALID [2022-04-08 10:03:48,091 INFO L290 TraceCheckUtils]: 20: Hoare triple {14496#false} assume !(~x~0 % 4294967296 > 0); {14496#false} is VALID [2022-04-08 10:03:48,091 INFO L290 TraceCheckUtils]: 19: Hoare triple {14603#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {14496#false} is VALID [2022-04-08 10:03:48,092 INFO L290 TraceCheckUtils]: 18: Hoare triple {14607#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14603#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:48,093 INFO L290 TraceCheckUtils]: 17: Hoare triple {14611#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14607#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:03:48,093 INFO L290 TraceCheckUtils]: 16: Hoare triple {14615#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14611#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:03:48,094 INFO L290 TraceCheckUtils]: 15: Hoare triple {14615#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~z~0 % 4294967296 > 0); {14615#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:03:48,094 INFO L290 TraceCheckUtils]: 14: Hoare triple {14622#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14615#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:03:48,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {14626#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14622#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:03:48,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {14630#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14626#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:03:48,097 INFO L290 TraceCheckUtils]: 11: Hoare triple {14634#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14630#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:03:48,097 INFO L290 TraceCheckUtils]: 10: Hoare triple {14495#true} ~z~0 := ~y~0; {14634#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:03:48,098 INFO L290 TraceCheckUtils]: 9: Hoare triple {14495#true} assume !(~x~0 % 4294967296 > 0); {14495#true} is VALID [2022-04-08 10:03:48,098 INFO L290 TraceCheckUtils]: 8: Hoare triple {14495#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14495#true} is VALID [2022-04-08 10:03:48,098 INFO L290 TraceCheckUtils]: 7: Hoare triple {14495#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14495#true} is VALID [2022-04-08 10:03:48,098 INFO L290 TraceCheckUtils]: 6: Hoare triple {14495#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {14495#true} is VALID [2022-04-08 10:03:48,098 INFO L290 TraceCheckUtils]: 5: Hoare triple {14495#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14495#true} is VALID [2022-04-08 10:03:48,098 INFO L272 TraceCheckUtils]: 4: Hoare triple {14495#true} call #t~ret13 := main(); {14495#true} is VALID [2022-04-08 10:03:48,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14495#true} {14495#true} #72#return; {14495#true} is VALID [2022-04-08 10:03:48,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {14495#true} assume true; {14495#true} is VALID [2022-04-08 10:03:48,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {14495#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14495#true} is VALID [2022-04-08 10:03:48,098 INFO L272 TraceCheckUtils]: 0: Hoare triple {14495#true} call ULTIMATE.init(); {14495#true} is VALID [2022-04-08 10:03:48,098 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:03:48,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439800883] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:48,098 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:48,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 23 [2022-04-08 10:03:48,098 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:48,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1815080779] [2022-04-08 10:03:48,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1815080779] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:48,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:48,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 10:03:48,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112582545] [2022-04-08 10:03:48,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:48,099 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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 25 [2022-04-08 10:03:48,099 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:48,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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-08 10:03:48,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:48,114 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 10:03:48,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:48,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 10:03:48,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2022-04-08 10:03:48,115 INFO L87 Difference]: Start difference. First operand 122 states and 166 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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-08 10:03:48,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:48,990 INFO L93 Difference]: Finished difference Result 143 states and 189 transitions. [2022-04-08 10:03:48,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 10:03:48,991 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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 25 [2022-04-08 10:03:48,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:48,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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-08 10:03:48,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 53 transitions. [2022-04-08 10:03:48,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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-08 10:03:48,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 53 transitions. [2022-04-08 10:03:48,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 53 transitions. [2022-04-08 10:03:49,027 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:49,028 INFO L225 Difference]: With dead ends: 143 [2022-04-08 10:03:49,028 INFO L226 Difference]: Without dead ends: 132 [2022-04-08 10:03:49,028 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-04-08 10:03:49,028 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 25 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:49,029 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 58 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:03:49,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-08 10:03:49,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 121. [2022-04-08 10:03:49,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:49,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 121 states, 116 states have (on average 1.3706896551724137) internal successors, (159), 116 states have internal predecessors, (159), 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-08 10:03:49,247 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 121 states, 116 states have (on average 1.3706896551724137) internal successors, (159), 116 states have internal predecessors, (159), 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-08 10:03:49,247 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 121 states, 116 states have (on average 1.3706896551724137) internal successors, (159), 116 states have internal predecessors, (159), 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-08 10:03:49,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:49,248 INFO L93 Difference]: Finished difference Result 132 states and 176 transitions. [2022-04-08 10:03:49,248 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 176 transitions. [2022-04-08 10:03:49,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:49,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:49,249 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 116 states have (on average 1.3706896551724137) internal successors, (159), 116 states have internal predecessors, (159), 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 132 states. [2022-04-08 10:03:49,249 INFO L87 Difference]: Start difference. First operand has 121 states, 116 states have (on average 1.3706896551724137) internal successors, (159), 116 states have internal predecessors, (159), 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 132 states. [2022-04-08 10:03:49,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:49,250 INFO L93 Difference]: Finished difference Result 132 states and 176 transitions. [2022-04-08 10:03:49,250 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 176 transitions. [2022-04-08 10:03:49,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:49,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:49,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:49,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:49,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.3706896551724137) internal successors, (159), 116 states have internal predecessors, (159), 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-08 10:03:49,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 163 transitions. [2022-04-08 10:03:49,252 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 163 transitions. Word has length 25 [2022-04-08 10:03:49,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:49,252 INFO L478 AbstractCegarLoop]: Abstraction has 121 states and 163 transitions. [2022-04-08 10:03:49,252 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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-08 10:03:49,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 163 transitions. [2022-04-08 10:03:49,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:49,643 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 163 transitions. [2022-04-08 10:03:49,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 10:03:49,643 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:49,643 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:49,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-08 10:03:49,858 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:49,859 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:49,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:49,859 INFO L85 PathProgramCache]: Analyzing trace with hash -216257032, now seen corresponding path program 15 times [2022-04-08 10:03:49,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:49,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [7464955] [2022-04-08 10:03:49,861 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:49,861 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:49,861 INFO L85 PathProgramCache]: Analyzing trace with hash -216257032, now seen corresponding path program 16 times [2022-04-08 10:03:49,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:49,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145884902] [2022-04-08 10:03:49,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:49,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:49,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:49,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:49,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:49,955 INFO L290 TraceCheckUtils]: 0: Hoare triple {15502#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15490#true} is VALID [2022-04-08 10:03:49,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {15490#true} assume true; {15490#true} is VALID [2022-04-08 10:03:49,956 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15490#true} {15490#true} #72#return; {15490#true} is VALID [2022-04-08 10:03:49,956 INFO L272 TraceCheckUtils]: 0: Hoare triple {15490#true} call ULTIMATE.init(); {15502#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:49,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {15502#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15490#true} is VALID [2022-04-08 10:03:49,956 INFO L290 TraceCheckUtils]: 2: Hoare triple {15490#true} assume true; {15490#true} is VALID [2022-04-08 10:03:49,956 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15490#true} {15490#true} #72#return; {15490#true} is VALID [2022-04-08 10:03:49,956 INFO L272 TraceCheckUtils]: 4: Hoare triple {15490#true} call #t~ret13 := main(); {15490#true} is VALID [2022-04-08 10:03:49,957 INFO L290 TraceCheckUtils]: 5: Hoare triple {15490#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15495#(= main_~y~0 0)} is VALID [2022-04-08 10:03:49,957 INFO L290 TraceCheckUtils]: 6: Hoare triple {15495#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15496#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:49,957 INFO L290 TraceCheckUtils]: 7: Hoare triple {15496#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15497#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:49,958 INFO L290 TraceCheckUtils]: 8: Hoare triple {15497#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15498#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:49,958 INFO L290 TraceCheckUtils]: 9: Hoare triple {15498#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15499#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:49,959 INFO L290 TraceCheckUtils]: 10: Hoare triple {15499#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {15499#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:49,959 INFO L290 TraceCheckUtils]: 11: Hoare triple {15499#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {15500#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:03:49,960 INFO L290 TraceCheckUtils]: 12: Hoare triple {15500#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15501#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:03:49,960 INFO L290 TraceCheckUtils]: 13: Hoare triple {15501#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {15491#false} is VALID [2022-04-08 10:03:49,960 INFO L290 TraceCheckUtils]: 14: Hoare triple {15491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15491#false} is VALID [2022-04-08 10:03:49,960 INFO L290 TraceCheckUtils]: 15: Hoare triple {15491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15491#false} is VALID [2022-04-08 10:03:49,960 INFO L290 TraceCheckUtils]: 16: Hoare triple {15491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15491#false} is VALID [2022-04-08 10:03:49,960 INFO L290 TraceCheckUtils]: 17: Hoare triple {15491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15491#false} is VALID [2022-04-08 10:03:49,960 INFO L290 TraceCheckUtils]: 18: Hoare triple {15491#false} assume !(~y~0 % 4294967296 > 0); {15491#false} is VALID [2022-04-08 10:03:49,960 INFO L290 TraceCheckUtils]: 19: Hoare triple {15491#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {15491#false} is VALID [2022-04-08 10:03:49,960 INFO L290 TraceCheckUtils]: 20: Hoare triple {15491#false} assume !(~x~0 % 4294967296 > 0); {15491#false} is VALID [2022-04-08 10:03:49,960 INFO L272 TraceCheckUtils]: 21: Hoare triple {15491#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {15491#false} is VALID [2022-04-08 10:03:49,961 INFO L290 TraceCheckUtils]: 22: Hoare triple {15491#false} ~cond := #in~cond; {15491#false} is VALID [2022-04-08 10:03:49,961 INFO L290 TraceCheckUtils]: 23: Hoare triple {15491#false} assume 0 == ~cond; {15491#false} is VALID [2022-04-08 10:03:49,961 INFO L290 TraceCheckUtils]: 24: Hoare triple {15491#false} assume !false; {15491#false} is VALID [2022-04-08 10:03:49,961 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 10:03:49,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:49,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145884902] [2022-04-08 10:03:49,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145884902] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:49,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72962269] [2022-04-08 10:03:49,961 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:03:49,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:49,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:49,965 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:03:49,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-08 10:03:49,997 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:03:49,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:49,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-08 10:03:50,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:50,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:50,126 INFO L272 TraceCheckUtils]: 0: Hoare triple {15490#true} call ULTIMATE.init(); {15490#true} is VALID [2022-04-08 10:03:50,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {15490#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15490#true} is VALID [2022-04-08 10:03:50,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {15490#true} assume true; {15490#true} is VALID [2022-04-08 10:03:50,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15490#true} {15490#true} #72#return; {15490#true} is VALID [2022-04-08 10:03:50,126 INFO L272 TraceCheckUtils]: 4: Hoare triple {15490#true} call #t~ret13 := main(); {15490#true} is VALID [2022-04-08 10:03:50,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {15490#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15495#(= main_~y~0 0)} is VALID [2022-04-08 10:03:50,127 INFO L290 TraceCheckUtils]: 6: Hoare triple {15495#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15496#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:50,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {15496#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15497#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:50,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {15497#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15498#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:50,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {15498#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15499#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:50,129 INFO L290 TraceCheckUtils]: 10: Hoare triple {15499#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {15499#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:50,129 INFO L290 TraceCheckUtils]: 11: Hoare triple {15499#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {15539#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:50,129 INFO L290 TraceCheckUtils]: 12: Hoare triple {15539#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15543#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:03:50,130 INFO L290 TraceCheckUtils]: 13: Hoare triple {15543#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {15491#false} is VALID [2022-04-08 10:03:50,130 INFO L290 TraceCheckUtils]: 14: Hoare triple {15491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15491#false} is VALID [2022-04-08 10:03:50,130 INFO L290 TraceCheckUtils]: 15: Hoare triple {15491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15491#false} is VALID [2022-04-08 10:03:50,130 INFO L290 TraceCheckUtils]: 16: Hoare triple {15491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15491#false} is VALID [2022-04-08 10:03:50,130 INFO L290 TraceCheckUtils]: 17: Hoare triple {15491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15491#false} is VALID [2022-04-08 10:03:50,130 INFO L290 TraceCheckUtils]: 18: Hoare triple {15491#false} assume !(~y~0 % 4294967296 > 0); {15491#false} is VALID [2022-04-08 10:03:50,130 INFO L290 TraceCheckUtils]: 19: Hoare triple {15491#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {15491#false} is VALID [2022-04-08 10:03:50,130 INFO L290 TraceCheckUtils]: 20: Hoare triple {15491#false} assume !(~x~0 % 4294967296 > 0); {15491#false} is VALID [2022-04-08 10:03:50,130 INFO L272 TraceCheckUtils]: 21: Hoare triple {15491#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {15491#false} is VALID [2022-04-08 10:03:50,130 INFO L290 TraceCheckUtils]: 22: Hoare triple {15491#false} ~cond := #in~cond; {15491#false} is VALID [2022-04-08 10:03:50,130 INFO L290 TraceCheckUtils]: 23: Hoare triple {15491#false} assume 0 == ~cond; {15491#false} is VALID [2022-04-08 10:03:50,131 INFO L290 TraceCheckUtils]: 24: Hoare triple {15491#false} assume !false; {15491#false} is VALID [2022-04-08 10:03:50,131 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-08 10:03:50,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:50,238 INFO L290 TraceCheckUtils]: 24: Hoare triple {15491#false} assume !false; {15491#false} is VALID [2022-04-08 10:03:50,238 INFO L290 TraceCheckUtils]: 23: Hoare triple {15491#false} assume 0 == ~cond; {15491#false} is VALID [2022-04-08 10:03:50,238 INFO L290 TraceCheckUtils]: 22: Hoare triple {15491#false} ~cond := #in~cond; {15491#false} is VALID [2022-04-08 10:03:50,238 INFO L272 TraceCheckUtils]: 21: Hoare triple {15491#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {15491#false} is VALID [2022-04-08 10:03:50,238 INFO L290 TraceCheckUtils]: 20: Hoare triple {15491#false} assume !(~x~0 % 4294967296 > 0); {15491#false} is VALID [2022-04-08 10:03:50,239 INFO L290 TraceCheckUtils]: 19: Hoare triple {15491#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {15491#false} is VALID [2022-04-08 10:03:50,239 INFO L290 TraceCheckUtils]: 18: Hoare triple {15491#false} assume !(~y~0 % 4294967296 > 0); {15491#false} is VALID [2022-04-08 10:03:50,239 INFO L290 TraceCheckUtils]: 17: Hoare triple {15491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15491#false} is VALID [2022-04-08 10:03:50,239 INFO L290 TraceCheckUtils]: 16: Hoare triple {15491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15491#false} is VALID [2022-04-08 10:03:50,239 INFO L290 TraceCheckUtils]: 15: Hoare triple {15607#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15491#false} is VALID [2022-04-08 10:03:50,240 INFO L290 TraceCheckUtils]: 14: Hoare triple {15611#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15607#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:03:50,240 INFO L290 TraceCheckUtils]: 13: Hoare triple {15615#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {15611#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:03:50,241 INFO L290 TraceCheckUtils]: 12: Hoare triple {15619#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15615#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:03:50,241 INFO L290 TraceCheckUtils]: 11: Hoare triple {15490#true} ~z~0 := ~y~0; {15619#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:03:50,241 INFO L290 TraceCheckUtils]: 10: Hoare triple {15490#true} assume !(~x~0 % 4294967296 > 0); {15490#true} is VALID [2022-04-08 10:03:50,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {15490#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15490#true} is VALID [2022-04-08 10:03:50,252 INFO L290 TraceCheckUtils]: 8: Hoare triple {15490#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15490#true} is VALID [2022-04-08 10:03:50,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {15490#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15490#true} is VALID [2022-04-08 10:03:50,252 INFO L290 TraceCheckUtils]: 6: Hoare triple {15490#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {15490#true} is VALID [2022-04-08 10:03:50,252 INFO L290 TraceCheckUtils]: 5: Hoare triple {15490#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15490#true} is VALID [2022-04-08 10:03:50,252 INFO L272 TraceCheckUtils]: 4: Hoare triple {15490#true} call #t~ret13 := main(); {15490#true} is VALID [2022-04-08 10:03:50,252 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15490#true} {15490#true} #72#return; {15490#true} is VALID [2022-04-08 10:03:50,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {15490#true} assume true; {15490#true} is VALID [2022-04-08 10:03:50,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {15490#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15490#true} is VALID [2022-04-08 10:03:50,252 INFO L272 TraceCheckUtils]: 0: Hoare triple {15490#true} call ULTIMATE.init(); {15490#true} is VALID [2022-04-08 10:03:50,253 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-08 10:03:50,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72962269] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:50,253 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:50,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 6] total 16 [2022-04-08 10:03:50,253 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:50,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [7464955] [2022-04-08 10:03:50,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [7464955] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:50,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:50,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 10:03:50,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313647793] [2022-04-08 10:03:50,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:50,254 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 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 25 [2022-04-08 10:03:50,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:50,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 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-08 10:03:50,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:50,264 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 10:03:50,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:50,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 10:03:50,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-04-08 10:03:50,265 INFO L87 Difference]: Start difference. First operand 121 states and 163 transitions. Second operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 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-08 10:03:51,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:51,188 INFO L93 Difference]: Finished difference Result 164 states and 210 transitions. [2022-04-08 10:03:51,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 10:03:51,188 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 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 25 [2022-04-08 10:03:51,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:51,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 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-08 10:03:51,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-08 10:03:51,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 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-08 10:03:51,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-08 10:03:51,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 64 transitions. [2022-04-08 10:03:51,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:51,243 INFO L225 Difference]: With dead ends: 164 [2022-04-08 10:03:51,243 INFO L226 Difference]: Without dead ends: 152 [2022-04-08 10:03:51,243 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2022-04-08 10:03:51,243 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 34 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:51,246 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 57 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:03:51,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-04-08 10:03:51,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 121. [2022-04-08 10:03:51,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:51,453 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand has 121 states, 116 states have (on average 1.3620689655172413) internal successors, (158), 116 states have internal predecessors, (158), 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-08 10:03:51,453 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand has 121 states, 116 states have (on average 1.3620689655172413) internal successors, (158), 116 states have internal predecessors, (158), 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-08 10:03:51,453 INFO L87 Difference]: Start difference. First operand 152 states. Second operand has 121 states, 116 states have (on average 1.3620689655172413) internal successors, (158), 116 states have internal predecessors, (158), 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-08 10:03:51,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:51,455 INFO L93 Difference]: Finished difference Result 152 states and 198 transitions. [2022-04-08 10:03:51,455 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 198 transitions. [2022-04-08 10:03:51,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:51,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:51,455 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 116 states have (on average 1.3620689655172413) internal successors, (158), 116 states have internal predecessors, (158), 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 152 states. [2022-04-08 10:03:51,456 INFO L87 Difference]: Start difference. First operand has 121 states, 116 states have (on average 1.3620689655172413) internal successors, (158), 116 states have internal predecessors, (158), 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 152 states. [2022-04-08 10:03:51,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:51,457 INFO L93 Difference]: Finished difference Result 152 states and 198 transitions. [2022-04-08 10:03:51,457 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 198 transitions. [2022-04-08 10:03:51,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:51,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:51,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:51,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:51,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.3620689655172413) internal successors, (158), 116 states have internal predecessors, (158), 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-08 10:03:51,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 162 transitions. [2022-04-08 10:03:51,459 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 162 transitions. Word has length 25 [2022-04-08 10:03:51,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:51,459 INFO L478 AbstractCegarLoop]: Abstraction has 121 states and 162 transitions. [2022-04-08 10:03:51,459 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 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-08 10:03:51,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 162 transitions. [2022-04-08 10:03:51,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:51,888 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 162 transitions. [2022-04-08 10:03:51,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 10:03:51,889 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:51,889 INFO L499 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:51,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-04-08 10:03:52,089 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:52,089 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:52,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:52,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1226882040, now seen corresponding path program 19 times [2022-04-08 10:03:52,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:52,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [836527130] [2022-04-08 10:03:52,092 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:52,092 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:52,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1226882040, now seen corresponding path program 20 times [2022-04-08 10:03:52,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:52,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424659271] [2022-04-08 10:03:52,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:52,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:52,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:52,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:52,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {16565#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16548#true} is VALID [2022-04-08 10:03:52,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {16548#true} assume true; {16548#true} is VALID [2022-04-08 10:03:52,256 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16548#true} {16548#true} #72#return; {16548#true} is VALID [2022-04-08 10:03:52,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {16548#true} call ULTIMATE.init(); {16565#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:52,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {16565#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16548#true} is VALID [2022-04-08 10:03:52,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {16548#true} assume true; {16548#true} is VALID [2022-04-08 10:03:52,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16548#true} {16548#true} #72#return; {16548#true} is VALID [2022-04-08 10:03:52,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {16548#true} call #t~ret13 := main(); {16548#true} is VALID [2022-04-08 10:03:52,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {16548#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16553#(= main_~y~0 0)} is VALID [2022-04-08 10:03:52,257 INFO L290 TraceCheckUtils]: 6: Hoare triple {16553#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16554#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:52,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {16554#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16555#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:52,258 INFO L290 TraceCheckUtils]: 8: Hoare triple {16555#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16556#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:52,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {16556#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16557#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:52,259 INFO L290 TraceCheckUtils]: 10: Hoare triple {16557#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16558#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:52,260 INFO L290 TraceCheckUtils]: 11: Hoare triple {16558#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16559#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:52,260 INFO L290 TraceCheckUtils]: 12: Hoare triple {16559#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16560#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:52,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {16560#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16561#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:52,261 INFO L290 TraceCheckUtils]: 14: Hoare triple {16561#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16562#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:03:52,262 INFO L290 TraceCheckUtils]: 15: Hoare triple {16562#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16563#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:03:52,262 INFO L290 TraceCheckUtils]: 16: Hoare triple {16563#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {16563#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:03:52,262 INFO L290 TraceCheckUtils]: 17: Hoare triple {16563#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {16564#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:03:52,263 INFO L290 TraceCheckUtils]: 18: Hoare triple {16564#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {16549#false} is VALID [2022-04-08 10:03:52,263 INFO L290 TraceCheckUtils]: 19: Hoare triple {16549#false} assume !(~y~0 % 4294967296 > 0); {16549#false} is VALID [2022-04-08 10:03:52,263 INFO L290 TraceCheckUtils]: 20: Hoare triple {16549#false} assume !(~x~0 % 4294967296 > 0); {16549#false} is VALID [2022-04-08 10:03:52,263 INFO L272 TraceCheckUtils]: 21: Hoare triple {16549#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16549#false} is VALID [2022-04-08 10:03:52,263 INFO L290 TraceCheckUtils]: 22: Hoare triple {16549#false} ~cond := #in~cond; {16549#false} is VALID [2022-04-08 10:03:52,263 INFO L290 TraceCheckUtils]: 23: Hoare triple {16549#false} assume 0 == ~cond; {16549#false} is VALID [2022-04-08 10:03:52,263 INFO L290 TraceCheckUtils]: 24: Hoare triple {16549#false} assume !false; {16549#false} is VALID [2022-04-08 10:03:52,263 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:52,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:52,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424659271] [2022-04-08 10:03:52,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424659271] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:52,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547350166] [2022-04-08 10:03:52,264 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:03:52,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:52,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:52,264 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:03:52,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-08 10:03:52,297 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:03:52,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:52,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 10:03:52,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:52,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:52,527 INFO L272 TraceCheckUtils]: 0: Hoare triple {16548#true} call ULTIMATE.init(); {16548#true} is VALID [2022-04-08 10:03:52,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {16548#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16548#true} is VALID [2022-04-08 10:03:52,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {16548#true} assume true; {16548#true} is VALID [2022-04-08 10:03:52,528 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16548#true} {16548#true} #72#return; {16548#true} is VALID [2022-04-08 10:03:52,528 INFO L272 TraceCheckUtils]: 4: Hoare triple {16548#true} call #t~ret13 := main(); {16548#true} is VALID [2022-04-08 10:03:52,528 INFO L290 TraceCheckUtils]: 5: Hoare triple {16548#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16553#(= main_~y~0 0)} is VALID [2022-04-08 10:03:52,528 INFO L290 TraceCheckUtils]: 6: Hoare triple {16553#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16554#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:52,529 INFO L290 TraceCheckUtils]: 7: Hoare triple {16554#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16555#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:52,529 INFO L290 TraceCheckUtils]: 8: Hoare triple {16555#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16556#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:52,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {16556#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16557#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:52,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {16557#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16558#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:52,531 INFO L290 TraceCheckUtils]: 11: Hoare triple {16558#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16559#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:52,531 INFO L290 TraceCheckUtils]: 12: Hoare triple {16559#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16560#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:52,532 INFO L290 TraceCheckUtils]: 13: Hoare triple {16560#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16561#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:52,532 INFO L290 TraceCheckUtils]: 14: Hoare triple {16561#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16562#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:03:52,533 INFO L290 TraceCheckUtils]: 15: Hoare triple {16562#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16563#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:03:52,533 INFO L290 TraceCheckUtils]: 16: Hoare triple {16563#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {16563#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:03:52,533 INFO L290 TraceCheckUtils]: 17: Hoare triple {16563#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {16620#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:03:52,534 INFO L290 TraceCheckUtils]: 18: Hoare triple {16620#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {16549#false} is VALID [2022-04-08 10:03:52,534 INFO L290 TraceCheckUtils]: 19: Hoare triple {16549#false} assume !(~y~0 % 4294967296 > 0); {16549#false} is VALID [2022-04-08 10:03:52,534 INFO L290 TraceCheckUtils]: 20: Hoare triple {16549#false} assume !(~x~0 % 4294967296 > 0); {16549#false} is VALID [2022-04-08 10:03:52,534 INFO L272 TraceCheckUtils]: 21: Hoare triple {16549#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16549#false} is VALID [2022-04-08 10:03:52,534 INFO L290 TraceCheckUtils]: 22: Hoare triple {16549#false} ~cond := #in~cond; {16549#false} is VALID [2022-04-08 10:03:52,534 INFO L290 TraceCheckUtils]: 23: Hoare triple {16549#false} assume 0 == ~cond; {16549#false} is VALID [2022-04-08 10:03:52,534 INFO L290 TraceCheckUtils]: 24: Hoare triple {16549#false} assume !false; {16549#false} is VALID [2022-04-08 10:03:52,534 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:52,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:52,809 INFO L290 TraceCheckUtils]: 24: Hoare triple {16549#false} assume !false; {16549#false} is VALID [2022-04-08 10:03:52,809 INFO L290 TraceCheckUtils]: 23: Hoare triple {16549#false} assume 0 == ~cond; {16549#false} is VALID [2022-04-08 10:03:52,809 INFO L290 TraceCheckUtils]: 22: Hoare triple {16549#false} ~cond := #in~cond; {16549#false} is VALID [2022-04-08 10:03:52,809 INFO L272 TraceCheckUtils]: 21: Hoare triple {16549#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16549#false} is VALID [2022-04-08 10:03:52,809 INFO L290 TraceCheckUtils]: 20: Hoare triple {16549#false} assume !(~x~0 % 4294967296 > 0); {16549#false} is VALID [2022-04-08 10:03:52,810 INFO L290 TraceCheckUtils]: 19: Hoare triple {16549#false} assume !(~y~0 % 4294967296 > 0); {16549#false} is VALID [2022-04-08 10:03:52,810 INFO L290 TraceCheckUtils]: 18: Hoare triple {16660#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {16549#false} is VALID [2022-04-08 10:03:52,810 INFO L290 TraceCheckUtils]: 17: Hoare triple {16664#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {16660#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:03:52,810 INFO L290 TraceCheckUtils]: 16: Hoare triple {16664#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {16664#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:52,811 INFO L290 TraceCheckUtils]: 15: Hoare triple {16671#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16664#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:52,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {16675#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16671#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:03:52,812 INFO L290 TraceCheckUtils]: 13: Hoare triple {16679#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16675#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:03:52,813 INFO L290 TraceCheckUtils]: 12: Hoare triple {16683#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16679#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:03:52,813 INFO L290 TraceCheckUtils]: 11: Hoare triple {16687#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16683#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:03:52,814 INFO L290 TraceCheckUtils]: 10: Hoare triple {16691#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16687#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:52,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {16695#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16691#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:03:52,815 INFO L290 TraceCheckUtils]: 8: Hoare triple {16699#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16695#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:52,816 INFO L290 TraceCheckUtils]: 7: Hoare triple {16703#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16699#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:03:52,816 INFO L290 TraceCheckUtils]: 6: Hoare triple {16707#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {16703#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:03:52,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {16548#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16707#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:03:52,817 INFO L272 TraceCheckUtils]: 4: Hoare triple {16548#true} call #t~ret13 := main(); {16548#true} is VALID [2022-04-08 10:03:52,817 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16548#true} {16548#true} #72#return; {16548#true} is VALID [2022-04-08 10:03:52,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {16548#true} assume true; {16548#true} is VALID [2022-04-08 10:03:52,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {16548#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16548#true} is VALID [2022-04-08 10:03:52,817 INFO L272 TraceCheckUtils]: 0: Hoare triple {16548#true} call ULTIMATE.init(); {16548#true} is VALID [2022-04-08 10:03:52,817 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:52,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547350166] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:52,817 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:52,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-08 10:03:52,817 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:52,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [836527130] [2022-04-08 10:03:52,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [836527130] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:52,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:52,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 10:03:52,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635962945] [2022-04-08 10:03:52,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:52,818 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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 25 [2022-04-08 10:03:52,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:52,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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-08 10:03:52,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:52,833 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 10:03:52,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:52,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 10:03:52,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:03:52,833 INFO L87 Difference]: Start difference. First operand 121 states and 162 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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-08 10:03:54,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:54,688 INFO L93 Difference]: Finished difference Result 219 states and 326 transitions. [2022-04-08 10:03:54,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 10:03:54,688 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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 25 [2022-04-08 10:03:54,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:54,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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-08 10:03:54,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 127 transitions. [2022-04-08 10:03:54,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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-08 10:03:54,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 127 transitions. [2022-04-08 10:03:54,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 127 transitions. [2022-04-08 10:03:54,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:54,756 INFO L225 Difference]: With dead ends: 219 [2022-04-08 10:03:54,756 INFO L226 Difference]: Without dead ends: 202 [2022-04-08 10:03:54,757 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=358, Invalid=1202, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 10:03:54,757 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 89 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:54,757 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 118 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1084 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 10:03:54,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-04-08 10:03:54,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 132. [2022-04-08 10:03:54,973 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:54,973 INFO L82 GeneralOperation]: Start isEquivalent. First operand 202 states. Second operand has 132 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 127 states have internal predecessors, (174), 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-08 10:03:54,973 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand has 132 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 127 states have internal predecessors, (174), 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-08 10:03:54,973 INFO L87 Difference]: Start difference. First operand 202 states. Second operand has 132 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 127 states have internal predecessors, (174), 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-08 10:03:54,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:54,989 INFO L93 Difference]: Finished difference Result 202 states and 259 transitions. [2022-04-08 10:03:54,989 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 259 transitions. [2022-04-08 10:03:54,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:54,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:54,989 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 127 states have internal predecessors, (174), 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 202 states. [2022-04-08 10:03:54,989 INFO L87 Difference]: Start difference. First operand has 132 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 127 states have internal predecessors, (174), 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 202 states. [2022-04-08 10:03:54,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:54,991 INFO L93 Difference]: Finished difference Result 202 states and 259 transitions. [2022-04-08 10:03:54,991 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 259 transitions. [2022-04-08 10:03:54,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:54,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:54,992 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:54,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:54,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 127 states have internal predecessors, (174), 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-08 10:03:54,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 178 transitions. [2022-04-08 10:03:54,993 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 178 transitions. Word has length 25 [2022-04-08 10:03:54,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:54,993 INFO L478 AbstractCegarLoop]: Abstraction has 132 states and 178 transitions. [2022-04-08 10:03:54,993 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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-08 10:03:54,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 132 states and 178 transitions. [2022-04-08 10:03:55,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:55,322 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 178 transitions. [2022-04-08 10:03:55,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 10:03:55,343 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:55,344 INFO L499 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:55,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-08 10:03:55,544 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-08 10:03:55,544 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:55,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:55,544 INFO L85 PathProgramCache]: Analyzing trace with hash 415342529, now seen corresponding path program 21 times [2022-04-08 10:03:55,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:55,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [480265804] [2022-04-08 10:03:55,547 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:55,547 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:55,547 INFO L85 PathProgramCache]: Analyzing trace with hash 415342529, now seen corresponding path program 22 times [2022-04-08 10:03:55,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:55,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266958213] [2022-04-08 10:03:55,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:55,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:55,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:03:55,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:55,685 INFO L290 TraceCheckUtils]: 0: Hoare triple {17876#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17858#true} is VALID [2022-04-08 10:03:55,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {17858#true} assume true; {17858#true} is VALID [2022-04-08 10:03:55,685 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17858#true} {17858#true} #72#return; {17858#true} is VALID [2022-04-08 10:03:55,686 INFO L272 TraceCheckUtils]: 0: Hoare triple {17858#true} call ULTIMATE.init(); {17876#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:03:55,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {17876#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17858#true} is VALID [2022-04-08 10:03:55,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {17858#true} assume true; {17858#true} is VALID [2022-04-08 10:03:55,686 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17858#true} {17858#true} #72#return; {17858#true} is VALID [2022-04-08 10:03:55,686 INFO L272 TraceCheckUtils]: 4: Hoare triple {17858#true} call #t~ret13 := main(); {17858#true} is VALID [2022-04-08 10:03:55,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {17858#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17863#(= main_~y~0 0)} is VALID [2022-04-08 10:03:55,686 INFO L290 TraceCheckUtils]: 6: Hoare triple {17863#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17864#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:55,687 INFO L290 TraceCheckUtils]: 7: Hoare triple {17864#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17865#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:55,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {17865#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17866#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:55,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {17866#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17867#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:55,688 INFO L290 TraceCheckUtils]: 10: Hoare triple {17867#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17868#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:55,688 INFO L290 TraceCheckUtils]: 11: Hoare triple {17868#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17869#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:55,689 INFO L290 TraceCheckUtils]: 12: Hoare triple {17869#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17870#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:55,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {17870#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17871#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:55,689 INFO L290 TraceCheckUtils]: 14: Hoare triple {17871#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17872#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:03:55,690 INFO L290 TraceCheckUtils]: 15: Hoare triple {17872#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17873#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:03:55,690 INFO L290 TraceCheckUtils]: 16: Hoare triple {17873#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17874#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:03:55,690 INFO L290 TraceCheckUtils]: 17: Hoare triple {17874#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {17874#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:03:55,691 INFO L290 TraceCheckUtils]: 18: Hoare triple {17874#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {17875#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} is VALID [2022-04-08 10:03:55,691 INFO L290 TraceCheckUtils]: 19: Hoare triple {17875#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {17859#false} is VALID [2022-04-08 10:03:55,691 INFO L290 TraceCheckUtils]: 20: Hoare triple {17859#false} assume !(~y~0 % 4294967296 > 0); {17859#false} is VALID [2022-04-08 10:03:55,691 INFO L290 TraceCheckUtils]: 21: Hoare triple {17859#false} assume !(~x~0 % 4294967296 > 0); {17859#false} is VALID [2022-04-08 10:03:55,691 INFO L272 TraceCheckUtils]: 22: Hoare triple {17859#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17859#false} is VALID [2022-04-08 10:03:55,691 INFO L290 TraceCheckUtils]: 23: Hoare triple {17859#false} ~cond := #in~cond; {17859#false} is VALID [2022-04-08 10:03:55,691 INFO L290 TraceCheckUtils]: 24: Hoare triple {17859#false} assume 0 == ~cond; {17859#false} is VALID [2022-04-08 10:03:55,691 INFO L290 TraceCheckUtils]: 25: Hoare triple {17859#false} assume !false; {17859#false} is VALID [2022-04-08 10:03:55,692 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:55,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:03:55,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266958213] [2022-04-08 10:03:55,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266958213] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:03:55,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745954302] [2022-04-08 10:03:55,692 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:03:55,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:03:55,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:03:55,693 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:03:55,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-08 10:03:55,747 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:03:55,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:03:55,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 10:03:55,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:03:55,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:03:55,934 INFO L272 TraceCheckUtils]: 0: Hoare triple {17858#true} call ULTIMATE.init(); {17858#true} is VALID [2022-04-08 10:03:55,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {17858#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17858#true} is VALID [2022-04-08 10:03:55,935 INFO L290 TraceCheckUtils]: 2: Hoare triple {17858#true} assume true; {17858#true} is VALID [2022-04-08 10:03:55,935 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17858#true} {17858#true} #72#return; {17858#true} is VALID [2022-04-08 10:03:55,935 INFO L272 TraceCheckUtils]: 4: Hoare triple {17858#true} call #t~ret13 := main(); {17858#true} is VALID [2022-04-08 10:03:55,935 INFO L290 TraceCheckUtils]: 5: Hoare triple {17858#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17863#(= main_~y~0 0)} is VALID [2022-04-08 10:03:55,935 INFO L290 TraceCheckUtils]: 6: Hoare triple {17863#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17864#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:03:55,936 INFO L290 TraceCheckUtils]: 7: Hoare triple {17864#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17865#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:03:55,936 INFO L290 TraceCheckUtils]: 8: Hoare triple {17865#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17866#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:03:55,937 INFO L290 TraceCheckUtils]: 9: Hoare triple {17866#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17867#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:03:55,937 INFO L290 TraceCheckUtils]: 10: Hoare triple {17867#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17868#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:03:55,937 INFO L290 TraceCheckUtils]: 11: Hoare triple {17868#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17869#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:03:55,938 INFO L290 TraceCheckUtils]: 12: Hoare triple {17869#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17870#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:03:55,938 INFO L290 TraceCheckUtils]: 13: Hoare triple {17870#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17871#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:03:55,938 INFO L290 TraceCheckUtils]: 14: Hoare triple {17871#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17872#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:03:55,939 INFO L290 TraceCheckUtils]: 15: Hoare triple {17872#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17873#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:03:55,939 INFO L290 TraceCheckUtils]: 16: Hoare triple {17873#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17874#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:03:55,939 INFO L290 TraceCheckUtils]: 17: Hoare triple {17874#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {17874#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:03:55,940 INFO L290 TraceCheckUtils]: 18: Hoare triple {17874#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {17934#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:03:55,940 INFO L290 TraceCheckUtils]: 19: Hoare triple {17934#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {17859#false} is VALID [2022-04-08 10:03:55,940 INFO L290 TraceCheckUtils]: 20: Hoare triple {17859#false} assume !(~y~0 % 4294967296 > 0); {17859#false} is VALID [2022-04-08 10:03:55,940 INFO L290 TraceCheckUtils]: 21: Hoare triple {17859#false} assume !(~x~0 % 4294967296 > 0); {17859#false} is VALID [2022-04-08 10:03:55,940 INFO L272 TraceCheckUtils]: 22: Hoare triple {17859#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17859#false} is VALID [2022-04-08 10:03:55,940 INFO L290 TraceCheckUtils]: 23: Hoare triple {17859#false} ~cond := #in~cond; {17859#false} is VALID [2022-04-08 10:03:55,940 INFO L290 TraceCheckUtils]: 24: Hoare triple {17859#false} assume 0 == ~cond; {17859#false} is VALID [2022-04-08 10:03:55,940 INFO L290 TraceCheckUtils]: 25: Hoare triple {17859#false} assume !false; {17859#false} is VALID [2022-04-08 10:03:55,940 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:55,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:03:56,161 INFO L290 TraceCheckUtils]: 25: Hoare triple {17859#false} assume !false; {17859#false} is VALID [2022-04-08 10:03:56,161 INFO L290 TraceCheckUtils]: 24: Hoare triple {17859#false} assume 0 == ~cond; {17859#false} is VALID [2022-04-08 10:03:56,161 INFO L290 TraceCheckUtils]: 23: Hoare triple {17859#false} ~cond := #in~cond; {17859#false} is VALID [2022-04-08 10:03:56,161 INFO L272 TraceCheckUtils]: 22: Hoare triple {17859#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17859#false} is VALID [2022-04-08 10:03:56,161 INFO L290 TraceCheckUtils]: 21: Hoare triple {17859#false} assume !(~x~0 % 4294967296 > 0); {17859#false} is VALID [2022-04-08 10:03:56,161 INFO L290 TraceCheckUtils]: 20: Hoare triple {17859#false} assume !(~y~0 % 4294967296 > 0); {17859#false} is VALID [2022-04-08 10:03:56,162 INFO L290 TraceCheckUtils]: 19: Hoare triple {17974#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {17859#false} is VALID [2022-04-08 10:03:56,162 INFO L290 TraceCheckUtils]: 18: Hoare triple {17978#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {17974#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:03:56,162 INFO L290 TraceCheckUtils]: 17: Hoare triple {17978#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {17978#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:56,163 INFO L290 TraceCheckUtils]: 16: Hoare triple {17985#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17978#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:03:56,163 INFO L290 TraceCheckUtils]: 15: Hoare triple {17989#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17985#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:03:56,164 INFO L290 TraceCheckUtils]: 14: Hoare triple {17993#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17989#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:03:56,164 INFO L290 TraceCheckUtils]: 13: Hoare triple {17997#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17993#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:03:56,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {18001#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {17997#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:03:56,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {18005#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18001#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:56,166 INFO L290 TraceCheckUtils]: 10: Hoare triple {18009#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18005#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:03:56,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {18013#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18009#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:03:56,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {18017#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18013#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:03:56,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {18021#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18017#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:03:56,168 INFO L290 TraceCheckUtils]: 6: Hoare triple {18025#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {18021#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:03:56,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {17858#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18025#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:03:56,168 INFO L272 TraceCheckUtils]: 4: Hoare triple {17858#true} call #t~ret13 := main(); {17858#true} is VALID [2022-04-08 10:03:56,168 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17858#true} {17858#true} #72#return; {17858#true} is VALID [2022-04-08 10:03:56,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {17858#true} assume true; {17858#true} is VALID [2022-04-08 10:03:56,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {17858#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17858#true} is VALID [2022-04-08 10:03:56,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {17858#true} call ULTIMATE.init(); {17858#true} is VALID [2022-04-08 10:03:56,169 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:03:56,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745954302] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:03:56,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:03:56,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-08 10:03:56,169 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:03:56,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [480265804] [2022-04-08 10:03:56,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [480265804] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:03:56,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:03:56,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 10:03:56,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264401293] [2022-04-08 10:03:56,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:03:56,169 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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 26 [2022-04-08 10:03:56,170 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:03:56,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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-08 10:03:56,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:56,182 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 10:03:56,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:56,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 10:03:56,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=667, Unknown=0, NotChecked=0, Total=870 [2022-04-08 10:03:56,183 INFO L87 Difference]: Start difference. First operand 132 states and 178 transitions. Second operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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-08 10:03:58,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:58,795 INFO L93 Difference]: Finished difference Result 236 states and 353 transitions. [2022-04-08 10:03:58,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 10:03:58,795 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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 26 [2022-04-08 10:03:58,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:03:58,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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-08 10:03:58,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 137 transitions. [2022-04-08 10:03:58,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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-08 10:03:58,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 137 transitions. [2022-04-08 10:03:58,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 137 transitions. [2022-04-08 10:03:58,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:58,908 INFO L225 Difference]: With dead ends: 236 [2022-04-08 10:03:58,908 INFO L226 Difference]: Without dead ends: 219 [2022-04-08 10:03:58,909 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=413, Invalid=1393, Unknown=0, NotChecked=0, Total=1806 [2022-04-08 10:03:58,909 INFO L913 BasicCegarLoop]: 59 mSDtfsCounter, 102 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1264 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 1334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 10:03:58,909 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 126 Invalid, 1334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1264 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 10:03:58,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-04-08 10:03:59,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 143. [2022-04-08 10:03:59,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:03:59,226 INFO L82 GeneralOperation]: Start isEquivalent. First operand 219 states. Second operand has 143 states, 138 states have (on average 1.3768115942028984) internal successors, (190), 138 states have internal predecessors, (190), 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-08 10:03:59,226 INFO L74 IsIncluded]: Start isIncluded. First operand 219 states. Second operand has 143 states, 138 states have (on average 1.3768115942028984) internal successors, (190), 138 states have internal predecessors, (190), 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-08 10:03:59,226 INFO L87 Difference]: Start difference. First operand 219 states. Second operand has 143 states, 138 states have (on average 1.3768115942028984) internal successors, (190), 138 states have internal predecessors, (190), 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-08 10:03:59,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:59,228 INFO L93 Difference]: Finished difference Result 219 states and 282 transitions. [2022-04-08 10:03:59,228 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 282 transitions. [2022-04-08 10:03:59,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:59,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:59,229 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 138 states have (on average 1.3768115942028984) internal successors, (190), 138 states have internal predecessors, (190), 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 219 states. [2022-04-08 10:03:59,229 INFO L87 Difference]: Start difference. First operand has 143 states, 138 states have (on average 1.3768115942028984) internal successors, (190), 138 states have internal predecessors, (190), 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 219 states. [2022-04-08 10:03:59,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:03:59,231 INFO L93 Difference]: Finished difference Result 219 states and 282 transitions. [2022-04-08 10:03:59,231 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 282 transitions. [2022-04-08 10:03:59,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:03:59,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:03:59,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:03:59,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:03:59,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 138 states have (on average 1.3768115942028984) internal successors, (190), 138 states have internal predecessors, (190), 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-08 10:03:59,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 194 transitions. [2022-04-08 10:03:59,233 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 194 transitions. Word has length 26 [2022-04-08 10:03:59,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:03:59,233 INFO L478 AbstractCegarLoop]: Abstraction has 143 states and 194 transitions. [2022-04-08 10:03:59,233 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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-08 10:03:59,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 143 states and 194 transitions. [2022-04-08 10:03:59,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:03:59,556 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 194 transitions. [2022-04-08 10:03:59,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 10:03:59,556 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:03:59,556 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:03:59,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-08 10:03:59,772 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-08 10:03:59,772 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:03:59,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:03:59,772 INFO L85 PathProgramCache]: Analyzing trace with hash -828351928, now seen corresponding path program 17 times [2022-04-08 10:03:59,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:03:59,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [818021189] [2022-04-08 10:03:59,774 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:03:59,774 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:03:59,774 INFO L85 PathProgramCache]: Analyzing trace with hash -828351928, now seen corresponding path program 18 times [2022-04-08 10:03:59,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:03:59,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033207267] [2022-04-08 10:03:59,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:03:59,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:03:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:00,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:04:00,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:00,102 INFO L290 TraceCheckUtils]: 0: Hoare triple {19285#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19268#true} is VALID [2022-04-08 10:04:00,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {19268#true} assume true; {19268#true} is VALID [2022-04-08 10:04:00,103 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19268#true} {19268#true} #72#return; {19268#true} is VALID [2022-04-08 10:04:00,103 INFO L272 TraceCheckUtils]: 0: Hoare triple {19268#true} call ULTIMATE.init(); {19285#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:04:00,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {19285#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19268#true} is VALID [2022-04-08 10:04:00,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {19268#true} assume true; {19268#true} is VALID [2022-04-08 10:04:00,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19268#true} {19268#true} #72#return; {19268#true} is VALID [2022-04-08 10:04:00,103 INFO L272 TraceCheckUtils]: 4: Hoare triple {19268#true} call #t~ret13 := main(); {19268#true} is VALID [2022-04-08 10:04:00,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {19268#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19273#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-08 10:04:00,105 INFO L290 TraceCheckUtils]: 6: Hoare triple {19273#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19274#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:00,180 INFO L290 TraceCheckUtils]: 7: Hoare triple {19274#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19275#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-08 10:04:00,181 INFO L290 TraceCheckUtils]: 8: Hoare triple {19275#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19276#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0)))} is VALID [2022-04-08 10:04:00,181 INFO L290 TraceCheckUtils]: 9: Hoare triple {19276#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0)))} assume !(~x~0 % 4294967296 > 0); {19277#(and (<= main_~y~0 3) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} is VALID [2022-04-08 10:04:00,182 INFO L290 TraceCheckUtils]: 10: Hoare triple {19277#(and (<= main_~y~0 3) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} ~z~0 := ~y~0; {19277#(and (<= main_~y~0 3) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} is VALID [2022-04-08 10:04:00,182 INFO L290 TraceCheckUtils]: 11: Hoare triple {19277#(and (<= main_~y~0 3) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19278#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 3))} is VALID [2022-04-08 10:04:00,183 INFO L290 TraceCheckUtils]: 12: Hoare triple {19278#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 3))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19278#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 3))} is VALID [2022-04-08 10:04:00,183 INFO L290 TraceCheckUtils]: 13: Hoare triple {19278#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 3))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19278#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 3))} is VALID [2022-04-08 10:04:00,184 INFO L290 TraceCheckUtils]: 14: Hoare triple {19278#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 3))} assume !(~z~0 % 4294967296 > 0); {19278#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 3))} is VALID [2022-04-08 10:04:00,184 INFO L290 TraceCheckUtils]: 15: Hoare triple {19278#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 3))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19279#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:00,185 INFO L290 TraceCheckUtils]: 16: Hoare triple {19279#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19280#(and (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:00,186 INFO L290 TraceCheckUtils]: 17: Hoare triple {19280#(and (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19281#(and (<= main_~y~0 0) (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:04:00,186 INFO L290 TraceCheckUtils]: 18: Hoare triple {19281#(and (<= main_~y~0 0) (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {19281#(and (<= main_~y~0 0) (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:04:00,187 INFO L290 TraceCheckUtils]: 19: Hoare triple {19281#(and (<= main_~y~0 0) (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19280#(and (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:00,187 INFO L290 TraceCheckUtils]: 20: Hoare triple {19280#(and (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19279#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:00,188 INFO L290 TraceCheckUtils]: 21: Hoare triple {19279#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19282#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (div main_~y~0 4294967296) 0) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:04:00,189 INFO L290 TraceCheckUtils]: 22: Hoare triple {19282#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (div main_~y~0 4294967296) 0) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {19282#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (div main_~y~0 4294967296) 0) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:04:00,190 INFO L272 TraceCheckUtils]: 23: Hoare triple {19282#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (div main_~y~0 4294967296) 0) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {19283#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:04:00,190 INFO L290 TraceCheckUtils]: 24: Hoare triple {19283#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {19284#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:04:00,190 INFO L290 TraceCheckUtils]: 25: Hoare triple {19284#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {19269#false} is VALID [2022-04-08 10:04:00,191 INFO L290 TraceCheckUtils]: 26: Hoare triple {19269#false} assume !false; {19269#false} is VALID [2022-04-08 10:04:00,191 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 10:04:00,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:04:00,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033207267] [2022-04-08 10:04:00,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033207267] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:04:00,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359062398] [2022-04-08 10:04:00,191 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:04:00,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:00,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:04:00,204 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:04:00,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-08 10:04:00,277 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:04:00,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:04:00,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-08 10:04:00,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:00,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:04:01,028 INFO L272 TraceCheckUtils]: 0: Hoare triple {19268#true} call ULTIMATE.init(); {19268#true} is VALID [2022-04-08 10:04:01,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {19268#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19268#true} is VALID [2022-04-08 10:04:01,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {19268#true} assume true; {19268#true} is VALID [2022-04-08 10:04:01,028 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19268#true} {19268#true} #72#return; {19268#true} is VALID [2022-04-08 10:04:01,028 INFO L272 TraceCheckUtils]: 4: Hoare triple {19268#true} call #t~ret13 := main(); {19268#true} is VALID [2022-04-08 10:04:01,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {19268#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19273#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-08 10:04:01,029 INFO L290 TraceCheckUtils]: 6: Hoare triple {19273#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19307#(and (= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-08 10:04:01,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {19307#(and (= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0) (= (+ (- 1) main_~y~0) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19311#(and (= main_~y~0 2) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} is VALID [2022-04-08 10:04:01,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {19311#(and (= main_~y~0 2) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19315#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 1)) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= main_~y~0 3))} is VALID [2022-04-08 10:04:01,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {19315#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 1)) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= main_~y~0 3))} assume !(~x~0 % 4294967296 > 0); {19319#(and (= (+ main_~x~0 3) main_~n~0) (= main_~y~0 3) (<= (mod main_~x~0 4294967296) 0))} is VALID [2022-04-08 10:04:01,032 INFO L290 TraceCheckUtils]: 10: Hoare triple {19319#(and (= (+ main_~x~0 3) main_~n~0) (= main_~y~0 3) (<= (mod main_~x~0 4294967296) 0))} ~z~0 := ~y~0; {19319#(and (= (+ main_~x~0 3) main_~n~0) (= main_~y~0 3) (<= (mod main_~x~0 4294967296) 0))} is VALID [2022-04-08 10:04:01,032 INFO L290 TraceCheckUtils]: 11: Hoare triple {19319#(and (= (+ main_~x~0 3) main_~n~0) (= main_~y~0 3) (<= (mod main_~x~0 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19326#(and (= (+ (- 2) main_~n~0) main_~x~0) (= main_~y~0 3) (<= (mod (+ main_~n~0 4294967293) 4294967296) 0))} is VALID [2022-04-08 10:04:01,033 INFO L290 TraceCheckUtils]: 12: Hoare triple {19326#(and (= (+ (- 2) main_~n~0) main_~x~0) (= main_~y~0 3) (<= (mod (+ main_~n~0 4294967293) 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19330#(and (= (+ (- 2) main_~n~0) (+ (- 1) main_~x~0)) (= main_~y~0 3) (<= (mod (+ main_~n~0 4294967293) 4294967296) 0))} is VALID [2022-04-08 10:04:01,034 INFO L290 TraceCheckUtils]: 13: Hoare triple {19330#(and (= (+ (- 2) main_~n~0) (+ (- 1) main_~x~0)) (= main_~y~0 3) (<= (mod (+ main_~n~0 4294967293) 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19334#(and (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= main_~y~0 3) (<= (mod (+ main_~n~0 4294967293) 4294967296) 0))} is VALID [2022-04-08 10:04:01,034 INFO L290 TraceCheckUtils]: 14: Hoare triple {19334#(and (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= main_~y~0 3) (<= (mod (+ main_~n~0 4294967293) 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {19334#(and (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= main_~y~0 3) (<= (mod (+ main_~n~0 4294967293) 4294967296) 0))} is VALID [2022-04-08 10:04:01,034 INFO L290 TraceCheckUtils]: 15: Hoare triple {19334#(and (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= main_~y~0 3) (<= (mod (+ main_~n~0 4294967293) 4294967296) 0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19341#(and (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (<= (mod (+ main_~n~0 4294967293) 4294967296) 0) (= 3 (+ main_~y~0 1)))} is VALID [2022-04-08 10:04:01,035 INFO L290 TraceCheckUtils]: 16: Hoare triple {19341#(and (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (<= (mod (+ main_~n~0 4294967293) 4294967296) 0) (= 3 (+ main_~y~0 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19345#(and (= (+ main_~y~0 2) 3) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (<= (mod (+ main_~n~0 4294967293) 4294967296) 0))} is VALID [2022-04-08 10:04:01,035 INFO L290 TraceCheckUtils]: 17: Hoare triple {19345#(and (= (+ main_~y~0 2) 3) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (<= (mod (+ main_~n~0 4294967293) 4294967296) 0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19349#(and (= (+ main_~y~0 1) 1) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (<= (mod (+ main_~n~0 4294967293) 4294967296) 0))} is VALID [2022-04-08 10:04:01,036 INFO L290 TraceCheckUtils]: 18: Hoare triple {19349#(and (= (+ main_~y~0 1) 1) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (<= (mod (+ main_~n~0 4294967293) 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {19349#(and (= (+ main_~y~0 1) 1) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (<= (mod (+ main_~n~0 4294967293) 4294967296) 0))} is VALID [2022-04-08 10:04:01,037 INFO L290 TraceCheckUtils]: 19: Hoare triple {19349#(and (= (+ main_~y~0 1) 1) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (<= (mod (+ main_~n~0 4294967293) 4294967296) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19280#(and (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:01,037 INFO L290 TraceCheckUtils]: 20: Hoare triple {19280#(and (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19279#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:01,038 INFO L290 TraceCheckUtils]: 21: Hoare triple {19279#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19278#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 3))} is VALID [2022-04-08 10:04:01,038 INFO L290 TraceCheckUtils]: 22: Hoare triple {19278#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 3))} assume !(~x~0 % 4294967296 > 0); {19278#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 3))} is VALID [2022-04-08 10:04:01,040 INFO L272 TraceCheckUtils]: 23: Hoare triple {19278#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~y~0 3))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {19368#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:04:01,040 INFO L290 TraceCheckUtils]: 24: Hoare triple {19368#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19372#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:04:01,041 INFO L290 TraceCheckUtils]: 25: Hoare triple {19372#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19269#false} is VALID [2022-04-08 10:04:01,041 INFO L290 TraceCheckUtils]: 26: Hoare triple {19269#false} assume !false; {19269#false} is VALID [2022-04-08 10:04:01,041 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:04:01,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:04:02,054 INFO L290 TraceCheckUtils]: 26: Hoare triple {19269#false} assume !false; {19269#false} is VALID [2022-04-08 10:04:02,054 INFO L290 TraceCheckUtils]: 25: Hoare triple {19372#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {19269#false} is VALID [2022-04-08 10:04:02,054 INFO L290 TraceCheckUtils]: 24: Hoare triple {19368#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {19372#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:04:02,055 INFO L272 TraceCheckUtils]: 23: Hoare triple {19388#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {19368#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:04:02,055 INFO L290 TraceCheckUtils]: 22: Hoare triple {19388#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {19388#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:04:02,056 INFO L290 TraceCheckUtils]: 21: Hoare triple {19395#(= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19388#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:04:02,056 INFO L290 TraceCheckUtils]: 20: Hoare triple {19399#(= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19395#(= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:04:02,057 INFO L290 TraceCheckUtils]: 19: Hoare triple {19403#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (<= (mod main_~x~0 4294967296) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {19399#(= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:04:02,057 INFO L290 TraceCheckUtils]: 18: Hoare triple {19403#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (<= (mod main_~x~0 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {19403#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (<= (mod main_~x~0 4294967296) 0))} is VALID [2022-04-08 10:04:02,058 INFO L290 TraceCheckUtils]: 17: Hoare triple {19410#(or (<= (mod main_~x~0 4294967296) 0) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19403#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (<= (mod main_~x~0 4294967296) 0))} is VALID [2022-04-08 10:04:02,058 INFO L290 TraceCheckUtils]: 16: Hoare triple {19414#(or (<= (mod main_~x~0 4294967296) 0) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19410#(or (<= (mod main_~x~0 4294967296) 0) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296)))} is VALID [2022-04-08 10:04:02,059 INFO L290 TraceCheckUtils]: 15: Hoare triple {19418#(or (<= (mod main_~x~0 4294967296) 0) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19414#(or (<= (mod main_~x~0 4294967296) 0) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-08 10:04:02,059 INFO L290 TraceCheckUtils]: 14: Hoare triple {19418#(or (<= (mod main_~x~0 4294967296) 0) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {19418#(or (<= (mod main_~x~0 4294967296) 0) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:04:02,060 INFO L290 TraceCheckUtils]: 13: Hoare triple {19425#(or (<= (mod (+ main_~x~0 1) 4294967296) 0) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19418#(or (<= (mod main_~x~0 4294967296) 0) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:04:02,061 INFO L290 TraceCheckUtils]: 12: Hoare triple {19429#(or (<= (mod (+ main_~x~0 2) 4294967296) 0) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19425#(or (<= (mod (+ main_~x~0 1) 4294967296) 0) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:04:02,061 INFO L290 TraceCheckUtils]: 11: Hoare triple {19433#(or (<= (mod (+ main_~x~0 3) 4294967296) 0) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19429#(or (<= (mod (+ main_~x~0 2) 4294967296) 0) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:04:02,061 INFO L290 TraceCheckUtils]: 10: Hoare triple {19433#(or (<= (mod (+ main_~x~0 3) 4294967296) 0) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} ~z~0 := ~y~0; {19433#(or (<= (mod (+ main_~x~0 3) 4294967296) 0) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:04:02,062 INFO L290 TraceCheckUtils]: 9: Hoare triple {19440#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {19433#(or (<= (mod (+ main_~x~0 3) 4294967296) 0) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:04:02,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {19444#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19440#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:04:02,064 INFO L290 TraceCheckUtils]: 7: Hoare triple {19448#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19444#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-08 10:04:02,065 INFO L290 TraceCheckUtils]: 6: Hoare triple {19452#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {19448#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296)))} is VALID [2022-04-08 10:04:02,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {19268#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19452#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:04:02,065 INFO L272 TraceCheckUtils]: 4: Hoare triple {19268#true} call #t~ret13 := main(); {19268#true} is VALID [2022-04-08 10:04:02,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19268#true} {19268#true} #72#return; {19268#true} is VALID [2022-04-08 10:04:02,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {19268#true} assume true; {19268#true} is VALID [2022-04-08 10:04:02,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {19268#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19268#true} is VALID [2022-04-08 10:04:02,065 INFO L272 TraceCheckUtils]: 0: Hoare triple {19268#true} call ULTIMATE.init(); {19268#true} is VALID [2022-04-08 10:04:02,066 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:04:02,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359062398] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:04:02,066 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:04:02,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 18] total 41 [2022-04-08 10:04:02,066 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:04:02,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [818021189] [2022-04-08 10:04:02,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [818021189] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:04:02,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:04:02,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 10:04:02,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927563318] [2022-04-08 10:04:02,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:04:02,067 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 13 states have internal predecessors, (22), 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 27 [2022-04-08 10:04:02,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:04:02,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 13 states have internal predecessors, (22), 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-08 10:04:02,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:02,086 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 10:04:02,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:02,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 10:04:02,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1415, Unknown=0, NotChecked=0, Total=1640 [2022-04-08 10:04:02,087 INFO L87 Difference]: Start difference. First operand 143 states and 194 transitions. Second operand has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 13 states have internal predecessors, (22), 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-08 10:04:03,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:03,651 INFO L93 Difference]: Finished difference Result 156 states and 207 transitions. [2022-04-08 10:04:03,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 10:04:03,651 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 13 states have internal predecessors, (22), 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 27 [2022-04-08 10:04:03,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:04:03,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 13 states have internal predecessors, (22), 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-08 10:04:03,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 42 transitions. [2022-04-08 10:04:03,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 13 states have internal predecessors, (22), 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-08 10:04:03,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 42 transitions. [2022-04-08 10:04:03,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 42 transitions. [2022-04-08 10:04:03,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:03,690 INFO L225 Difference]: With dead ends: 156 [2022-04-08 10:04:03,690 INFO L226 Difference]: Without dead ends: 151 [2022-04-08 10:04:03,691 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=337, Invalid=2419, Unknown=0, NotChecked=0, Total=2756 [2022-04-08 10:04:03,695 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 26 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:04:03,695 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 68 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:04:03,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-04-08 10:04:03,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2022-04-08 10:04:03,962 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:04:03,962 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states. Second operand has 148 states, 143 states have (on average 1.3636363636363635) internal successors, (195), 143 states have internal predecessors, (195), 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-08 10:04:03,962 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand has 148 states, 143 states have (on average 1.3636363636363635) internal successors, (195), 143 states have internal predecessors, (195), 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-08 10:04:03,963 INFO L87 Difference]: Start difference. First operand 151 states. Second operand has 148 states, 143 states have (on average 1.3636363636363635) internal successors, (195), 143 states have internal predecessors, (195), 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-08 10:04:03,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:03,964 INFO L93 Difference]: Finished difference Result 151 states and 202 transitions. [2022-04-08 10:04:03,964 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 202 transitions. [2022-04-08 10:04:03,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:03,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:03,968 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.3636363636363635) internal successors, (195), 143 states have internal predecessors, (195), 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 151 states. [2022-04-08 10:04:03,968 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.3636363636363635) internal successors, (195), 143 states have internal predecessors, (195), 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 151 states. [2022-04-08 10:04:03,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:03,971 INFO L93 Difference]: Finished difference Result 151 states and 202 transitions. [2022-04-08 10:04:03,971 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 202 transitions. [2022-04-08 10:04:03,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:03,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:03,987 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:04:03,987 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:04:03,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.3636363636363635) internal successors, (195), 143 states have internal predecessors, (195), 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-08 10:04:03,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 199 transitions. [2022-04-08 10:04:03,989 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 199 transitions. Word has length 27 [2022-04-08 10:04:03,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:04:03,989 INFO L478 AbstractCegarLoop]: Abstraction has 148 states and 199 transitions. [2022-04-08 10:04:03,989 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 13 states have internal predecessors, (22), 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-08 10:04:03,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 199 transitions. [2022-04-08 10:04:06,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 198 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:06,439 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 199 transitions. [2022-04-08 10:04:06,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 10:04:06,439 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:04:06,439 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:04:06,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-08 10:04:06,639 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-08 10:04:06,640 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:04:06,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:04:06,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1740747864, now seen corresponding path program 19 times [2022-04-08 10:04:06,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:06,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [431863952] [2022-04-08 10:04:06,642 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:04:06,642 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:04:06,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1740747864, now seen corresponding path program 20 times [2022-04-08 10:04:06,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:04:06,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648831058] [2022-04-08 10:04:06,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:04:06,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:04:06,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:06,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:04:06,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:06,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {20420#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20407#true} is VALID [2022-04-08 10:04:06,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {20407#true} assume true; {20407#true} is VALID [2022-04-08 10:04:06,752 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20407#true} {20407#true} #72#return; {20407#true} is VALID [2022-04-08 10:04:06,752 INFO L272 TraceCheckUtils]: 0: Hoare triple {20407#true} call ULTIMATE.init(); {20420#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:04:06,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {20420#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20407#true} is VALID [2022-04-08 10:04:06,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {20407#true} assume true; {20407#true} is VALID [2022-04-08 10:04:06,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20407#true} {20407#true} #72#return; {20407#true} is VALID [2022-04-08 10:04:06,752 INFO L272 TraceCheckUtils]: 4: Hoare triple {20407#true} call #t~ret13 := main(); {20407#true} is VALID [2022-04-08 10:04:06,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {20407#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20412#(= main_~y~0 0)} is VALID [2022-04-08 10:04:06,753 INFO L290 TraceCheckUtils]: 6: Hoare triple {20412#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20413#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:06,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {20413#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20414#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:06,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {20414#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20415#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:06,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {20415#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20416#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:06,755 INFO L290 TraceCheckUtils]: 10: Hoare triple {20416#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {20416#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:06,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {20416#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {20417#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:04:06,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {20417#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20418#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:04:06,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {20418#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20419#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-08 10:04:06,757 INFO L290 TraceCheckUtils]: 14: Hoare triple {20419#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {20408#false} is VALID [2022-04-08 10:04:06,757 INFO L290 TraceCheckUtils]: 15: Hoare triple {20408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20408#false} is VALID [2022-04-08 10:04:06,757 INFO L290 TraceCheckUtils]: 16: Hoare triple {20408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20408#false} is VALID [2022-04-08 10:04:06,757 INFO L290 TraceCheckUtils]: 17: Hoare triple {20408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20408#false} is VALID [2022-04-08 10:04:06,757 INFO L290 TraceCheckUtils]: 18: Hoare triple {20408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20408#false} is VALID [2022-04-08 10:04:06,757 INFO L290 TraceCheckUtils]: 19: Hoare triple {20408#false} assume !(~y~0 % 4294967296 > 0); {20408#false} is VALID [2022-04-08 10:04:06,757 INFO L290 TraceCheckUtils]: 20: Hoare triple {20408#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20408#false} is VALID [2022-04-08 10:04:06,757 INFO L290 TraceCheckUtils]: 21: Hoare triple {20408#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20408#false} is VALID [2022-04-08 10:04:06,757 INFO L290 TraceCheckUtils]: 22: Hoare triple {20408#false} assume !(~x~0 % 4294967296 > 0); {20408#false} is VALID [2022-04-08 10:04:06,757 INFO L272 TraceCheckUtils]: 23: Hoare triple {20408#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {20408#false} is VALID [2022-04-08 10:04:06,757 INFO L290 TraceCheckUtils]: 24: Hoare triple {20408#false} ~cond := #in~cond; {20408#false} is VALID [2022-04-08 10:04:06,757 INFO L290 TraceCheckUtils]: 25: Hoare triple {20408#false} assume 0 == ~cond; {20408#false} is VALID [2022-04-08 10:04:06,757 INFO L290 TraceCheckUtils]: 26: Hoare triple {20408#false} assume !false; {20408#false} is VALID [2022-04-08 10:04:06,757 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-08 10:04:06,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:04:06,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648831058] [2022-04-08 10:04:06,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648831058] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:04:06,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624801921] [2022-04-08 10:04:06,758 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:04:06,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:06,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:04:06,759 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:04:06,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-08 10:04:06,792 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:04:06,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:04:06,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-08 10:04:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:06,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:04:06,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {20407#true} call ULTIMATE.init(); {20407#true} is VALID [2022-04-08 10:04:06,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {20407#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20407#true} is VALID [2022-04-08 10:04:06,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {20407#true} assume true; {20407#true} is VALID [2022-04-08 10:04:06,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20407#true} {20407#true} #72#return; {20407#true} is VALID [2022-04-08 10:04:06,940 INFO L272 TraceCheckUtils]: 4: Hoare triple {20407#true} call #t~ret13 := main(); {20407#true} is VALID [2022-04-08 10:04:06,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {20407#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20412#(= main_~y~0 0)} is VALID [2022-04-08 10:04:06,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {20412#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20413#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:06,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {20413#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20414#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:06,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {20414#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20415#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:06,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {20415#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20416#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:06,943 INFO L290 TraceCheckUtils]: 10: Hoare triple {20416#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {20416#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:06,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {20416#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {20457#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:06,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {20457#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20461#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:04:06,944 INFO L290 TraceCheckUtils]: 13: Hoare triple {20461#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20465#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:06,944 INFO L290 TraceCheckUtils]: 14: Hoare triple {20465#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {20408#false} is VALID [2022-04-08 10:04:06,944 INFO L290 TraceCheckUtils]: 15: Hoare triple {20408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20408#false} is VALID [2022-04-08 10:04:06,945 INFO L290 TraceCheckUtils]: 16: Hoare triple {20408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20408#false} is VALID [2022-04-08 10:04:06,945 INFO L290 TraceCheckUtils]: 17: Hoare triple {20408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20408#false} is VALID [2022-04-08 10:04:06,945 INFO L290 TraceCheckUtils]: 18: Hoare triple {20408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20408#false} is VALID [2022-04-08 10:04:06,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {20408#false} assume !(~y~0 % 4294967296 > 0); {20408#false} is VALID [2022-04-08 10:04:06,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {20408#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20408#false} is VALID [2022-04-08 10:04:06,945 INFO L290 TraceCheckUtils]: 21: Hoare triple {20408#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20408#false} is VALID [2022-04-08 10:04:06,945 INFO L290 TraceCheckUtils]: 22: Hoare triple {20408#false} assume !(~x~0 % 4294967296 > 0); {20408#false} is VALID [2022-04-08 10:04:06,945 INFO L272 TraceCheckUtils]: 23: Hoare triple {20408#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {20408#false} is VALID [2022-04-08 10:04:06,945 INFO L290 TraceCheckUtils]: 24: Hoare triple {20408#false} ~cond := #in~cond; {20408#false} is VALID [2022-04-08 10:04:06,945 INFO L290 TraceCheckUtils]: 25: Hoare triple {20408#false} assume 0 == ~cond; {20408#false} is VALID [2022-04-08 10:04:06,945 INFO L290 TraceCheckUtils]: 26: Hoare triple {20408#false} assume !false; {20408#false} is VALID [2022-04-08 10:04:06,945 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-08 10:04:06,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:04:07,100 INFO L290 TraceCheckUtils]: 26: Hoare triple {20408#false} assume !false; {20408#false} is VALID [2022-04-08 10:04:07,100 INFO L290 TraceCheckUtils]: 25: Hoare triple {20408#false} assume 0 == ~cond; {20408#false} is VALID [2022-04-08 10:04:07,100 INFO L290 TraceCheckUtils]: 24: Hoare triple {20408#false} ~cond := #in~cond; {20408#false} is VALID [2022-04-08 10:04:07,100 INFO L272 TraceCheckUtils]: 23: Hoare triple {20408#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {20408#false} is VALID [2022-04-08 10:04:07,100 INFO L290 TraceCheckUtils]: 22: Hoare triple {20408#false} assume !(~x~0 % 4294967296 > 0); {20408#false} is VALID [2022-04-08 10:04:07,100 INFO L290 TraceCheckUtils]: 21: Hoare triple {20408#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20408#false} is VALID [2022-04-08 10:04:07,100 INFO L290 TraceCheckUtils]: 20: Hoare triple {20408#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20408#false} is VALID [2022-04-08 10:04:07,100 INFO L290 TraceCheckUtils]: 19: Hoare triple {20408#false} assume !(~y~0 % 4294967296 > 0); {20408#false} is VALID [2022-04-08 10:04:07,100 INFO L290 TraceCheckUtils]: 18: Hoare triple {20408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20408#false} is VALID [2022-04-08 10:04:07,101 INFO L290 TraceCheckUtils]: 17: Hoare triple {20532#(<= (mod main_~y~0 4294967296) 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20408#false} is VALID [2022-04-08 10:04:07,101 INFO L290 TraceCheckUtils]: 16: Hoare triple {20536#(<= (mod (+ main_~y~0 4294967295) 4294967296) 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20532#(<= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-08 10:04:07,102 INFO L290 TraceCheckUtils]: 15: Hoare triple {20540#(<= (mod (+ main_~y~0 4294967294) 4294967296) 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20536#(<= (mod (+ main_~y~0 4294967295) 4294967296) 0)} is VALID [2022-04-08 10:04:07,102 INFO L290 TraceCheckUtils]: 14: Hoare triple {20544#(or (< 0 (mod main_~z~0 4294967296)) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {20540#(<= (mod (+ main_~y~0 4294967294) 4294967296) 0)} is VALID [2022-04-08 10:04:07,103 INFO L290 TraceCheckUtils]: 13: Hoare triple {20548#(or (<= (mod (+ main_~y~0 4294967294) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20544#(or (< 0 (mod main_~z~0 4294967296)) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-08 10:04:07,104 INFO L290 TraceCheckUtils]: 12: Hoare triple {20552#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20548#(or (<= (mod (+ main_~y~0 4294967294) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:04:07,104 INFO L290 TraceCheckUtils]: 11: Hoare triple {20407#true} ~z~0 := ~y~0; {20552#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-08 10:04:07,104 INFO L290 TraceCheckUtils]: 10: Hoare triple {20407#true} assume !(~x~0 % 4294967296 > 0); {20407#true} is VALID [2022-04-08 10:04:07,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {20407#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20407#true} is VALID [2022-04-08 10:04:07,104 INFO L290 TraceCheckUtils]: 8: Hoare triple {20407#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20407#true} is VALID [2022-04-08 10:04:07,105 INFO L290 TraceCheckUtils]: 7: Hoare triple {20407#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20407#true} is VALID [2022-04-08 10:04:07,105 INFO L290 TraceCheckUtils]: 6: Hoare triple {20407#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {20407#true} is VALID [2022-04-08 10:04:07,105 INFO L290 TraceCheckUtils]: 5: Hoare triple {20407#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20407#true} is VALID [2022-04-08 10:04:07,105 INFO L272 TraceCheckUtils]: 4: Hoare triple {20407#true} call #t~ret13 := main(); {20407#true} is VALID [2022-04-08 10:04:07,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20407#true} {20407#true} #72#return; {20407#true} is VALID [2022-04-08 10:04:07,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {20407#true} assume true; {20407#true} is VALID [2022-04-08 10:04:07,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {20407#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {20407#true} is VALID [2022-04-08 10:04:07,105 INFO L272 TraceCheckUtils]: 0: Hoare triple {20407#true} call ULTIMATE.init(); {20407#true} is VALID [2022-04-08 10:04:07,105 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-08 10:04:07,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624801921] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:04:07,105 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:04:07,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 8] total 20 [2022-04-08 10:04:07,105 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:04:07,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [431863952] [2022-04-08 10:04:07,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [431863952] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:04:07,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:04:07,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 10:04:07,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012270878] [2022-04-08 10:04:07,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:04:07,106 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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 27 [2022-04-08 10:04:07,106 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:04:07,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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-08 10:04:07,119 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:07,119 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 10:04:07,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:07,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 10:04:07,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2022-04-08 10:04:07,120 INFO L87 Difference]: Start difference. First operand 148 states and 199 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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-08 10:04:08,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:08,192 INFO L93 Difference]: Finished difference Result 187 states and 242 transitions. [2022-04-08 10:04:08,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 10:04:08,192 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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 27 [2022-04-08 10:04:08,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:04:08,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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-08 10:04:08,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-04-08 10:04:08,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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-08 10:04:08,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 66 transitions. [2022-04-08 10:04:08,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 66 transitions. [2022-04-08 10:04:08,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:08,244 INFO L225 Difference]: With dead ends: 187 [2022-04-08 10:04:08,244 INFO L226 Difference]: Without dead ends: 174 [2022-04-08 10:04:08,245 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2022-04-08 10:04:08,245 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 34 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:04:08,245 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 60 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:04:08,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-04-08 10:04:08,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 148. [2022-04-08 10:04:08,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:04:08,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand has 148 states, 143 states have (on average 1.3566433566433567) internal successors, (194), 143 states have internal predecessors, (194), 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-08 10:04:08,555 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand has 148 states, 143 states have (on average 1.3566433566433567) internal successors, (194), 143 states have internal predecessors, (194), 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-08 10:04:08,555 INFO L87 Difference]: Start difference. First operand 174 states. Second operand has 148 states, 143 states have (on average 1.3566433566433567) internal successors, (194), 143 states have internal predecessors, (194), 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-08 10:04:08,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:08,557 INFO L93 Difference]: Finished difference Result 174 states and 229 transitions. [2022-04-08 10:04:08,557 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 229 transitions. [2022-04-08 10:04:08,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:08,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:08,557 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.3566433566433567) internal successors, (194), 143 states have internal predecessors, (194), 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 174 states. [2022-04-08 10:04:08,558 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.3566433566433567) internal successors, (194), 143 states have internal predecessors, (194), 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 174 states. [2022-04-08 10:04:08,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:08,559 INFO L93 Difference]: Finished difference Result 174 states and 229 transitions. [2022-04-08 10:04:08,559 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 229 transitions. [2022-04-08 10:04:08,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:08,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:08,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:04:08,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:04:08,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.3566433566433567) internal successors, (194), 143 states have internal predecessors, (194), 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-08 10:04:08,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 198 transitions. [2022-04-08 10:04:08,561 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 198 transitions. Word has length 27 [2022-04-08 10:04:08,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:04:08,561 INFO L478 AbstractCegarLoop]: Abstraction has 148 states and 198 transitions. [2022-04-08 10:04:08,561 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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-08 10:04:08,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 198 transitions. [2022-04-08 10:04:09,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:09,109 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 198 transitions. [2022-04-08 10:04:09,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 10:04:09,109 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:04:09,109 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:04:09,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-08 10:04:09,315 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:09,315 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:04:09,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:04:09,316 INFO L85 PathProgramCache]: Analyzing trace with hash -734568360, now seen corresponding path program 13 times [2022-04-08 10:04:09,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:09,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1824821609] [2022-04-08 10:04:09,323 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:04:09,323 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:04:09,323 INFO L85 PathProgramCache]: Analyzing trace with hash -734568360, now seen corresponding path program 14 times [2022-04-08 10:04:09,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:04:09,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383003518] [2022-04-08 10:04:09,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:04:09,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:04:09,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:09,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:04:09,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:09,417 INFO L290 TraceCheckUtils]: 0: Hoare triple {21642#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {21629#true} is VALID [2022-04-08 10:04:09,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {21629#true} assume true; {21629#true} is VALID [2022-04-08 10:04:09,417 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21629#true} {21629#true} #72#return; {21629#true} is VALID [2022-04-08 10:04:09,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {21629#true} call ULTIMATE.init(); {21642#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:04:09,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {21642#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {21629#true} is VALID [2022-04-08 10:04:09,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {21629#true} assume true; {21629#true} is VALID [2022-04-08 10:04:09,418 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21629#true} {21629#true} #72#return; {21629#true} is VALID [2022-04-08 10:04:09,418 INFO L272 TraceCheckUtils]: 4: Hoare triple {21629#true} call #t~ret13 := main(); {21629#true} is VALID [2022-04-08 10:04:09,418 INFO L290 TraceCheckUtils]: 5: Hoare triple {21629#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21629#true} is VALID [2022-04-08 10:04:09,419 INFO L290 TraceCheckUtils]: 6: Hoare triple {21629#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21634#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:04:09,420 INFO L290 TraceCheckUtils]: 7: Hoare triple {21634#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21635#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-08 10:04:09,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {21635#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21636#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:04:09,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {21636#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21637#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:04:09,422 INFO L290 TraceCheckUtils]: 10: Hoare triple {21637#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {21637#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:04:09,422 INFO L290 TraceCheckUtils]: 11: Hoare triple {21637#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {21637#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:04:09,423 INFO L290 TraceCheckUtils]: 12: Hoare triple {21637#(<= (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21638#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 1) main_~x~0)} is VALID [2022-04-08 10:04:09,424 INFO L290 TraceCheckUtils]: 13: Hoare triple {21638#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21639#(<= (+ 2 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:04:09,424 INFO L290 TraceCheckUtils]: 14: Hoare triple {21639#(<= (+ 2 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21640#(<= (+ 3 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:04:09,425 INFO L290 TraceCheckUtils]: 15: Hoare triple {21640#(<= (+ 3 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21641#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:04:09,425 INFO L290 TraceCheckUtils]: 16: Hoare triple {21641#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {21641#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:04:09,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {21641#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21641#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:04:09,426 INFO L290 TraceCheckUtils]: 18: Hoare triple {21641#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21641#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:04:09,426 INFO L290 TraceCheckUtils]: 19: Hoare triple {21641#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21641#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:04:09,427 INFO L290 TraceCheckUtils]: 20: Hoare triple {21641#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21641#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:04:09,427 INFO L290 TraceCheckUtils]: 21: Hoare triple {21641#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {21641#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:04:09,428 INFO L290 TraceCheckUtils]: 22: Hoare triple {21641#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {21630#false} is VALID [2022-04-08 10:04:09,428 INFO L272 TraceCheckUtils]: 23: Hoare triple {21630#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {21630#false} is VALID [2022-04-08 10:04:09,428 INFO L290 TraceCheckUtils]: 24: Hoare triple {21630#false} ~cond := #in~cond; {21630#false} is VALID [2022-04-08 10:04:09,428 INFO L290 TraceCheckUtils]: 25: Hoare triple {21630#false} assume 0 == ~cond; {21630#false} is VALID [2022-04-08 10:04:09,428 INFO L290 TraceCheckUtils]: 26: Hoare triple {21630#false} assume !false; {21630#false} is VALID [2022-04-08 10:04:09,428 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 10:04:09,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:04:09,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383003518] [2022-04-08 10:04:09,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383003518] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:04:09,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925063702] [2022-04-08 10:04:09,428 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:04:09,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:09,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:04:09,429 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:04:09,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-08 10:04:09,470 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:04:09,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:04:09,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 10:04:09,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:09,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:04:09,825 INFO L272 TraceCheckUtils]: 0: Hoare triple {21629#true} call ULTIMATE.init(); {21629#true} is VALID [2022-04-08 10:04:09,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {21629#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {21629#true} is VALID [2022-04-08 10:04:09,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {21629#true} assume true; {21629#true} is VALID [2022-04-08 10:04:09,826 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21629#true} {21629#true} #72#return; {21629#true} is VALID [2022-04-08 10:04:09,826 INFO L272 TraceCheckUtils]: 4: Hoare triple {21629#true} call #t~ret13 := main(); {21629#true} is VALID [2022-04-08 10:04:09,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {21629#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21661#(= main_~n~0 main_~x~0)} is VALID [2022-04-08 10:04:09,826 INFO L290 TraceCheckUtils]: 6: Hoare triple {21661#(= main_~n~0 main_~x~0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21665#(= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-08 10:04:09,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {21665#(= (+ main_~x~0 1) main_~n~0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21669#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} is VALID [2022-04-08 10:04:09,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {21669#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21673#(= (+ (- 1) main_~n~0) (+ main_~x~0 2))} is VALID [2022-04-08 10:04:09,827 INFO L290 TraceCheckUtils]: 9: Hoare triple {21673#(= (+ (- 1) main_~n~0) (+ main_~x~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21677#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} is VALID [2022-04-08 10:04:09,828 INFO L290 TraceCheckUtils]: 10: Hoare triple {21677#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} assume !(~x~0 % 4294967296 > 0); {21677#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} is VALID [2022-04-08 10:04:09,828 INFO L290 TraceCheckUtils]: 11: Hoare triple {21677#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} ~z~0 := ~y~0; {21677#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} is VALID [2022-04-08 10:04:09,828 INFO L290 TraceCheckUtils]: 12: Hoare triple {21677#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21673#(= (+ (- 1) main_~n~0) (+ main_~x~0 2))} is VALID [2022-04-08 10:04:09,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {21673#(= (+ (- 1) main_~n~0) (+ main_~x~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21669#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} is VALID [2022-04-08 10:04:09,829 INFO L290 TraceCheckUtils]: 14: Hoare triple {21669#(= (+ main_~x~0 1) (+ (- 1) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21665#(= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-08 10:04:09,829 INFO L290 TraceCheckUtils]: 15: Hoare triple {21665#(= (+ main_~x~0 1) main_~n~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21661#(= main_~n~0 main_~x~0)} is VALID [2022-04-08 10:04:09,830 INFO L290 TraceCheckUtils]: 16: Hoare triple {21661#(= main_~n~0 main_~x~0)} assume !(~z~0 % 4294967296 > 0); {21661#(= main_~n~0 main_~x~0)} is VALID [2022-04-08 10:04:09,830 INFO L290 TraceCheckUtils]: 17: Hoare triple {21661#(= main_~n~0 main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21661#(= main_~n~0 main_~x~0)} is VALID [2022-04-08 10:04:09,830 INFO L290 TraceCheckUtils]: 18: Hoare triple {21661#(= main_~n~0 main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21661#(= main_~n~0 main_~x~0)} is VALID [2022-04-08 10:04:09,830 INFO L290 TraceCheckUtils]: 19: Hoare triple {21661#(= main_~n~0 main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21661#(= main_~n~0 main_~x~0)} is VALID [2022-04-08 10:04:09,832 INFO L290 TraceCheckUtils]: 20: Hoare triple {21661#(= main_~n~0 main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21661#(= main_~n~0 main_~x~0)} is VALID [2022-04-08 10:04:09,833 INFO L290 TraceCheckUtils]: 21: Hoare triple {21661#(= main_~n~0 main_~x~0)} assume !(~y~0 % 4294967296 > 0); {21714#(and (= main_~n~0 main_~x~0) (not (< 0 (mod main_~y~0 4294967296))))} is VALID [2022-04-08 10:04:09,833 INFO L290 TraceCheckUtils]: 22: Hoare triple {21714#(and (= main_~n~0 main_~x~0) (not (< 0 (mod main_~y~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {21718#(and (not (< 0 (mod main_~y~0 4294967296))) (not (< 0 (mod main_~n~0 4294967296))))} is VALID [2022-04-08 10:04:09,833 INFO L272 TraceCheckUtils]: 23: Hoare triple {21718#(and (not (< 0 (mod main_~y~0 4294967296))) (not (< 0 (mod main_~n~0 4294967296))))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {21722#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:04:09,834 INFO L290 TraceCheckUtils]: 24: Hoare triple {21722#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21726#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:04:09,834 INFO L290 TraceCheckUtils]: 25: Hoare triple {21726#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21630#false} is VALID [2022-04-08 10:04:09,834 INFO L290 TraceCheckUtils]: 26: Hoare triple {21630#false} assume !false; {21630#false} is VALID [2022-04-08 10:04:09,834 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 10:04:09,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:04:10,178 INFO L290 TraceCheckUtils]: 26: Hoare triple {21630#false} assume !false; {21630#false} is VALID [2022-04-08 10:04:10,178 INFO L290 TraceCheckUtils]: 25: Hoare triple {21726#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21630#false} is VALID [2022-04-08 10:04:10,179 INFO L290 TraceCheckUtils]: 24: Hoare triple {21722#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21726#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:04:10,179 INFO L272 TraceCheckUtils]: 23: Hoare triple {21742#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {21722#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:04:10,179 INFO L290 TraceCheckUtils]: 22: Hoare triple {21746#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {21742#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:04:10,180 INFO L290 TraceCheckUtils]: 21: Hoare triple {21750#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {21746#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:04:10,180 INFO L290 TraceCheckUtils]: 20: Hoare triple {21750#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21750#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-08 10:04:10,180 INFO L290 TraceCheckUtils]: 19: Hoare triple {21750#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21750#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-08 10:04:10,180 INFO L290 TraceCheckUtils]: 18: Hoare triple {21750#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21750#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-08 10:04:10,180 INFO L290 TraceCheckUtils]: 17: Hoare triple {21750#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {21750#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-08 10:04:10,181 INFO L290 TraceCheckUtils]: 16: Hoare triple {21750#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {21750#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-08 10:04:10,181 INFO L290 TraceCheckUtils]: 15: Hoare triple {21769#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21750#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-08 10:04:10,182 INFO L290 TraceCheckUtils]: 14: Hoare triple {21773#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod (+ main_~x~0 2) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21769#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-08 10:04:10,182 INFO L290 TraceCheckUtils]: 13: Hoare triple {21777#(or (< 0 (mod (+ main_~x~0 3) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21773#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod (+ main_~x~0 2) 4294967296)))} is VALID [2022-04-08 10:04:10,183 INFO L290 TraceCheckUtils]: 12: Hoare triple {21781#(or (< 0 (mod (+ main_~x~0 4) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {21777#(or (< 0 (mod (+ main_~x~0 3) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-08 10:04:10,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {21781#(or (< 0 (mod (+ main_~x~0 4) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} ~z~0 := ~y~0; {21781#(or (< 0 (mod (+ main_~x~0 4) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-08 10:04:10,183 INFO L290 TraceCheckUtils]: 10: Hoare triple {21781#(or (< 0 (mod (+ main_~x~0 4) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {21781#(or (< 0 (mod (+ main_~x~0 4) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-08 10:04:10,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {21777#(or (< 0 (mod (+ main_~x~0 3) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21781#(or (< 0 (mod (+ main_~x~0 4) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-08 10:04:10,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {21773#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod (+ main_~x~0 2) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21777#(or (< 0 (mod (+ main_~x~0 3) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-08 10:04:10,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {21769#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21773#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod (+ main_~x~0 2) 4294967296)))} is VALID [2022-04-08 10:04:10,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {21750#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {21769#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-08 10:04:10,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {21629#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21750#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-08 10:04:10,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {21629#true} call #t~ret13 := main(); {21629#true} is VALID [2022-04-08 10:04:10,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21629#true} {21629#true} #72#return; {21629#true} is VALID [2022-04-08 10:04:10,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {21629#true} assume true; {21629#true} is VALID [2022-04-08 10:04:10,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {21629#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {21629#true} is VALID [2022-04-08 10:04:10,186 INFO L272 TraceCheckUtils]: 0: Hoare triple {21629#true} call ULTIMATE.init(); {21629#true} is VALID [2022-04-08 10:04:10,186 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 10:04:10,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925063702] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:04:10,187 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:04:10,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2022-04-08 10:04:10,187 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:04:10,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1824821609] [2022-04-08 10:04:10,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1824821609] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:04:10,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:04:10,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 10:04:10,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381298270] [2022-04-08 10:04:10,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:04:10,187 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 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 27 [2022-04-08 10:04:10,187 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:04:10,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 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-08 10:04:10,199 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:10,199 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 10:04:10,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:10,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 10:04:10,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2022-04-08 10:04:10,200 INFO L87 Difference]: Start difference. First operand 148 states and 198 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 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-08 10:04:11,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:11,084 INFO L93 Difference]: Finished difference Result 186 states and 253 transitions. [2022-04-08 10:04:11,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 10:04:11,084 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 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 27 [2022-04-08 10:04:11,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:04:11,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 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-08 10:04:11,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-08 10:04:11,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 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-08 10:04:11,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-08 10:04:11,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 64 transitions. [2022-04-08 10:04:11,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:11,146 INFO L225 Difference]: With dead ends: 186 [2022-04-08 10:04:11,146 INFO L226 Difference]: Without dead ends: 181 [2022-04-08 10:04:11,147 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=1007, Unknown=0, NotChecked=0, Total=1190 [2022-04-08 10:04:11,147 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 70 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:04:11,147 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 44 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:04:11,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-04-08 10:04:11,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 166. [2022-04-08 10:04:11,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:04:11,488 INFO L82 GeneralOperation]: Start isEquivalent. First operand 181 states. Second operand has 166 states, 161 states have (on average 1.3788819875776397) internal successors, (222), 161 states have internal predecessors, (222), 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-08 10:04:11,488 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand has 166 states, 161 states have (on average 1.3788819875776397) internal successors, (222), 161 states have internal predecessors, (222), 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-08 10:04:11,488 INFO L87 Difference]: Start difference. First operand 181 states. Second operand has 166 states, 161 states have (on average 1.3788819875776397) internal successors, (222), 161 states have internal predecessors, (222), 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-08 10:04:11,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:11,490 INFO L93 Difference]: Finished difference Result 181 states and 245 transitions. [2022-04-08 10:04:11,490 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 245 transitions. [2022-04-08 10:04:11,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:11,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:11,490 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 161 states have (on average 1.3788819875776397) internal successors, (222), 161 states have internal predecessors, (222), 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 181 states. [2022-04-08 10:04:11,491 INFO L87 Difference]: Start difference. First operand has 166 states, 161 states have (on average 1.3788819875776397) internal successors, (222), 161 states have internal predecessors, (222), 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 181 states. [2022-04-08 10:04:11,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:11,492 INFO L93 Difference]: Finished difference Result 181 states and 245 transitions. [2022-04-08 10:04:11,492 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 245 transitions. [2022-04-08 10:04:11,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:11,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:11,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:04:11,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:04:11,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 161 states have (on average 1.3788819875776397) internal successors, (222), 161 states have internal predecessors, (222), 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-08 10:04:11,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 226 transitions. [2022-04-08 10:04:11,495 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 226 transitions. Word has length 27 [2022-04-08 10:04:11,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:04:11,495 INFO L478 AbstractCegarLoop]: Abstraction has 166 states and 226 transitions. [2022-04-08 10:04:11,495 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 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-08 10:04:11,495 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 166 states and 226 transitions. [2022-04-08 10:04:12,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:12,443 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 226 transitions. [2022-04-08 10:04:12,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 10:04:12,443 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:04:12,443 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:04:12,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-08 10:04:12,659 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:12,659 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:04:12,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:04:12,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1224419256, now seen corresponding path program 21 times [2022-04-08 10:04:12,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:12,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [714334358] [2022-04-08 10:04:12,662 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:04:12,662 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:04:12,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1224419256, now seen corresponding path program 22 times [2022-04-08 10:04:12,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:04:12,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882836635] [2022-04-08 10:04:12,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:04:12,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:04:12,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:12,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:04:12,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:12,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {22915#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {22902#true} is VALID [2022-04-08 10:04:12,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {22902#true} assume true; {22902#true} is VALID [2022-04-08 10:04:12,772 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22902#true} {22902#true} #72#return; {22902#true} is VALID [2022-04-08 10:04:12,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {22902#true} call ULTIMATE.init(); {22915#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:04:12,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {22915#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {22902#true} is VALID [2022-04-08 10:04:12,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {22902#true} assume true; {22902#true} is VALID [2022-04-08 10:04:12,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22902#true} {22902#true} #72#return; {22902#true} is VALID [2022-04-08 10:04:12,773 INFO L272 TraceCheckUtils]: 4: Hoare triple {22902#true} call #t~ret13 := main(); {22902#true} is VALID [2022-04-08 10:04:12,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {22902#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22907#(= main_~y~0 0)} is VALID [2022-04-08 10:04:12,773 INFO L290 TraceCheckUtils]: 6: Hoare triple {22907#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22908#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:12,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {22908#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22909#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:12,774 INFO L290 TraceCheckUtils]: 8: Hoare triple {22909#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22910#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:12,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {22910#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22911#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:12,775 INFO L290 TraceCheckUtils]: 10: Hoare triple {22911#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22912#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:12,776 INFO L290 TraceCheckUtils]: 11: Hoare triple {22912#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {22912#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:12,776 INFO L290 TraceCheckUtils]: 12: Hoare triple {22912#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {22913#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:04:12,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {22913#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22914#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:04:12,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {22914#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {22903#false} is VALID [2022-04-08 10:04:12,777 INFO L290 TraceCheckUtils]: 15: Hoare triple {22903#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22903#false} is VALID [2022-04-08 10:04:12,777 INFO L290 TraceCheckUtils]: 16: Hoare triple {22903#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22903#false} is VALID [2022-04-08 10:04:12,777 INFO L290 TraceCheckUtils]: 17: Hoare triple {22903#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22903#false} is VALID [2022-04-08 10:04:12,777 INFO L290 TraceCheckUtils]: 18: Hoare triple {22903#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22903#false} is VALID [2022-04-08 10:04:12,777 INFO L290 TraceCheckUtils]: 19: Hoare triple {22903#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22903#false} is VALID [2022-04-08 10:04:12,777 INFO L290 TraceCheckUtils]: 20: Hoare triple {22903#false} assume !(~y~0 % 4294967296 > 0); {22903#false} is VALID [2022-04-08 10:04:12,777 INFO L290 TraceCheckUtils]: 21: Hoare triple {22903#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {22903#false} is VALID [2022-04-08 10:04:12,777 INFO L290 TraceCheckUtils]: 22: Hoare triple {22903#false} assume !(~x~0 % 4294967296 > 0); {22903#false} is VALID [2022-04-08 10:04:12,777 INFO L272 TraceCheckUtils]: 23: Hoare triple {22903#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {22903#false} is VALID [2022-04-08 10:04:12,777 INFO L290 TraceCheckUtils]: 24: Hoare triple {22903#false} ~cond := #in~cond; {22903#false} is VALID [2022-04-08 10:04:12,777 INFO L290 TraceCheckUtils]: 25: Hoare triple {22903#false} assume 0 == ~cond; {22903#false} is VALID [2022-04-08 10:04:12,777 INFO L290 TraceCheckUtils]: 26: Hoare triple {22903#false} assume !false; {22903#false} is VALID [2022-04-08 10:04:12,778 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 10:04:12,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:04:12,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882836635] [2022-04-08 10:04:12,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882836635] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:04:12,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808128290] [2022-04-08 10:04:12,778 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:04:12,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:12,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:04:12,779 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:04:12,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-08 10:04:12,816 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:04:12,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:04:12,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 10:04:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:12,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:04:12,973 INFO L272 TraceCheckUtils]: 0: Hoare triple {22902#true} call ULTIMATE.init(); {22902#true} is VALID [2022-04-08 10:04:12,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {22902#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {22902#true} is VALID [2022-04-08 10:04:12,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {22902#true} assume true; {22902#true} is VALID [2022-04-08 10:04:12,978 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22902#true} {22902#true} #72#return; {22902#true} is VALID [2022-04-08 10:04:12,978 INFO L272 TraceCheckUtils]: 4: Hoare triple {22902#true} call #t~ret13 := main(); {22902#true} is VALID [2022-04-08 10:04:12,980 INFO L290 TraceCheckUtils]: 5: Hoare triple {22902#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22907#(= main_~y~0 0)} is VALID [2022-04-08 10:04:12,981 INFO L290 TraceCheckUtils]: 6: Hoare triple {22907#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22908#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:12,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {22908#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22909#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:12,982 INFO L290 TraceCheckUtils]: 8: Hoare triple {22909#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22910#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:12,983 INFO L290 TraceCheckUtils]: 9: Hoare triple {22910#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22911#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:12,983 INFO L290 TraceCheckUtils]: 10: Hoare triple {22911#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {22912#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:12,983 INFO L290 TraceCheckUtils]: 11: Hoare triple {22912#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {22912#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:12,985 INFO L290 TraceCheckUtils]: 12: Hoare triple {22912#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {22913#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:04:12,988 INFO L290 TraceCheckUtils]: 13: Hoare triple {22913#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22958#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:04:12,991 INFO L290 TraceCheckUtils]: 14: Hoare triple {22958#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {22903#false} is VALID [2022-04-08 10:04:12,991 INFO L290 TraceCheckUtils]: 15: Hoare triple {22903#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22903#false} is VALID [2022-04-08 10:04:12,991 INFO L290 TraceCheckUtils]: 16: Hoare triple {22903#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22903#false} is VALID [2022-04-08 10:04:12,991 INFO L290 TraceCheckUtils]: 17: Hoare triple {22903#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22903#false} is VALID [2022-04-08 10:04:12,991 INFO L290 TraceCheckUtils]: 18: Hoare triple {22903#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22903#false} is VALID [2022-04-08 10:04:12,991 INFO L290 TraceCheckUtils]: 19: Hoare triple {22903#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22903#false} is VALID [2022-04-08 10:04:12,991 INFO L290 TraceCheckUtils]: 20: Hoare triple {22903#false} assume !(~y~0 % 4294967296 > 0); {22903#false} is VALID [2022-04-08 10:04:12,991 INFO L290 TraceCheckUtils]: 21: Hoare triple {22903#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {22903#false} is VALID [2022-04-08 10:04:12,991 INFO L290 TraceCheckUtils]: 22: Hoare triple {22903#false} assume !(~x~0 % 4294967296 > 0); {22903#false} is VALID [2022-04-08 10:04:12,991 INFO L272 TraceCheckUtils]: 23: Hoare triple {22903#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {22903#false} is VALID [2022-04-08 10:04:12,991 INFO L290 TraceCheckUtils]: 24: Hoare triple {22903#false} ~cond := #in~cond; {22903#false} is VALID [2022-04-08 10:04:12,991 INFO L290 TraceCheckUtils]: 25: Hoare triple {22903#false} assume 0 == ~cond; {22903#false} is VALID [2022-04-08 10:04:12,991 INFO L290 TraceCheckUtils]: 26: Hoare triple {22903#false} assume !false; {22903#false} is VALID [2022-04-08 10:04:12,991 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 10:04:12,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:04:13,129 INFO L290 TraceCheckUtils]: 26: Hoare triple {22903#false} assume !false; {22903#false} is VALID [2022-04-08 10:04:13,130 INFO L290 TraceCheckUtils]: 25: Hoare triple {22903#false} assume 0 == ~cond; {22903#false} is VALID [2022-04-08 10:04:13,130 INFO L290 TraceCheckUtils]: 24: Hoare triple {22903#false} ~cond := #in~cond; {22903#false} is VALID [2022-04-08 10:04:13,130 INFO L272 TraceCheckUtils]: 23: Hoare triple {22903#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {22903#false} is VALID [2022-04-08 10:04:13,130 INFO L290 TraceCheckUtils]: 22: Hoare triple {22903#false} assume !(~x~0 % 4294967296 > 0); {22903#false} is VALID [2022-04-08 10:04:13,130 INFO L290 TraceCheckUtils]: 21: Hoare triple {22903#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {22903#false} is VALID [2022-04-08 10:04:13,130 INFO L290 TraceCheckUtils]: 20: Hoare triple {22903#false} assume !(~y~0 % 4294967296 > 0); {22903#false} is VALID [2022-04-08 10:04:13,130 INFO L290 TraceCheckUtils]: 19: Hoare triple {22903#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22903#false} is VALID [2022-04-08 10:04:13,130 INFO L290 TraceCheckUtils]: 18: Hoare triple {22903#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22903#false} is VALID [2022-04-08 10:04:13,130 INFO L290 TraceCheckUtils]: 17: Hoare triple {22903#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22903#false} is VALID [2022-04-08 10:04:13,130 INFO L290 TraceCheckUtils]: 16: Hoare triple {22903#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22903#false} is VALID [2022-04-08 10:04:13,130 INFO L290 TraceCheckUtils]: 15: Hoare triple {22903#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22903#false} is VALID [2022-04-08 10:04:13,130 INFO L290 TraceCheckUtils]: 14: Hoare triple {23034#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {22903#false} is VALID [2022-04-08 10:04:13,131 INFO L290 TraceCheckUtils]: 13: Hoare triple {23038#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23034#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:04:13,131 INFO L290 TraceCheckUtils]: 12: Hoare triple {23042#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {23038#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:13,132 INFO L290 TraceCheckUtils]: 11: Hoare triple {23042#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {23042#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:13,132 INFO L290 TraceCheckUtils]: 10: Hoare triple {23049#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23042#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:13,133 INFO L290 TraceCheckUtils]: 9: Hoare triple {23053#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23049#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:04:13,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {23057#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23053#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:04:13,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {23061#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23057#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:04:13,139 INFO L290 TraceCheckUtils]: 6: Hoare triple {23065#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {23061#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:04:13,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {22902#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23065#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:04:13,140 INFO L272 TraceCheckUtils]: 4: Hoare triple {22902#true} call #t~ret13 := main(); {22902#true} is VALID [2022-04-08 10:04:13,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22902#true} {22902#true} #72#return; {22902#true} is VALID [2022-04-08 10:04:13,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {22902#true} assume true; {22902#true} is VALID [2022-04-08 10:04:13,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {22902#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {22902#true} is VALID [2022-04-08 10:04:13,140 INFO L272 TraceCheckUtils]: 0: Hoare triple {22902#true} call ULTIMATE.init(); {22902#true} is VALID [2022-04-08 10:04:13,140 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 10:04:13,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808128290] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:04:13,141 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:04:13,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-08 10:04:13,141 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:04:13,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [714334358] [2022-04-08 10:04:13,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [714334358] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:04:13,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:04:13,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 10:04:13,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621558084] [2022-04-08 10:04:13,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:04:13,142 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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 27 [2022-04-08 10:04:13,142 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:04:13,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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-08 10:04:13,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:13,156 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 10:04:13,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:13,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 10:04:13,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-04-08 10:04:13,156 INFO L87 Difference]: Start difference. First operand 166 states and 226 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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-08 10:04:14,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:14,697 INFO L93 Difference]: Finished difference Result 225 states and 290 transitions. [2022-04-08 10:04:14,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 10:04:14,697 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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 27 [2022-04-08 10:04:14,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:04:14,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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-08 10:04:14,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 73 transitions. [2022-04-08 10:04:14,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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-08 10:04:14,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 73 transitions. [2022-04-08 10:04:14,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 73 transitions. [2022-04-08 10:04:14,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:14,755 INFO L225 Difference]: With dead ends: 225 [2022-04-08 10:04:14,755 INFO L226 Difference]: Without dead ends: 212 [2022-04-08 10:04:14,756 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=181, Invalid=631, Unknown=0, NotChecked=0, Total=812 [2022-04-08 10:04:14,756 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 43 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:04:14,756 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 72 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:04:14,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-04-08 10:04:15,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 166. [2022-04-08 10:04:15,226 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:04:15,226 INFO L82 GeneralOperation]: Start isEquivalent. First operand 212 states. Second operand has 166 states, 161 states have (on average 1.3726708074534162) internal successors, (221), 161 states have internal predecessors, (221), 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-08 10:04:15,226 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand has 166 states, 161 states have (on average 1.3726708074534162) internal successors, (221), 161 states have internal predecessors, (221), 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-08 10:04:15,226 INFO L87 Difference]: Start difference. First operand 212 states. Second operand has 166 states, 161 states have (on average 1.3726708074534162) internal successors, (221), 161 states have internal predecessors, (221), 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-08 10:04:15,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:15,228 INFO L93 Difference]: Finished difference Result 212 states and 277 transitions. [2022-04-08 10:04:15,228 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 277 transitions. [2022-04-08 10:04:15,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:15,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:15,229 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 161 states have (on average 1.3726708074534162) internal successors, (221), 161 states have internal predecessors, (221), 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 212 states. [2022-04-08 10:04:15,229 INFO L87 Difference]: Start difference. First operand has 166 states, 161 states have (on average 1.3726708074534162) internal successors, (221), 161 states have internal predecessors, (221), 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 212 states. [2022-04-08 10:04:15,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:15,231 INFO L93 Difference]: Finished difference Result 212 states and 277 transitions. [2022-04-08 10:04:15,231 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 277 transitions. [2022-04-08 10:04:15,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:15,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:15,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:04:15,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:04:15,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 161 states have (on average 1.3726708074534162) internal successors, (221), 161 states have internal predecessors, (221), 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-08 10:04:15,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 225 transitions. [2022-04-08 10:04:15,233 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 225 transitions. Word has length 27 [2022-04-08 10:04:15,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:04:15,233 INFO L478 AbstractCegarLoop]: Abstraction has 166 states and 225 transitions. [2022-04-08 10:04:15,233 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 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-08 10:04:15,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 166 states and 225 transitions. [2022-04-08 10:04:16,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:16,003 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 225 transitions. [2022-04-08 10:04:16,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 10:04:16,003 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:04:16,003 INFO L499 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:04:16,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-08 10:04:16,216 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:16,216 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:04:16,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:04:16,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1027421464, now seen corresponding path program 23 times [2022-04-08 10:04:16,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:16,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [408202648] [2022-04-08 10:04:16,222 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:04:16,222 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:04:16,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1027421464, now seen corresponding path program 24 times [2022-04-08 10:04:16,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:04:16,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815898177] [2022-04-08 10:04:16,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:04:16,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:04:16,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:16,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:04:16,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:16,455 INFO L290 TraceCheckUtils]: 0: Hoare triple {24329#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24310#true} is VALID [2022-04-08 10:04:16,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {24310#true} assume true; {24310#true} is VALID [2022-04-08 10:04:16,455 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24310#true} {24310#true} #72#return; {24310#true} is VALID [2022-04-08 10:04:16,456 INFO L272 TraceCheckUtils]: 0: Hoare triple {24310#true} call ULTIMATE.init(); {24329#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:04:16,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {24329#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24310#true} is VALID [2022-04-08 10:04:16,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {24310#true} assume true; {24310#true} is VALID [2022-04-08 10:04:16,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24310#true} {24310#true} #72#return; {24310#true} is VALID [2022-04-08 10:04:16,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {24310#true} call #t~ret13 := main(); {24310#true} is VALID [2022-04-08 10:04:16,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {24310#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24315#(= main_~y~0 0)} is VALID [2022-04-08 10:04:16,457 INFO L290 TraceCheckUtils]: 6: Hoare triple {24315#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24316#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:16,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {24316#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24317#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:16,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {24317#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24318#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:16,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {24318#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24319#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:16,458 INFO L290 TraceCheckUtils]: 10: Hoare triple {24319#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24320#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:16,459 INFO L290 TraceCheckUtils]: 11: Hoare triple {24320#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24321#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:16,459 INFO L290 TraceCheckUtils]: 12: Hoare triple {24321#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24322#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:16,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {24322#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24323#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:16,460 INFO L290 TraceCheckUtils]: 14: Hoare triple {24323#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24324#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:04:16,460 INFO L290 TraceCheckUtils]: 15: Hoare triple {24324#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24325#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:04:16,461 INFO L290 TraceCheckUtils]: 16: Hoare triple {24325#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24326#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:04:16,461 INFO L290 TraceCheckUtils]: 17: Hoare triple {24326#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24327#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:04:16,461 INFO L290 TraceCheckUtils]: 18: Hoare triple {24327#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {24327#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:04:16,462 INFO L290 TraceCheckUtils]: 19: Hoare triple {24327#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {24328#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} is VALID [2022-04-08 10:04:16,462 INFO L290 TraceCheckUtils]: 20: Hoare triple {24328#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {24311#false} is VALID [2022-04-08 10:04:16,462 INFO L290 TraceCheckUtils]: 21: Hoare triple {24311#false} assume !(~y~0 % 4294967296 > 0); {24311#false} is VALID [2022-04-08 10:04:16,462 INFO L290 TraceCheckUtils]: 22: Hoare triple {24311#false} assume !(~x~0 % 4294967296 > 0); {24311#false} is VALID [2022-04-08 10:04:16,462 INFO L272 TraceCheckUtils]: 23: Hoare triple {24311#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {24311#false} is VALID [2022-04-08 10:04:16,462 INFO L290 TraceCheckUtils]: 24: Hoare triple {24311#false} ~cond := #in~cond; {24311#false} is VALID [2022-04-08 10:04:16,462 INFO L290 TraceCheckUtils]: 25: Hoare triple {24311#false} assume 0 == ~cond; {24311#false} is VALID [2022-04-08 10:04:16,462 INFO L290 TraceCheckUtils]: 26: Hoare triple {24311#false} assume !false; {24311#false} is VALID [2022-04-08 10:04:16,463 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:04:16,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:04:16,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815898177] [2022-04-08 10:04:16,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815898177] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:04:16,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136767690] [2022-04-08 10:04:16,463 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:04:16,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:16,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:04:16,464 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:04:16,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-08 10:04:16,559 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 10:04:16,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:04:16,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 10:04:16,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:16,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:04:16,799 INFO L272 TraceCheckUtils]: 0: Hoare triple {24310#true} call ULTIMATE.init(); {24310#true} is VALID [2022-04-08 10:04:16,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {24310#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24310#true} is VALID [2022-04-08 10:04:16,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {24310#true} assume true; {24310#true} is VALID [2022-04-08 10:04:16,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24310#true} {24310#true} #72#return; {24310#true} is VALID [2022-04-08 10:04:16,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {24310#true} call #t~ret13 := main(); {24310#true} is VALID [2022-04-08 10:04:16,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {24310#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24315#(= main_~y~0 0)} is VALID [2022-04-08 10:04:16,800 INFO L290 TraceCheckUtils]: 6: Hoare triple {24315#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24316#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:16,800 INFO L290 TraceCheckUtils]: 7: Hoare triple {24316#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24317#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:16,801 INFO L290 TraceCheckUtils]: 8: Hoare triple {24317#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24318#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:16,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {24318#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24319#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:16,802 INFO L290 TraceCheckUtils]: 10: Hoare triple {24319#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24320#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:16,802 INFO L290 TraceCheckUtils]: 11: Hoare triple {24320#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24321#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:16,803 INFO L290 TraceCheckUtils]: 12: Hoare triple {24321#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24322#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:16,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {24322#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24323#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:16,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {24323#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24324#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:04:16,804 INFO L290 TraceCheckUtils]: 15: Hoare triple {24324#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24325#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:04:16,805 INFO L290 TraceCheckUtils]: 16: Hoare triple {24325#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24326#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:04:16,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {24326#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24327#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:04:16,806 INFO L290 TraceCheckUtils]: 18: Hoare triple {24327#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {24327#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:04:16,806 INFO L290 TraceCheckUtils]: 19: Hoare triple {24327#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {24390#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:04:16,806 INFO L290 TraceCheckUtils]: 20: Hoare triple {24390#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {24311#false} is VALID [2022-04-08 10:04:16,806 INFO L290 TraceCheckUtils]: 21: Hoare triple {24311#false} assume !(~y~0 % 4294967296 > 0); {24311#false} is VALID [2022-04-08 10:04:16,806 INFO L290 TraceCheckUtils]: 22: Hoare triple {24311#false} assume !(~x~0 % 4294967296 > 0); {24311#false} is VALID [2022-04-08 10:04:16,806 INFO L272 TraceCheckUtils]: 23: Hoare triple {24311#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {24311#false} is VALID [2022-04-08 10:04:16,806 INFO L290 TraceCheckUtils]: 24: Hoare triple {24311#false} ~cond := #in~cond; {24311#false} is VALID [2022-04-08 10:04:16,807 INFO L290 TraceCheckUtils]: 25: Hoare triple {24311#false} assume 0 == ~cond; {24311#false} is VALID [2022-04-08 10:04:16,807 INFO L290 TraceCheckUtils]: 26: Hoare triple {24311#false} assume !false; {24311#false} is VALID [2022-04-08 10:04:16,807 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:04:16,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:04:17,129 INFO L290 TraceCheckUtils]: 26: Hoare triple {24311#false} assume !false; {24311#false} is VALID [2022-04-08 10:04:17,129 INFO L290 TraceCheckUtils]: 25: Hoare triple {24311#false} assume 0 == ~cond; {24311#false} is VALID [2022-04-08 10:04:17,129 INFO L290 TraceCheckUtils]: 24: Hoare triple {24311#false} ~cond := #in~cond; {24311#false} is VALID [2022-04-08 10:04:17,129 INFO L272 TraceCheckUtils]: 23: Hoare triple {24311#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {24311#false} is VALID [2022-04-08 10:04:17,129 INFO L290 TraceCheckUtils]: 22: Hoare triple {24311#false} assume !(~x~0 % 4294967296 > 0); {24311#false} is VALID [2022-04-08 10:04:17,129 INFO L290 TraceCheckUtils]: 21: Hoare triple {24311#false} assume !(~y~0 % 4294967296 > 0); {24311#false} is VALID [2022-04-08 10:04:17,130 INFO L290 TraceCheckUtils]: 20: Hoare triple {24430#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {24311#false} is VALID [2022-04-08 10:04:17,130 INFO L290 TraceCheckUtils]: 19: Hoare triple {24434#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {24430#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:04:17,130 INFO L290 TraceCheckUtils]: 18: Hoare triple {24434#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {24434#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:04:17,130 INFO L290 TraceCheckUtils]: 17: Hoare triple {24441#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24434#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:04:17,131 INFO L290 TraceCheckUtils]: 16: Hoare triple {24445#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24441#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:04:17,131 INFO L290 TraceCheckUtils]: 15: Hoare triple {24449#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24445#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:04:17,132 INFO L290 TraceCheckUtils]: 14: Hoare triple {24453#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24449#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:04:17,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {24457#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24453#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:04:17,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {24461#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24457#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:17,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {24465#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24461#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:04:17,134 INFO L290 TraceCheckUtils]: 10: Hoare triple {24469#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24465#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:17,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {24473#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24469#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:04:17,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {24477#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24473#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:04:17,135 INFO L290 TraceCheckUtils]: 7: Hoare triple {24481#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24477#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:04:17,136 INFO L290 TraceCheckUtils]: 6: Hoare triple {24485#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {24481#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:04:17,136 INFO L290 TraceCheckUtils]: 5: Hoare triple {24310#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24485#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:04:17,136 INFO L272 TraceCheckUtils]: 4: Hoare triple {24310#true} call #t~ret13 := main(); {24310#true} is VALID [2022-04-08 10:04:17,136 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24310#true} {24310#true} #72#return; {24310#true} is VALID [2022-04-08 10:04:17,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {24310#true} assume true; {24310#true} is VALID [2022-04-08 10:04:17,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {24310#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24310#true} is VALID [2022-04-08 10:04:17,136 INFO L272 TraceCheckUtils]: 0: Hoare triple {24310#true} call ULTIMATE.init(); {24310#true} is VALID [2022-04-08 10:04:17,136 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:04:17,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136767690] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:04:17,137 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:04:17,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-08 10:04:17,137 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:04:17,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [408202648] [2022-04-08 10:04:17,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [408202648] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:04:17,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:04:17,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 10:04:17,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19033980] [2022-04-08 10:04:17,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:04:17,137 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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 27 [2022-04-08 10:04:17,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:04:17,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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-08 10:04:17,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:17,148 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 10:04:17,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:17,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 10:04:17,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=760, Unknown=0, NotChecked=0, Total=992 [2022-04-08 10:04:17,148 INFO L87 Difference]: Start difference. First operand 166 states and 225 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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-08 10:04:20,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:20,227 INFO L93 Difference]: Finished difference Result 296 states and 446 transitions. [2022-04-08 10:04:20,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 10:04:20,227 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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 27 [2022-04-08 10:04:20,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:04:20,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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-08 10:04:20,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 147 transitions. [2022-04-08 10:04:20,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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-08 10:04:20,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 147 transitions. [2022-04-08 10:04:20,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 147 transitions. [2022-04-08 10:04:20,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:20,345 INFO L225 Difference]: With dead ends: 296 [2022-04-08 10:04:20,345 INFO L226 Difference]: Without dead ends: 277 [2022-04-08 10:04:20,345 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=472, Invalid=1598, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 10:04:20,345 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 109 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1486 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:04:20,346 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 136 Invalid, 1560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1486 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-08 10:04:20,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-04-08 10:04:20,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 179. [2022-04-08 10:04:20,910 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:04:20,911 INFO L82 GeneralOperation]: Start isEquivalent. First operand 277 states. Second operand has 179 states, 174 states have (on average 1.3793103448275863) internal successors, (240), 174 states have internal predecessors, (240), 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-08 10:04:20,911 INFO L74 IsIncluded]: Start isIncluded. First operand 277 states. Second operand has 179 states, 174 states have (on average 1.3793103448275863) internal successors, (240), 174 states have internal predecessors, (240), 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-08 10:04:20,911 INFO L87 Difference]: Start difference. First operand 277 states. Second operand has 179 states, 174 states have (on average 1.3793103448275863) internal successors, (240), 174 states have internal predecessors, (240), 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-08 10:04:20,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:20,914 INFO L93 Difference]: Finished difference Result 277 states and 355 transitions. [2022-04-08 10:04:20,914 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 355 transitions. [2022-04-08 10:04:20,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:20,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:20,914 INFO L74 IsIncluded]: Start isIncluded. First operand has 179 states, 174 states have (on average 1.3793103448275863) internal successors, (240), 174 states have internal predecessors, (240), 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 277 states. [2022-04-08 10:04:20,915 INFO L87 Difference]: Start difference. First operand has 179 states, 174 states have (on average 1.3793103448275863) internal successors, (240), 174 states have internal predecessors, (240), 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 277 states. [2022-04-08 10:04:20,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:20,917 INFO L93 Difference]: Finished difference Result 277 states and 355 transitions. [2022-04-08 10:04:20,918 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 355 transitions. [2022-04-08 10:04:20,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:20,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:20,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:04:20,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:04:20,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 174 states have (on average 1.3793103448275863) internal successors, (240), 174 states have internal predecessors, (240), 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-08 10:04:20,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 244 transitions. [2022-04-08 10:04:20,920 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 244 transitions. Word has length 27 [2022-04-08 10:04:20,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:04:20,920 INFO L478 AbstractCegarLoop]: Abstraction has 179 states and 244 transitions. [2022-04-08 10:04:20,920 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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-08 10:04:20,920 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 179 states and 244 transitions. [2022-04-08 10:04:21,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 244 edges. 244 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:21,698 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 244 transitions. [2022-04-08 10:04:21,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 10:04:21,698 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:04:21,698 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:04:21,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-08 10:04:21,898 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-04-08 10:04:21,899 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:04:21,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:04:21,899 INFO L85 PathProgramCache]: Analyzing trace with hash 125389104, now seen corresponding path program 23 times [2022-04-08 10:04:21,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:21,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1771189490] [2022-04-08 10:04:21,901 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:04:21,901 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:04:21,901 INFO L85 PathProgramCache]: Analyzing trace with hash 125389104, now seen corresponding path program 24 times [2022-04-08 10:04:21,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:04:21,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792547555] [2022-04-08 10:04:21,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:04:21,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:04:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:21,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:04:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:21,974 INFO L290 TraceCheckUtils]: 0: Hoare triple {26047#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26038#true} is VALID [2022-04-08 10:04:21,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {26038#true} assume true; {26038#true} is VALID [2022-04-08 10:04:21,974 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26038#true} {26038#true} #72#return; {26038#true} is VALID [2022-04-08 10:04:21,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {26038#true} call ULTIMATE.init(); {26047#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:04:21,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {26047#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26038#true} is VALID [2022-04-08 10:04:21,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {26038#true} assume true; {26038#true} is VALID [2022-04-08 10:04:21,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26038#true} {26038#true} #72#return; {26038#true} is VALID [2022-04-08 10:04:21,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {26038#true} call #t~ret13 := main(); {26038#true} is VALID [2022-04-08 10:04:21,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {26038#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26038#true} is VALID [2022-04-08 10:04:21,974 INFO L290 TraceCheckUtils]: 6: Hoare triple {26038#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26038#true} is VALID [2022-04-08 10:04:21,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {26038#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26038#true} is VALID [2022-04-08 10:04:21,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {26038#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26038#true} is VALID [2022-04-08 10:04:21,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {26038#true} assume !(~x~0 % 4294967296 > 0); {26043#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:04:21,975 INFO L290 TraceCheckUtils]: 10: Hoare triple {26043#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {26043#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:04:21,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {26043#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26044#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:04:21,977 INFO L290 TraceCheckUtils]: 12: Hoare triple {26044#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26045#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:21,977 INFO L290 TraceCheckUtils]: 13: Hoare triple {26045#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:21,978 INFO L290 TraceCheckUtils]: 14: Hoare triple {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:21,978 INFO L290 TraceCheckUtils]: 15: Hoare triple {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:21,978 INFO L290 TraceCheckUtils]: 16: Hoare triple {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:21,979 INFO L290 TraceCheckUtils]: 17: Hoare triple {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:21,979 INFO L290 TraceCheckUtils]: 18: Hoare triple {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:21,980 INFO L290 TraceCheckUtils]: 19: Hoare triple {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26045#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:21,980 INFO L290 TraceCheckUtils]: 20: Hoare triple {26045#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26044#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:04:21,981 INFO L290 TraceCheckUtils]: 21: Hoare triple {26044#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26043#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:04:21,982 INFO L290 TraceCheckUtils]: 22: Hoare triple {26043#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26039#false} is VALID [2022-04-08 10:04:21,982 INFO L290 TraceCheckUtils]: 23: Hoare triple {26039#false} assume !(~x~0 % 4294967296 > 0); {26039#false} is VALID [2022-04-08 10:04:21,982 INFO L272 TraceCheckUtils]: 24: Hoare triple {26039#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {26039#false} is VALID [2022-04-08 10:04:21,982 INFO L290 TraceCheckUtils]: 25: Hoare triple {26039#false} ~cond := #in~cond; {26039#false} is VALID [2022-04-08 10:04:21,982 INFO L290 TraceCheckUtils]: 26: Hoare triple {26039#false} assume 0 == ~cond; {26039#false} is VALID [2022-04-08 10:04:21,982 INFO L290 TraceCheckUtils]: 27: Hoare triple {26039#false} assume !false; {26039#false} is VALID [2022-04-08 10:04:21,983 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 10:04:21,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:04:21,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792547555] [2022-04-08 10:04:21,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792547555] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:04:21,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046548981] [2022-04-08 10:04:21,983 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:04:21,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:21,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:04:21,995 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:04:22,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-08 10:04:22,037 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:04:22,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:04:22,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-08 10:04:22,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:22,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:04:22,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {26038#true} call ULTIMATE.init(); {26038#true} is VALID [2022-04-08 10:04:22,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {26038#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26038#true} is VALID [2022-04-08 10:04:22,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {26038#true} assume true; {26038#true} is VALID [2022-04-08 10:04:22,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26038#true} {26038#true} #72#return; {26038#true} is VALID [2022-04-08 10:04:22,214 INFO L272 TraceCheckUtils]: 4: Hoare triple {26038#true} call #t~ret13 := main(); {26038#true} is VALID [2022-04-08 10:04:22,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {26038#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26038#true} is VALID [2022-04-08 10:04:22,214 INFO L290 TraceCheckUtils]: 6: Hoare triple {26038#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26038#true} is VALID [2022-04-08 10:04:22,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {26038#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26038#true} is VALID [2022-04-08 10:04:22,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {26038#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26038#true} is VALID [2022-04-08 10:04:22,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {26038#true} assume !(~x~0 % 4294967296 > 0); {26043#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:04:22,215 INFO L290 TraceCheckUtils]: 10: Hoare triple {26043#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {26043#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:04:22,216 INFO L290 TraceCheckUtils]: 11: Hoare triple {26043#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26044#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:04:22,216 INFO L290 TraceCheckUtils]: 12: Hoare triple {26044#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26045#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:22,217 INFO L290 TraceCheckUtils]: 13: Hoare triple {26045#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:22,217 INFO L290 TraceCheckUtils]: 14: Hoare triple {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:22,218 INFO L290 TraceCheckUtils]: 15: Hoare triple {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:22,218 INFO L290 TraceCheckUtils]: 16: Hoare triple {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:22,218 INFO L290 TraceCheckUtils]: 17: Hoare triple {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:22,219 INFO L290 TraceCheckUtils]: 18: Hoare triple {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:22,219 INFO L290 TraceCheckUtils]: 19: Hoare triple {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26045#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:22,220 INFO L290 TraceCheckUtils]: 20: Hoare triple {26045#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26044#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:04:22,221 INFO L290 TraceCheckUtils]: 21: Hoare triple {26044#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26043#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:04:22,221 INFO L290 TraceCheckUtils]: 22: Hoare triple {26043#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26039#false} is VALID [2022-04-08 10:04:22,221 INFO L290 TraceCheckUtils]: 23: Hoare triple {26039#false} assume !(~x~0 % 4294967296 > 0); {26039#false} is VALID [2022-04-08 10:04:22,221 INFO L272 TraceCheckUtils]: 24: Hoare triple {26039#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {26039#false} is VALID [2022-04-08 10:04:22,221 INFO L290 TraceCheckUtils]: 25: Hoare triple {26039#false} ~cond := #in~cond; {26039#false} is VALID [2022-04-08 10:04:22,221 INFO L290 TraceCheckUtils]: 26: Hoare triple {26039#false} assume 0 == ~cond; {26039#false} is VALID [2022-04-08 10:04:22,221 INFO L290 TraceCheckUtils]: 27: Hoare triple {26039#false} assume !false; {26039#false} is VALID [2022-04-08 10:04:22,221 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 10:04:22,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:04:22,425 INFO L290 TraceCheckUtils]: 27: Hoare triple {26039#false} assume !false; {26039#false} is VALID [2022-04-08 10:04:22,425 INFO L290 TraceCheckUtils]: 26: Hoare triple {26039#false} assume 0 == ~cond; {26039#false} is VALID [2022-04-08 10:04:22,425 INFO L290 TraceCheckUtils]: 25: Hoare triple {26039#false} ~cond := #in~cond; {26039#false} is VALID [2022-04-08 10:04:22,425 INFO L272 TraceCheckUtils]: 24: Hoare triple {26039#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {26039#false} is VALID [2022-04-08 10:04:22,425 INFO L290 TraceCheckUtils]: 23: Hoare triple {26039#false} assume !(~x~0 % 4294967296 > 0); {26039#false} is VALID [2022-04-08 10:04:22,425 INFO L290 TraceCheckUtils]: 22: Hoare triple {26043#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26039#false} is VALID [2022-04-08 10:04:22,426 INFO L290 TraceCheckUtils]: 21: Hoare triple {26044#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26043#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:04:22,427 INFO L290 TraceCheckUtils]: 20: Hoare triple {26045#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26044#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:04:22,427 INFO L290 TraceCheckUtils]: 19: Hoare triple {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26045#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:22,428 INFO L290 TraceCheckUtils]: 18: Hoare triple {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:22,428 INFO L290 TraceCheckUtils]: 17: Hoare triple {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:22,428 INFO L290 TraceCheckUtils]: 16: Hoare triple {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:22,428 INFO L290 TraceCheckUtils]: 15: Hoare triple {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:22,429 INFO L290 TraceCheckUtils]: 14: Hoare triple {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:22,429 INFO L290 TraceCheckUtils]: 13: Hoare triple {26045#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26046#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:22,430 INFO L290 TraceCheckUtils]: 12: Hoare triple {26044#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26045#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:22,430 INFO L290 TraceCheckUtils]: 11: Hoare triple {26043#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26044#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:04:22,431 INFO L290 TraceCheckUtils]: 10: Hoare triple {26043#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {26043#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:04:22,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {26038#true} assume !(~x~0 % 4294967296 > 0); {26043#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:04:22,431 INFO L290 TraceCheckUtils]: 8: Hoare triple {26038#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26038#true} is VALID [2022-04-08 10:04:22,431 INFO L290 TraceCheckUtils]: 7: Hoare triple {26038#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26038#true} is VALID [2022-04-08 10:04:22,431 INFO L290 TraceCheckUtils]: 6: Hoare triple {26038#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {26038#true} is VALID [2022-04-08 10:04:22,431 INFO L290 TraceCheckUtils]: 5: Hoare triple {26038#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26038#true} is VALID [2022-04-08 10:04:22,431 INFO L272 TraceCheckUtils]: 4: Hoare triple {26038#true} call #t~ret13 := main(); {26038#true} is VALID [2022-04-08 10:04:22,431 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26038#true} {26038#true} #72#return; {26038#true} is VALID [2022-04-08 10:04:22,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {26038#true} assume true; {26038#true} is VALID [2022-04-08 10:04:22,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {26038#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {26038#true} is VALID [2022-04-08 10:04:22,431 INFO L272 TraceCheckUtils]: 0: Hoare triple {26038#true} call ULTIMATE.init(); {26038#true} is VALID [2022-04-08 10:04:22,432 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 10:04:22,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046548981] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:04:22,432 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:04:22,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-04-08 10:04:22,432 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:04:22,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1771189490] [2022-04-08 10:04:22,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1771189490] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:04:22,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:04:22,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 10:04:22,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955682972] [2022-04-08 10:04:22,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:04:22,432 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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 28 [2022-04-08 10:04:22,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:04:22,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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-08 10:04:22,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:22,447 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 10:04:22,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:22,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 10:04:22,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-08 10:04:22,447 INFO L87 Difference]: Start difference. First operand 179 states and 244 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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-08 10:04:23,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:23,421 INFO L93 Difference]: Finished difference Result 197 states and 263 transitions. [2022-04-08 10:04:23,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 10:04:23,421 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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 28 [2022-04-08 10:04:23,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:04:23,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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-08 10:04:23,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-08 10:04:23,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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-08 10:04:23,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-08 10:04:23,422 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 46 transitions. [2022-04-08 10:04:23,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:23,461 INFO L225 Difference]: With dead ends: 197 [2022-04-08 10:04:23,461 INFO L226 Difference]: Without dead ends: 178 [2022-04-08 10:04:23,462 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-08 10:04:23,462 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 29 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:04:23,462 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 48 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:04:23,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-04-08 10:04:23,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 175. [2022-04-08 10:04:23,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:04:23,946 INFO L82 GeneralOperation]: Start isEquivalent. First operand 178 states. Second operand has 175 states, 170 states have (on average 1.3823529411764706) internal successors, (235), 170 states have internal predecessors, (235), 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-08 10:04:23,947 INFO L74 IsIncluded]: Start isIncluded. First operand 178 states. Second operand has 175 states, 170 states have (on average 1.3823529411764706) internal successors, (235), 170 states have internal predecessors, (235), 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-08 10:04:23,947 INFO L87 Difference]: Start difference. First operand 178 states. Second operand has 175 states, 170 states have (on average 1.3823529411764706) internal successors, (235), 170 states have internal predecessors, (235), 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-08 10:04:23,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:23,948 INFO L93 Difference]: Finished difference Result 178 states and 242 transitions. [2022-04-08 10:04:23,948 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 242 transitions. [2022-04-08 10:04:23,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:23,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:23,950 INFO L74 IsIncluded]: Start isIncluded. First operand has 175 states, 170 states have (on average 1.3823529411764706) internal successors, (235), 170 states have internal predecessors, (235), 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 178 states. [2022-04-08 10:04:23,950 INFO L87 Difference]: Start difference. First operand has 175 states, 170 states have (on average 1.3823529411764706) internal successors, (235), 170 states have internal predecessors, (235), 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 178 states. [2022-04-08 10:04:23,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:23,952 INFO L93 Difference]: Finished difference Result 178 states and 242 transitions. [2022-04-08 10:04:23,952 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 242 transitions. [2022-04-08 10:04:23,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:23,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:23,952 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:04:23,952 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:04:23,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 170 states have (on average 1.3823529411764706) internal successors, (235), 170 states have internal predecessors, (235), 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-08 10:04:23,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 239 transitions. [2022-04-08 10:04:23,954 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 239 transitions. Word has length 28 [2022-04-08 10:04:23,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:04:23,954 INFO L478 AbstractCegarLoop]: Abstraction has 175 states and 239 transitions. [2022-04-08 10:04:23,954 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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-08 10:04:23,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 175 states and 239 transitions. [2022-04-08 10:04:24,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 239 edges. 239 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:24,651 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 239 transitions. [2022-04-08 10:04:24,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 10:04:24,652 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:04:24,652 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:04:24,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-04-08 10:04:24,852 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:24,852 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:04:24,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:04:24,853 INFO L85 PathProgramCache]: Analyzing trace with hash -2010729856, now seen corresponding path program 15 times [2022-04-08 10:04:24,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:24,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1466206870] [2022-04-08 10:04:24,855 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:04:24,855 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:04:24,855 INFO L85 PathProgramCache]: Analyzing trace with hash -2010729856, now seen corresponding path program 16 times [2022-04-08 10:04:24,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:04:24,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261560934] [2022-04-08 10:04:24,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:04:24,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:04:24,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:24,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:04:25,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:25,002 INFO L290 TraceCheckUtils]: 0: Hoare triple {27338#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {27323#true} is VALID [2022-04-08 10:04:25,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {27323#true} assume true; {27323#true} is VALID [2022-04-08 10:04:25,002 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27323#true} {27323#true} #72#return; {27323#true} is VALID [2022-04-08 10:04:25,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {27323#true} call ULTIMATE.init(); {27338#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:04:25,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {27338#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {27323#true} is VALID [2022-04-08 10:04:25,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {27323#true} assume true; {27323#true} is VALID [2022-04-08 10:04:25,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27323#true} {27323#true} #72#return; {27323#true} is VALID [2022-04-08 10:04:25,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {27323#true} call #t~ret13 := main(); {27323#true} is VALID [2022-04-08 10:04:25,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {27323#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27328#(= main_~y~0 0)} is VALID [2022-04-08 10:04:25,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {27328#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27329#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:25,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {27329#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27330#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:25,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {27330#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27331#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:25,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {27331#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27332#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:25,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {27332#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {27332#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:25,007 INFO L290 TraceCheckUtils]: 11: Hoare triple {27332#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {27333#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:04:25,007 INFO L290 TraceCheckUtils]: 12: Hoare triple {27333#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27334#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:04:25,008 INFO L290 TraceCheckUtils]: 13: Hoare triple {27334#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27335#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:04:25,008 INFO L290 TraceCheckUtils]: 14: Hoare triple {27335#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27336#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:04:25,009 INFO L290 TraceCheckUtils]: 15: Hoare triple {27336#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27337#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:04:25,009 INFO L290 TraceCheckUtils]: 16: Hoare triple {27337#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27324#false} is VALID [2022-04-08 10:04:25,009 INFO L290 TraceCheckUtils]: 17: Hoare triple {27324#false} assume !(~z~0 % 4294967296 > 0); {27324#false} is VALID [2022-04-08 10:04:25,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {27324#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27324#false} is VALID [2022-04-08 10:04:25,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {27324#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27324#false} is VALID [2022-04-08 10:04:25,009 INFO L290 TraceCheckUtils]: 20: Hoare triple {27324#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27324#false} is VALID [2022-04-08 10:04:25,009 INFO L290 TraceCheckUtils]: 21: Hoare triple {27324#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27324#false} is VALID [2022-04-08 10:04:25,009 INFO L290 TraceCheckUtils]: 22: Hoare triple {27324#false} assume !(~y~0 % 4294967296 > 0); {27324#false} is VALID [2022-04-08 10:04:25,009 INFO L290 TraceCheckUtils]: 23: Hoare triple {27324#false} assume !(~x~0 % 4294967296 > 0); {27324#false} is VALID [2022-04-08 10:04:25,010 INFO L272 TraceCheckUtils]: 24: Hoare triple {27324#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {27324#false} is VALID [2022-04-08 10:04:25,010 INFO L290 TraceCheckUtils]: 25: Hoare triple {27324#false} ~cond := #in~cond; {27324#false} is VALID [2022-04-08 10:04:25,010 INFO L290 TraceCheckUtils]: 26: Hoare triple {27324#false} assume 0 == ~cond; {27324#false} is VALID [2022-04-08 10:04:25,010 INFO L290 TraceCheckUtils]: 27: Hoare triple {27324#false} assume !false; {27324#false} is VALID [2022-04-08 10:04:25,010 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 10:04:25,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:04:25,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261560934] [2022-04-08 10:04:25,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261560934] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:04:25,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520318240] [2022-04-08 10:04:25,013 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:04:25,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:25,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:04:25,013 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:04:25,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-08 10:04:25,051 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:04:25,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:04:25,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-08 10:04:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:25,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:04:25,239 INFO L272 TraceCheckUtils]: 0: Hoare triple {27323#true} call ULTIMATE.init(); {27323#true} is VALID [2022-04-08 10:04:25,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {27323#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {27323#true} is VALID [2022-04-08 10:04:25,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {27323#true} assume true; {27323#true} is VALID [2022-04-08 10:04:25,239 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27323#true} {27323#true} #72#return; {27323#true} is VALID [2022-04-08 10:04:25,239 INFO L272 TraceCheckUtils]: 4: Hoare triple {27323#true} call #t~ret13 := main(); {27323#true} is VALID [2022-04-08 10:04:25,239 INFO L290 TraceCheckUtils]: 5: Hoare triple {27323#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27328#(= main_~y~0 0)} is VALID [2022-04-08 10:04:25,240 INFO L290 TraceCheckUtils]: 6: Hoare triple {27328#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27329#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:25,241 INFO L290 TraceCheckUtils]: 7: Hoare triple {27329#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27330#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:25,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {27330#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27331#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:25,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {27331#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27332#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:25,243 INFO L290 TraceCheckUtils]: 10: Hoare triple {27332#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {27332#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:25,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {27332#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {27375#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:25,243 INFO L290 TraceCheckUtils]: 12: Hoare triple {27375#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27379#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:04:25,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {27379#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27383#(and (<= main_~y~0 4) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:25,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {27383#(and (<= main_~y~0 4) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27387#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:25,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {27387#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27391#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:25,246 INFO L290 TraceCheckUtils]: 16: Hoare triple {27391#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27324#false} is VALID [2022-04-08 10:04:25,246 INFO L290 TraceCheckUtils]: 17: Hoare triple {27324#false} assume !(~z~0 % 4294967296 > 0); {27324#false} is VALID [2022-04-08 10:04:25,246 INFO L290 TraceCheckUtils]: 18: Hoare triple {27324#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27324#false} is VALID [2022-04-08 10:04:25,246 INFO L290 TraceCheckUtils]: 19: Hoare triple {27324#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27324#false} is VALID [2022-04-08 10:04:25,246 INFO L290 TraceCheckUtils]: 20: Hoare triple {27324#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27324#false} is VALID [2022-04-08 10:04:25,246 INFO L290 TraceCheckUtils]: 21: Hoare triple {27324#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27324#false} is VALID [2022-04-08 10:04:25,246 INFO L290 TraceCheckUtils]: 22: Hoare triple {27324#false} assume !(~y~0 % 4294967296 > 0); {27324#false} is VALID [2022-04-08 10:04:25,246 INFO L290 TraceCheckUtils]: 23: Hoare triple {27324#false} assume !(~x~0 % 4294967296 > 0); {27324#false} is VALID [2022-04-08 10:04:25,247 INFO L272 TraceCheckUtils]: 24: Hoare triple {27324#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {27324#false} is VALID [2022-04-08 10:04:25,247 INFO L290 TraceCheckUtils]: 25: Hoare triple {27324#false} ~cond := #in~cond; {27324#false} is VALID [2022-04-08 10:04:25,247 INFO L290 TraceCheckUtils]: 26: Hoare triple {27324#false} assume 0 == ~cond; {27324#false} is VALID [2022-04-08 10:04:25,247 INFO L290 TraceCheckUtils]: 27: Hoare triple {27324#false} assume !false; {27324#false} is VALID [2022-04-08 10:04:25,247 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 10:04:25,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:04:25,536 INFO L290 TraceCheckUtils]: 27: Hoare triple {27324#false} assume !false; {27324#false} is VALID [2022-04-08 10:04:25,536 INFO L290 TraceCheckUtils]: 26: Hoare triple {27324#false} assume 0 == ~cond; {27324#false} is VALID [2022-04-08 10:04:25,537 INFO L290 TraceCheckUtils]: 25: Hoare triple {27324#false} ~cond := #in~cond; {27324#false} is VALID [2022-04-08 10:04:25,537 INFO L272 TraceCheckUtils]: 24: Hoare triple {27324#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {27324#false} is VALID [2022-04-08 10:04:25,537 INFO L290 TraceCheckUtils]: 23: Hoare triple {27324#false} assume !(~x~0 % 4294967296 > 0); {27324#false} is VALID [2022-04-08 10:04:25,537 INFO L290 TraceCheckUtils]: 22: Hoare triple {27443#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {27324#false} is VALID [2022-04-08 10:04:25,538 INFO L290 TraceCheckUtils]: 21: Hoare triple {27447#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27443#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:04:25,538 INFO L290 TraceCheckUtils]: 20: Hoare triple {27451#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27447#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:25,539 INFO L290 TraceCheckUtils]: 19: Hoare triple {27455#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27451#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:04:25,540 INFO L290 TraceCheckUtils]: 18: Hoare triple {27459#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27455#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:04:25,541 INFO L290 TraceCheckUtils]: 17: Hoare triple {27459#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {27459#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:25,541 INFO L290 TraceCheckUtils]: 16: Hoare triple {27466#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27459#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:25,542 INFO L290 TraceCheckUtils]: 15: Hoare triple {27470#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27466#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:04:25,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {27474#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27470#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:04:25,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {27478#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27474#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:04:25,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {27482#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27478#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:04:25,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {27323#true} ~z~0 := ~y~0; {27482#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:04:25,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {27323#true} assume !(~x~0 % 4294967296 > 0); {27323#true} is VALID [2022-04-08 10:04:25,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {27323#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27323#true} is VALID [2022-04-08 10:04:25,545 INFO L290 TraceCheckUtils]: 8: Hoare triple {27323#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27323#true} is VALID [2022-04-08 10:04:25,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {27323#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27323#true} is VALID [2022-04-08 10:04:25,545 INFO L290 TraceCheckUtils]: 6: Hoare triple {27323#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {27323#true} is VALID [2022-04-08 10:04:25,545 INFO L290 TraceCheckUtils]: 5: Hoare triple {27323#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27323#true} is VALID [2022-04-08 10:04:25,545 INFO L272 TraceCheckUtils]: 4: Hoare triple {27323#true} call #t~ret13 := main(); {27323#true} is VALID [2022-04-08 10:04:25,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27323#true} {27323#true} #72#return; {27323#true} is VALID [2022-04-08 10:04:25,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {27323#true} assume true; {27323#true} is VALID [2022-04-08 10:04:25,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {27323#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {27323#true} is VALID [2022-04-08 10:04:25,545 INFO L272 TraceCheckUtils]: 0: Hoare triple {27323#true} call ULTIMATE.init(); {27323#true} is VALID [2022-04-08 10:04:25,545 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 10:04:25,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520318240] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:04:25,545 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:04:25,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 28 [2022-04-08 10:04:25,545 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:04:25,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1466206870] [2022-04-08 10:04:25,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1466206870] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:04:25,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:04:25,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 10:04:25,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393791615] [2022-04-08 10:04:25,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:04:25,546 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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 28 [2022-04-08 10:04:25,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:04:25,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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-08 10:04:25,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:25,562 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 10:04:25,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:25,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 10:04:25,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=618, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:04:25,563 INFO L87 Difference]: Start difference. First operand 175 states and 239 transitions. Second operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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-08 10:04:26,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:26,617 INFO L93 Difference]: Finished difference Result 208 states and 274 transitions. [2022-04-08 10:04:26,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 10:04:26,617 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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 28 [2022-04-08 10:04:26,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:04:26,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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-08 10:04:26,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 58 transitions. [2022-04-08 10:04:26,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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-08 10:04:26,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 58 transitions. [2022-04-08 10:04:26,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 58 transitions. [2022-04-08 10:04:26,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:26,671 INFO L225 Difference]: With dead ends: 208 [2022-04-08 10:04:26,671 INFO L226 Difference]: Without dead ends: 187 [2022-04-08 10:04:26,672 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=373, Invalid=1697, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 10:04:26,672 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 25 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:04:26,672 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 68 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:04:26,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-04-08 10:04:27,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 174. [2022-04-08 10:04:27,057 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:04:27,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 187 states. Second operand has 174 states, 169 states have (on average 1.3668639053254439) internal successors, (231), 169 states have internal predecessors, (231), 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-08 10:04:27,058 INFO L74 IsIncluded]: Start isIncluded. First operand 187 states. Second operand has 174 states, 169 states have (on average 1.3668639053254439) internal successors, (231), 169 states have internal predecessors, (231), 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-08 10:04:27,058 INFO L87 Difference]: Start difference. First operand 187 states. Second operand has 174 states, 169 states have (on average 1.3668639053254439) internal successors, (231), 169 states have internal predecessors, (231), 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-08 10:04:27,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:27,060 INFO L93 Difference]: Finished difference Result 187 states and 250 transitions. [2022-04-08 10:04:27,060 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 250 transitions. [2022-04-08 10:04:27,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:27,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:27,060 INFO L74 IsIncluded]: Start isIncluded. First operand has 174 states, 169 states have (on average 1.3668639053254439) internal successors, (231), 169 states have internal predecessors, (231), 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 187 states. [2022-04-08 10:04:27,060 INFO L87 Difference]: Start difference. First operand has 174 states, 169 states have (on average 1.3668639053254439) internal successors, (231), 169 states have internal predecessors, (231), 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 187 states. [2022-04-08 10:04:27,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:27,075 INFO L93 Difference]: Finished difference Result 187 states and 250 transitions. [2022-04-08 10:04:27,075 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 250 transitions. [2022-04-08 10:04:27,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:27,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:27,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:04:27,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:04:27,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 169 states have (on average 1.3668639053254439) internal successors, (231), 169 states have internal predecessors, (231), 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-08 10:04:27,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 235 transitions. [2022-04-08 10:04:27,083 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 235 transitions. Word has length 28 [2022-04-08 10:04:27,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:04:27,083 INFO L478 AbstractCegarLoop]: Abstraction has 174 states and 235 transitions. [2022-04-08 10:04:27,083 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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-08 10:04:27,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 174 states and 235 transitions. [2022-04-08 10:04:28,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:28,010 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 235 transitions. [2022-04-08 10:04:28,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 10:04:28,015 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:04:28,015 INFO L499 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:04:28,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-08 10:04:28,228 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:28,228 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:04:28,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:04:28,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1472968031, now seen corresponding path program 25 times [2022-04-08 10:04:28,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:28,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [248750556] [2022-04-08 10:04:28,232 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:04:28,232 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:04:28,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1472968031, now seen corresponding path program 26 times [2022-04-08 10:04:28,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:04:28,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216381016] [2022-04-08 10:04:28,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:04:28,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:04:28,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:28,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:04:28,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:28,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {28715#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28695#true} is VALID [2022-04-08 10:04:28,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {28695#true} assume true; {28695#true} is VALID [2022-04-08 10:04:28,410 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28695#true} {28695#true} #72#return; {28695#true} is VALID [2022-04-08 10:04:28,410 INFO L272 TraceCheckUtils]: 0: Hoare triple {28695#true} call ULTIMATE.init(); {28715#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:04:28,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {28715#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28695#true} is VALID [2022-04-08 10:04:28,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {28695#true} assume true; {28695#true} is VALID [2022-04-08 10:04:28,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28695#true} {28695#true} #72#return; {28695#true} is VALID [2022-04-08 10:04:28,410 INFO L272 TraceCheckUtils]: 4: Hoare triple {28695#true} call #t~ret13 := main(); {28695#true} is VALID [2022-04-08 10:04:28,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {28695#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28700#(= main_~y~0 0)} is VALID [2022-04-08 10:04:28,411 INFO L290 TraceCheckUtils]: 6: Hoare triple {28700#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28701#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:28,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {28701#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28702#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:28,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {28702#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28703#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:28,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {28703#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28704#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:28,412 INFO L290 TraceCheckUtils]: 10: Hoare triple {28704#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28705#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:28,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {28705#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28706#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:28,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {28706#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28707#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:28,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {28707#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28708#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:28,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {28708#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28709#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:04:28,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {28709#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28710#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:04:28,415 INFO L290 TraceCheckUtils]: 16: Hoare triple {28710#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28711#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:04:28,415 INFO L290 TraceCheckUtils]: 17: Hoare triple {28711#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28712#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:04:28,416 INFO L290 TraceCheckUtils]: 18: Hoare triple {28712#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28713#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:04:28,416 INFO L290 TraceCheckUtils]: 19: Hoare triple {28713#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {28713#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:04:28,416 INFO L290 TraceCheckUtils]: 20: Hoare triple {28713#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {28714#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:04:28,416 INFO L290 TraceCheckUtils]: 21: Hoare triple {28714#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {28696#false} is VALID [2022-04-08 10:04:28,416 INFO L290 TraceCheckUtils]: 22: Hoare triple {28696#false} assume !(~y~0 % 4294967296 > 0); {28696#false} is VALID [2022-04-08 10:04:28,417 INFO L290 TraceCheckUtils]: 23: Hoare triple {28696#false} assume !(~x~0 % 4294967296 > 0); {28696#false} is VALID [2022-04-08 10:04:28,417 INFO L272 TraceCheckUtils]: 24: Hoare triple {28696#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {28696#false} is VALID [2022-04-08 10:04:28,417 INFO L290 TraceCheckUtils]: 25: Hoare triple {28696#false} ~cond := #in~cond; {28696#false} is VALID [2022-04-08 10:04:28,417 INFO L290 TraceCheckUtils]: 26: Hoare triple {28696#false} assume 0 == ~cond; {28696#false} is VALID [2022-04-08 10:04:28,417 INFO L290 TraceCheckUtils]: 27: Hoare triple {28696#false} assume !false; {28696#false} is VALID [2022-04-08 10:04:28,417 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:04:28,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:04:28,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216381016] [2022-04-08 10:04:28,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216381016] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:04:28,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526730715] [2022-04-08 10:04:28,417 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:04:28,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:28,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:04:28,418 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:04:28,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-08 10:04:28,463 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:04:28,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:04:28,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 10:04:28,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:28,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:04:28,648 INFO L272 TraceCheckUtils]: 0: Hoare triple {28695#true} call ULTIMATE.init(); {28695#true} is VALID [2022-04-08 10:04:28,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {28695#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28695#true} is VALID [2022-04-08 10:04:28,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {28695#true} assume true; {28695#true} is VALID [2022-04-08 10:04:28,649 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28695#true} {28695#true} #72#return; {28695#true} is VALID [2022-04-08 10:04:28,649 INFO L272 TraceCheckUtils]: 4: Hoare triple {28695#true} call #t~ret13 := main(); {28695#true} is VALID [2022-04-08 10:04:28,649 INFO L290 TraceCheckUtils]: 5: Hoare triple {28695#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28700#(= main_~y~0 0)} is VALID [2022-04-08 10:04:28,649 INFO L290 TraceCheckUtils]: 6: Hoare triple {28700#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28701#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:28,650 INFO L290 TraceCheckUtils]: 7: Hoare triple {28701#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28702#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:28,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {28702#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28703#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:28,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {28703#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28704#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:28,651 INFO L290 TraceCheckUtils]: 10: Hoare triple {28704#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28705#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:28,651 INFO L290 TraceCheckUtils]: 11: Hoare triple {28705#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28706#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:28,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {28706#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28707#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:28,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {28707#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28708#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:28,652 INFO L290 TraceCheckUtils]: 14: Hoare triple {28708#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28709#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:04:28,653 INFO L290 TraceCheckUtils]: 15: Hoare triple {28709#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28710#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:04:28,653 INFO L290 TraceCheckUtils]: 16: Hoare triple {28710#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28711#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:04:28,653 INFO L290 TraceCheckUtils]: 17: Hoare triple {28711#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28712#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:04:28,654 INFO L290 TraceCheckUtils]: 18: Hoare triple {28712#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28713#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:04:28,654 INFO L290 TraceCheckUtils]: 19: Hoare triple {28713#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {28713#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:04:28,654 INFO L290 TraceCheckUtils]: 20: Hoare triple {28713#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {28779#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:04:28,655 INFO L290 TraceCheckUtils]: 21: Hoare triple {28779#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !(~z~0 % 4294967296 > 0); {28696#false} is VALID [2022-04-08 10:04:28,655 INFO L290 TraceCheckUtils]: 22: Hoare triple {28696#false} assume !(~y~0 % 4294967296 > 0); {28696#false} is VALID [2022-04-08 10:04:28,655 INFO L290 TraceCheckUtils]: 23: Hoare triple {28696#false} assume !(~x~0 % 4294967296 > 0); {28696#false} is VALID [2022-04-08 10:04:28,655 INFO L272 TraceCheckUtils]: 24: Hoare triple {28696#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {28696#false} is VALID [2022-04-08 10:04:28,655 INFO L290 TraceCheckUtils]: 25: Hoare triple {28696#false} ~cond := #in~cond; {28696#false} is VALID [2022-04-08 10:04:28,655 INFO L290 TraceCheckUtils]: 26: Hoare triple {28696#false} assume 0 == ~cond; {28696#false} is VALID [2022-04-08 10:04:28,655 INFO L290 TraceCheckUtils]: 27: Hoare triple {28696#false} assume !false; {28696#false} is VALID [2022-04-08 10:04:28,655 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:04:28,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:04:28,930 INFO L290 TraceCheckUtils]: 27: Hoare triple {28696#false} assume !false; {28696#false} is VALID [2022-04-08 10:04:28,931 INFO L290 TraceCheckUtils]: 26: Hoare triple {28696#false} assume 0 == ~cond; {28696#false} is VALID [2022-04-08 10:04:28,931 INFO L290 TraceCheckUtils]: 25: Hoare triple {28696#false} ~cond := #in~cond; {28696#false} is VALID [2022-04-08 10:04:28,931 INFO L272 TraceCheckUtils]: 24: Hoare triple {28696#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {28696#false} is VALID [2022-04-08 10:04:28,931 INFO L290 TraceCheckUtils]: 23: Hoare triple {28696#false} assume !(~x~0 % 4294967296 > 0); {28696#false} is VALID [2022-04-08 10:04:28,931 INFO L290 TraceCheckUtils]: 22: Hoare triple {28696#false} assume !(~y~0 % 4294967296 > 0); {28696#false} is VALID [2022-04-08 10:04:28,931 INFO L290 TraceCheckUtils]: 21: Hoare triple {28819#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {28696#false} is VALID [2022-04-08 10:04:28,931 INFO L290 TraceCheckUtils]: 20: Hoare triple {28823#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {28819#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:04:28,931 INFO L290 TraceCheckUtils]: 19: Hoare triple {28823#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {28823#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:04:28,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {28830#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28823#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:04:28,932 INFO L290 TraceCheckUtils]: 17: Hoare triple {28834#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28830#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:04:28,933 INFO L290 TraceCheckUtils]: 16: Hoare triple {28838#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28834#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:04:28,933 INFO L290 TraceCheckUtils]: 15: Hoare triple {28842#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28838#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:04:28,934 INFO L290 TraceCheckUtils]: 14: Hoare triple {28846#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28842#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:04:28,934 INFO L290 TraceCheckUtils]: 13: Hoare triple {28850#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28846#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:28,935 INFO L290 TraceCheckUtils]: 12: Hoare triple {28854#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28850#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:04:28,935 INFO L290 TraceCheckUtils]: 11: Hoare triple {28858#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28854#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:28,936 INFO L290 TraceCheckUtils]: 10: Hoare triple {28862#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28858#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:04:28,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {28866#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28862#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:04:28,937 INFO L290 TraceCheckUtils]: 8: Hoare triple {28870#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28866#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:04:28,937 INFO L290 TraceCheckUtils]: 7: Hoare triple {28874#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28870#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:04:28,938 INFO L290 TraceCheckUtils]: 6: Hoare triple {28878#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {28874#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:04:28,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {28695#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28878#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:04:28,938 INFO L272 TraceCheckUtils]: 4: Hoare triple {28695#true} call #t~ret13 := main(); {28695#true} is VALID [2022-04-08 10:04:28,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28695#true} {28695#true} #72#return; {28695#true} is VALID [2022-04-08 10:04:28,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {28695#true} assume true; {28695#true} is VALID [2022-04-08 10:04:28,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {28695#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {28695#true} is VALID [2022-04-08 10:04:28,938 INFO L272 TraceCheckUtils]: 0: Hoare triple {28695#true} call ULTIMATE.init(); {28695#true} is VALID [2022-04-08 10:04:28,938 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:04:28,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526730715] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:04:28,939 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:04:28,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-08 10:04:28,939 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:04:28,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [248750556] [2022-04-08 10:04:28,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [248750556] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:04:28,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:04:28,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 10:04:28,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452464334] [2022-04-08 10:04:28,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:04:28,939 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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 28 [2022-04-08 10:04:28,939 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:04:28,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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-08 10:04:28,951 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-08 10:04:28,951 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 10:04:28,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:28,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 10:04:28,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=859, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 10:04:28,951 INFO L87 Difference]: Start difference. First operand 174 states and 235 transitions. Second operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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-08 10:04:32,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:32,033 INFO L93 Difference]: Finished difference Result 313 states and 471 transitions. [2022-04-08 10:04:32,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 10:04:32,034 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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 28 [2022-04-08 10:04:32,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:04:32,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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-08 10:04:32,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 153 transitions. [2022-04-08 10:04:32,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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-08 10:04:32,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 153 transitions. [2022-04-08 10:04:32,037 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 153 transitions. [2022-04-08 10:04:32,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:32,123 INFO L225 Difference]: With dead ends: 313 [2022-04-08 10:04:32,123 INFO L226 Difference]: Without dead ends: 293 [2022-04-08 10:04:32,124 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=535, Invalid=1817, Unknown=0, NotChecked=0, Total=2352 [2022-04-08 10:04:32,124 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 110 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1669 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 1746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:04:32,124 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 143 Invalid, 1746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1669 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-08 10:04:32,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-04-08 10:04:32,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 187. [2022-04-08 10:04:32,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:04:32,507 INFO L82 GeneralOperation]: Start isEquivalent. First operand 293 states. Second operand has 187 states, 182 states have (on average 1.3736263736263736) internal successors, (250), 182 states have internal predecessors, (250), 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-08 10:04:32,508 INFO L74 IsIncluded]: Start isIncluded. First operand 293 states. Second operand has 187 states, 182 states have (on average 1.3736263736263736) internal successors, (250), 182 states have internal predecessors, (250), 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-08 10:04:32,523 INFO L87 Difference]: Start difference. First operand 293 states. Second operand has 187 states, 182 states have (on average 1.3736263736263736) internal successors, (250), 182 states have internal predecessors, (250), 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-08 10:04:32,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:32,526 INFO L93 Difference]: Finished difference Result 293 states and 374 transitions. [2022-04-08 10:04:32,526 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 374 transitions. [2022-04-08 10:04:32,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:32,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:32,527 INFO L74 IsIncluded]: Start isIncluded. First operand has 187 states, 182 states have (on average 1.3736263736263736) internal successors, (250), 182 states have internal predecessors, (250), 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 293 states. [2022-04-08 10:04:32,527 INFO L87 Difference]: Start difference. First operand has 187 states, 182 states have (on average 1.3736263736263736) internal successors, (250), 182 states have internal predecessors, (250), 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 293 states. [2022-04-08 10:04:32,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:32,530 INFO L93 Difference]: Finished difference Result 293 states and 374 transitions. [2022-04-08 10:04:32,530 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 374 transitions. [2022-04-08 10:04:32,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:32,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:32,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:04:32,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:04:32,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 182 states have (on average 1.3736263736263736) internal successors, (250), 182 states have internal predecessors, (250), 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-08 10:04:32,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 254 transitions. [2022-04-08 10:04:32,532 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 254 transitions. Word has length 28 [2022-04-08 10:04:32,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:04:32,533 INFO L478 AbstractCegarLoop]: Abstraction has 187 states and 254 transitions. [2022-04-08 10:04:32,533 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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-08 10:04:32,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 187 states and 254 transitions. [2022-04-08 10:04:33,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 254 edges. 254 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:33,289 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 254 transitions. [2022-04-08 10:04:33,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 10:04:33,289 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:04:33,289 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:04:33,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-04-08 10:04:33,489 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-04-08 10:04:33,489 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:04:33,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:04:33,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1753768806, now seen corresponding path program 25 times [2022-04-08 10:04:33,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:33,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [197469889] [2022-04-08 10:04:33,492 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:04:33,492 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:04:33,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1753768806, now seen corresponding path program 26 times [2022-04-08 10:04:33,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:04:33,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704293981] [2022-04-08 10:04:33,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:04:33,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:04:33,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:33,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:04:33,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:33,610 INFO L290 TraceCheckUtils]: 0: Hoare triple {30529#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {30515#true} is VALID [2022-04-08 10:04:33,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {30515#true} assume true; {30515#true} is VALID [2022-04-08 10:04:33,611 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30515#true} {30515#true} #72#return; {30515#true} is VALID [2022-04-08 10:04:33,611 INFO L272 TraceCheckUtils]: 0: Hoare triple {30515#true} call ULTIMATE.init(); {30529#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:04:33,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {30529#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {30515#true} is VALID [2022-04-08 10:04:33,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {30515#true} assume true; {30515#true} is VALID [2022-04-08 10:04:33,611 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30515#true} {30515#true} #72#return; {30515#true} is VALID [2022-04-08 10:04:33,611 INFO L272 TraceCheckUtils]: 4: Hoare triple {30515#true} call #t~ret13 := main(); {30515#true} is VALID [2022-04-08 10:04:33,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {30515#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30520#(= main_~y~0 0)} is VALID [2022-04-08 10:04:33,612 INFO L290 TraceCheckUtils]: 6: Hoare triple {30520#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30521#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:33,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {30521#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30522#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:33,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {30522#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30523#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:33,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {30523#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30524#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:33,614 INFO L290 TraceCheckUtils]: 10: Hoare triple {30524#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30525#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:33,614 INFO L290 TraceCheckUtils]: 11: Hoare triple {30525#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {30525#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:33,614 INFO L290 TraceCheckUtils]: 12: Hoare triple {30525#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {30526#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:04:33,615 INFO L290 TraceCheckUtils]: 13: Hoare triple {30526#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30527#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:04:33,615 INFO L290 TraceCheckUtils]: 14: Hoare triple {30527#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30528#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:04:33,616 INFO L290 TraceCheckUtils]: 15: Hoare triple {30528#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {30516#false} is VALID [2022-04-08 10:04:33,616 INFO L290 TraceCheckUtils]: 16: Hoare triple {30516#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30516#false} is VALID [2022-04-08 10:04:33,616 INFO L290 TraceCheckUtils]: 17: Hoare triple {30516#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30516#false} is VALID [2022-04-08 10:04:33,616 INFO L290 TraceCheckUtils]: 18: Hoare triple {30516#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30516#false} is VALID [2022-04-08 10:04:33,616 INFO L290 TraceCheckUtils]: 19: Hoare triple {30516#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30516#false} is VALID [2022-04-08 10:04:33,616 INFO L290 TraceCheckUtils]: 20: Hoare triple {30516#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30516#false} is VALID [2022-04-08 10:04:33,616 INFO L290 TraceCheckUtils]: 21: Hoare triple {30516#false} assume !(~y~0 % 4294967296 > 0); {30516#false} is VALID [2022-04-08 10:04:33,616 INFO L290 TraceCheckUtils]: 22: Hoare triple {30516#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {30516#false} is VALID [2022-04-08 10:04:33,616 INFO L290 TraceCheckUtils]: 23: Hoare triple {30516#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {30516#false} is VALID [2022-04-08 10:04:33,616 INFO L290 TraceCheckUtils]: 24: Hoare triple {30516#false} assume !(~x~0 % 4294967296 > 0); {30516#false} is VALID [2022-04-08 10:04:33,616 INFO L272 TraceCheckUtils]: 25: Hoare triple {30516#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {30516#false} is VALID [2022-04-08 10:04:33,616 INFO L290 TraceCheckUtils]: 26: Hoare triple {30516#false} ~cond := #in~cond; {30516#false} is VALID [2022-04-08 10:04:33,616 INFO L290 TraceCheckUtils]: 27: Hoare triple {30516#false} assume 0 == ~cond; {30516#false} is VALID [2022-04-08 10:04:33,617 INFO L290 TraceCheckUtils]: 28: Hoare triple {30516#false} assume !false; {30516#false} is VALID [2022-04-08 10:04:33,617 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-08 10:04:33,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:04:33,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704293981] [2022-04-08 10:04:33,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704293981] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:04:33,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678932775] [2022-04-08 10:04:33,617 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:04:33,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:33,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:04:33,619 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:04:33,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-08 10:04:33,655 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:04:33,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:04:33,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 10:04:33,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:33,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:04:33,829 INFO L272 TraceCheckUtils]: 0: Hoare triple {30515#true} call ULTIMATE.init(); {30515#true} is VALID [2022-04-08 10:04:33,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {30515#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {30515#true} is VALID [2022-04-08 10:04:33,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {30515#true} assume true; {30515#true} is VALID [2022-04-08 10:04:33,829 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30515#true} {30515#true} #72#return; {30515#true} is VALID [2022-04-08 10:04:33,829 INFO L272 TraceCheckUtils]: 4: Hoare triple {30515#true} call #t~ret13 := main(); {30515#true} is VALID [2022-04-08 10:04:33,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {30515#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30520#(= main_~y~0 0)} is VALID [2022-04-08 10:04:33,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {30520#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30521#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:33,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {30521#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30522#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:33,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {30522#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30523#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:33,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {30523#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30524#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:33,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {30524#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30525#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:33,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {30525#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {30525#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:33,833 INFO L290 TraceCheckUtils]: 12: Hoare triple {30525#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {30569#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:33,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {30569#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30573#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:04:33,834 INFO L290 TraceCheckUtils]: 14: Hoare triple {30573#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30577#(and (<= 5 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:33,834 INFO L290 TraceCheckUtils]: 15: Hoare triple {30577#(and (<= 5 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= main_~y~0 5))} assume !(~z~0 % 4294967296 > 0); {30516#false} is VALID [2022-04-08 10:04:33,834 INFO L290 TraceCheckUtils]: 16: Hoare triple {30516#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30516#false} is VALID [2022-04-08 10:04:33,834 INFO L290 TraceCheckUtils]: 17: Hoare triple {30516#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30516#false} is VALID [2022-04-08 10:04:33,834 INFO L290 TraceCheckUtils]: 18: Hoare triple {30516#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30516#false} is VALID [2022-04-08 10:04:33,834 INFO L290 TraceCheckUtils]: 19: Hoare triple {30516#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30516#false} is VALID [2022-04-08 10:04:33,834 INFO L290 TraceCheckUtils]: 20: Hoare triple {30516#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30516#false} is VALID [2022-04-08 10:04:33,834 INFO L290 TraceCheckUtils]: 21: Hoare triple {30516#false} assume !(~y~0 % 4294967296 > 0); {30516#false} is VALID [2022-04-08 10:04:33,834 INFO L290 TraceCheckUtils]: 22: Hoare triple {30516#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {30516#false} is VALID [2022-04-08 10:04:33,834 INFO L290 TraceCheckUtils]: 23: Hoare triple {30516#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {30516#false} is VALID [2022-04-08 10:04:33,835 INFO L290 TraceCheckUtils]: 24: Hoare triple {30516#false} assume !(~x~0 % 4294967296 > 0); {30516#false} is VALID [2022-04-08 10:04:33,835 INFO L272 TraceCheckUtils]: 25: Hoare triple {30516#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {30516#false} is VALID [2022-04-08 10:04:33,835 INFO L290 TraceCheckUtils]: 26: Hoare triple {30516#false} ~cond := #in~cond; {30516#false} is VALID [2022-04-08 10:04:33,835 INFO L290 TraceCheckUtils]: 27: Hoare triple {30516#false} assume 0 == ~cond; {30516#false} is VALID [2022-04-08 10:04:33,835 INFO L290 TraceCheckUtils]: 28: Hoare triple {30516#false} assume !false; {30516#false} is VALID [2022-04-08 10:04:33,835 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-08 10:04:33,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:04:33,996 INFO L290 TraceCheckUtils]: 28: Hoare triple {30516#false} assume !false; {30516#false} is VALID [2022-04-08 10:04:33,996 INFO L290 TraceCheckUtils]: 27: Hoare triple {30516#false} assume 0 == ~cond; {30516#false} is VALID [2022-04-08 10:04:33,996 INFO L290 TraceCheckUtils]: 26: Hoare triple {30516#false} ~cond := #in~cond; {30516#false} is VALID [2022-04-08 10:04:33,996 INFO L272 TraceCheckUtils]: 25: Hoare triple {30516#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {30516#false} is VALID [2022-04-08 10:04:33,996 INFO L290 TraceCheckUtils]: 24: Hoare triple {30516#false} assume !(~x~0 % 4294967296 > 0); {30516#false} is VALID [2022-04-08 10:04:33,996 INFO L290 TraceCheckUtils]: 23: Hoare triple {30516#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {30516#false} is VALID [2022-04-08 10:04:33,996 INFO L290 TraceCheckUtils]: 22: Hoare triple {30516#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {30516#false} is VALID [2022-04-08 10:04:33,996 INFO L290 TraceCheckUtils]: 21: Hoare triple {30516#false} assume !(~y~0 % 4294967296 > 0); {30516#false} is VALID [2022-04-08 10:04:33,996 INFO L290 TraceCheckUtils]: 20: Hoare triple {30516#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30516#false} is VALID [2022-04-08 10:04:33,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {30516#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30516#false} is VALID [2022-04-08 10:04:33,997 INFO L290 TraceCheckUtils]: 18: Hoare triple {30650#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30516#false} is VALID [2022-04-08 10:04:33,998 INFO L290 TraceCheckUtils]: 17: Hoare triple {30654#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30650#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:04:33,998 INFO L290 TraceCheckUtils]: 16: Hoare triple {30658#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30654#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:04:33,999 INFO L290 TraceCheckUtils]: 15: Hoare triple {30662#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {30658#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:04:34,000 INFO L290 TraceCheckUtils]: 14: Hoare triple {30666#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30662#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-08 10:04:34,000 INFO L290 TraceCheckUtils]: 13: Hoare triple {30670#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30666#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:04:34,001 INFO L290 TraceCheckUtils]: 12: Hoare triple {30515#true} ~z~0 := ~y~0; {30670#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-08 10:04:34,001 INFO L290 TraceCheckUtils]: 11: Hoare triple {30515#true} assume !(~x~0 % 4294967296 > 0); {30515#true} is VALID [2022-04-08 10:04:34,001 INFO L290 TraceCheckUtils]: 10: Hoare triple {30515#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30515#true} is VALID [2022-04-08 10:04:34,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {30515#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30515#true} is VALID [2022-04-08 10:04:34,001 INFO L290 TraceCheckUtils]: 8: Hoare triple {30515#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30515#true} is VALID [2022-04-08 10:04:34,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {30515#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30515#true} is VALID [2022-04-08 10:04:34,001 INFO L290 TraceCheckUtils]: 6: Hoare triple {30515#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {30515#true} is VALID [2022-04-08 10:04:34,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {30515#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30515#true} is VALID [2022-04-08 10:04:34,001 INFO L272 TraceCheckUtils]: 4: Hoare triple {30515#true} call #t~ret13 := main(); {30515#true} is VALID [2022-04-08 10:04:34,001 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30515#true} {30515#true} #72#return; {30515#true} is VALID [2022-04-08 10:04:34,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {30515#true} assume true; {30515#true} is VALID [2022-04-08 10:04:34,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {30515#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {30515#true} is VALID [2022-04-08 10:04:34,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {30515#true} call ULTIMATE.init(); {30515#true} is VALID [2022-04-08 10:04:34,002 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-08 10:04:34,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678932775] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:04:34,002 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:04:34,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 8] total 21 [2022-04-08 10:04:34,002 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:04:34,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [197469889] [2022-04-08 10:04:34,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [197469889] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:04:34,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:04:34,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 10:04:34,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703716385] [2022-04-08 10:04:34,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:04:34,003 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 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 29 [2022-04-08 10:04:34,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:04:34,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 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-08 10:04:34,018 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:34,019 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 10:04:34,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:34,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 10:04:34,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2022-04-08 10:04:34,019 INFO L87 Difference]: Start difference. First operand 187 states and 254 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 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-08 10:04:35,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:35,848 INFO L93 Difference]: Finished difference Result 239 states and 311 transitions. [2022-04-08 10:04:35,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 10:04:35,848 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 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 29 [2022-04-08 10:04:35,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:04:35,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 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-08 10:04:35,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 71 transitions. [2022-04-08 10:04:35,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 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-08 10:04:35,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 71 transitions. [2022-04-08 10:04:35,849 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 71 transitions. [2022-04-08 10:04:35,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:35,904 INFO L225 Difference]: With dead ends: 239 [2022-04-08 10:04:35,904 INFO L226 Difference]: Without dead ends: 225 [2022-04-08 10:04:35,905 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=833, Unknown=0, NotChecked=0, Total=992 [2022-04-08 10:04:35,905 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 33 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:04:35,905 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 76 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:04:35,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-04-08 10:04:36,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 187. [2022-04-08 10:04:36,374 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:04:36,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 225 states. Second operand has 187 states, 182 states have (on average 1.3681318681318682) internal successors, (249), 182 states have internal predecessors, (249), 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-08 10:04:36,375 INFO L74 IsIncluded]: Start isIncluded. First operand 225 states. Second operand has 187 states, 182 states have (on average 1.3681318681318682) internal successors, (249), 182 states have internal predecessors, (249), 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-08 10:04:36,375 INFO L87 Difference]: Start difference. First operand 225 states. Second operand has 187 states, 182 states have (on average 1.3681318681318682) internal successors, (249), 182 states have internal predecessors, (249), 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-08 10:04:36,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:36,377 INFO L93 Difference]: Finished difference Result 225 states and 297 transitions. [2022-04-08 10:04:36,378 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 297 transitions. [2022-04-08 10:04:36,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:36,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:36,378 INFO L74 IsIncluded]: Start isIncluded. First operand has 187 states, 182 states have (on average 1.3681318681318682) internal successors, (249), 182 states have internal predecessors, (249), 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 225 states. [2022-04-08 10:04:36,378 INFO L87 Difference]: Start difference. First operand has 187 states, 182 states have (on average 1.3681318681318682) internal successors, (249), 182 states have internal predecessors, (249), 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 225 states. [2022-04-08 10:04:36,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:36,393 INFO L93 Difference]: Finished difference Result 225 states and 297 transitions. [2022-04-08 10:04:36,393 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 297 transitions. [2022-04-08 10:04:36,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:36,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:36,393 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:04:36,393 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:04:36,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 182 states have (on average 1.3681318681318682) internal successors, (249), 182 states have internal predecessors, (249), 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-08 10:04:36,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 253 transitions. [2022-04-08 10:04:36,395 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 253 transitions. Word has length 29 [2022-04-08 10:04:36,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:04:36,395 INFO L478 AbstractCegarLoop]: Abstraction has 187 states and 253 transitions. [2022-04-08 10:04:36,395 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 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-08 10:04:36,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 187 states and 253 transitions. [2022-04-08 10:04:37,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 253 edges. 253 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:37,080 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 253 transitions. [2022-04-08 10:04:37,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 10:04:37,081 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:04:37,081 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:04:37,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-08 10:04:37,296 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-04-08 10:04:37,297 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:04:37,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:04:37,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1067548216, now seen corresponding path program 27 times [2022-04-08 10:04:37,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:37,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1148626284] [2022-04-08 10:04:37,299 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:04:37,299 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:04:37,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1067548216, now seen corresponding path program 28 times [2022-04-08 10:04:37,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:04:37,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510759642] [2022-04-08 10:04:37,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:04:37,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:04:37,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:37,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:04:37,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:37,449 INFO L290 TraceCheckUtils]: 0: Hoare triple {32050#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32036#true} is VALID [2022-04-08 10:04:37,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {32036#true} assume true; {32036#true} is VALID [2022-04-08 10:04:37,449 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32036#true} {32036#true} #72#return; {32036#true} is VALID [2022-04-08 10:04:37,450 INFO L272 TraceCheckUtils]: 0: Hoare triple {32036#true} call ULTIMATE.init(); {32050#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:04:37,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {32050#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32036#true} is VALID [2022-04-08 10:04:37,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {32036#true} assume true; {32036#true} is VALID [2022-04-08 10:04:37,450 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32036#true} {32036#true} #72#return; {32036#true} is VALID [2022-04-08 10:04:37,450 INFO L272 TraceCheckUtils]: 4: Hoare triple {32036#true} call #t~ret13 := main(); {32036#true} is VALID [2022-04-08 10:04:37,450 INFO L290 TraceCheckUtils]: 5: Hoare triple {32036#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32041#(= main_~y~0 0)} is VALID [2022-04-08 10:04:37,450 INFO L290 TraceCheckUtils]: 6: Hoare triple {32041#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32042#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:37,451 INFO L290 TraceCheckUtils]: 7: Hoare triple {32042#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32043#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:37,451 INFO L290 TraceCheckUtils]: 8: Hoare triple {32043#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32044#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:37,452 INFO L290 TraceCheckUtils]: 9: Hoare triple {32044#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32045#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:37,452 INFO L290 TraceCheckUtils]: 10: Hoare triple {32045#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32046#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:37,453 INFO L290 TraceCheckUtils]: 11: Hoare triple {32046#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32047#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:37,453 INFO L290 TraceCheckUtils]: 12: Hoare triple {32047#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {32047#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:37,453 INFO L290 TraceCheckUtils]: 13: Hoare triple {32047#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {32048#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:04:37,454 INFO L290 TraceCheckUtils]: 14: Hoare triple {32048#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32049#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:04:37,454 INFO L290 TraceCheckUtils]: 15: Hoare triple {32049#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {32037#false} is VALID [2022-04-08 10:04:37,454 INFO L290 TraceCheckUtils]: 16: Hoare triple {32037#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32037#false} is VALID [2022-04-08 10:04:37,454 INFO L290 TraceCheckUtils]: 17: Hoare triple {32037#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32037#false} is VALID [2022-04-08 10:04:37,454 INFO L290 TraceCheckUtils]: 18: Hoare triple {32037#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32037#false} is VALID [2022-04-08 10:04:37,454 INFO L290 TraceCheckUtils]: 19: Hoare triple {32037#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32037#false} is VALID [2022-04-08 10:04:37,454 INFO L290 TraceCheckUtils]: 20: Hoare triple {32037#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32037#false} is VALID [2022-04-08 10:04:37,454 INFO L290 TraceCheckUtils]: 21: Hoare triple {32037#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32037#false} is VALID [2022-04-08 10:04:37,454 INFO L290 TraceCheckUtils]: 22: Hoare triple {32037#false} assume !(~y~0 % 4294967296 > 0); {32037#false} is VALID [2022-04-08 10:04:37,454 INFO L290 TraceCheckUtils]: 23: Hoare triple {32037#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {32037#false} is VALID [2022-04-08 10:04:37,455 INFO L290 TraceCheckUtils]: 24: Hoare triple {32037#false} assume !(~x~0 % 4294967296 > 0); {32037#false} is VALID [2022-04-08 10:04:37,455 INFO L272 TraceCheckUtils]: 25: Hoare triple {32037#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {32037#false} is VALID [2022-04-08 10:04:37,455 INFO L290 TraceCheckUtils]: 26: Hoare triple {32037#false} ~cond := #in~cond; {32037#false} is VALID [2022-04-08 10:04:37,455 INFO L290 TraceCheckUtils]: 27: Hoare triple {32037#false} assume 0 == ~cond; {32037#false} is VALID [2022-04-08 10:04:37,455 INFO L290 TraceCheckUtils]: 28: Hoare triple {32037#false} assume !false; {32037#false} is VALID [2022-04-08 10:04:37,455 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-08 10:04:37,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:04:37,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510759642] [2022-04-08 10:04:37,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510759642] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:04:37,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238553736] [2022-04-08 10:04:37,455 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:04:37,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:37,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:04:37,456 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:04:37,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-08 10:04:37,501 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:04:37,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:04:37,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 10:04:37,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:37,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:04:37,714 INFO L272 TraceCheckUtils]: 0: Hoare triple {32036#true} call ULTIMATE.init(); {32036#true} is VALID [2022-04-08 10:04:37,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {32036#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32036#true} is VALID [2022-04-08 10:04:37,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {32036#true} assume true; {32036#true} is VALID [2022-04-08 10:04:37,715 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32036#true} {32036#true} #72#return; {32036#true} is VALID [2022-04-08 10:04:37,715 INFO L272 TraceCheckUtils]: 4: Hoare triple {32036#true} call #t~ret13 := main(); {32036#true} is VALID [2022-04-08 10:04:37,715 INFO L290 TraceCheckUtils]: 5: Hoare triple {32036#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32041#(= main_~y~0 0)} is VALID [2022-04-08 10:04:37,715 INFO L290 TraceCheckUtils]: 6: Hoare triple {32041#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32042#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:37,716 INFO L290 TraceCheckUtils]: 7: Hoare triple {32042#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32043#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:37,716 INFO L290 TraceCheckUtils]: 8: Hoare triple {32043#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32044#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:37,717 INFO L290 TraceCheckUtils]: 9: Hoare triple {32044#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32045#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:37,717 INFO L290 TraceCheckUtils]: 10: Hoare triple {32045#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32046#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:37,718 INFO L290 TraceCheckUtils]: 11: Hoare triple {32046#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32047#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:37,718 INFO L290 TraceCheckUtils]: 12: Hoare triple {32047#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {32047#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:37,718 INFO L290 TraceCheckUtils]: 13: Hoare triple {32047#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {32048#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:04:37,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {32048#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32096#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:04:37,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {32096#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {32037#false} is VALID [2022-04-08 10:04:37,719 INFO L290 TraceCheckUtils]: 16: Hoare triple {32037#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32037#false} is VALID [2022-04-08 10:04:37,720 INFO L290 TraceCheckUtils]: 17: Hoare triple {32037#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32037#false} is VALID [2022-04-08 10:04:37,720 INFO L290 TraceCheckUtils]: 18: Hoare triple {32037#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32037#false} is VALID [2022-04-08 10:04:37,720 INFO L290 TraceCheckUtils]: 19: Hoare triple {32037#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32037#false} is VALID [2022-04-08 10:04:37,720 INFO L290 TraceCheckUtils]: 20: Hoare triple {32037#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32037#false} is VALID [2022-04-08 10:04:37,720 INFO L290 TraceCheckUtils]: 21: Hoare triple {32037#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32037#false} is VALID [2022-04-08 10:04:37,720 INFO L290 TraceCheckUtils]: 22: Hoare triple {32037#false} assume !(~y~0 % 4294967296 > 0); {32037#false} is VALID [2022-04-08 10:04:37,720 INFO L290 TraceCheckUtils]: 23: Hoare triple {32037#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {32037#false} is VALID [2022-04-08 10:04:37,720 INFO L290 TraceCheckUtils]: 24: Hoare triple {32037#false} assume !(~x~0 % 4294967296 > 0); {32037#false} is VALID [2022-04-08 10:04:37,720 INFO L272 TraceCheckUtils]: 25: Hoare triple {32037#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {32037#false} is VALID [2022-04-08 10:04:37,720 INFO L290 TraceCheckUtils]: 26: Hoare triple {32037#false} ~cond := #in~cond; {32037#false} is VALID [2022-04-08 10:04:37,720 INFO L290 TraceCheckUtils]: 27: Hoare triple {32037#false} assume 0 == ~cond; {32037#false} is VALID [2022-04-08 10:04:37,720 INFO L290 TraceCheckUtils]: 28: Hoare triple {32037#false} assume !false; {32037#false} is VALID [2022-04-08 10:04:37,720 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-08 10:04:37,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:04:37,896 INFO L290 TraceCheckUtils]: 28: Hoare triple {32037#false} assume !false; {32037#false} is VALID [2022-04-08 10:04:37,896 INFO L290 TraceCheckUtils]: 27: Hoare triple {32037#false} assume 0 == ~cond; {32037#false} is VALID [2022-04-08 10:04:37,897 INFO L290 TraceCheckUtils]: 26: Hoare triple {32037#false} ~cond := #in~cond; {32037#false} is VALID [2022-04-08 10:04:37,897 INFO L272 TraceCheckUtils]: 25: Hoare triple {32037#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {32037#false} is VALID [2022-04-08 10:04:37,897 INFO L290 TraceCheckUtils]: 24: Hoare triple {32037#false} assume !(~x~0 % 4294967296 > 0); {32037#false} is VALID [2022-04-08 10:04:37,897 INFO L290 TraceCheckUtils]: 23: Hoare triple {32037#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {32037#false} is VALID [2022-04-08 10:04:37,897 INFO L290 TraceCheckUtils]: 22: Hoare triple {32037#false} assume !(~y~0 % 4294967296 > 0); {32037#false} is VALID [2022-04-08 10:04:37,897 INFO L290 TraceCheckUtils]: 21: Hoare triple {32037#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32037#false} is VALID [2022-04-08 10:04:37,897 INFO L290 TraceCheckUtils]: 20: Hoare triple {32037#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32037#false} is VALID [2022-04-08 10:04:37,908 INFO L290 TraceCheckUtils]: 19: Hoare triple {32037#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32037#false} is VALID [2022-04-08 10:04:37,908 INFO L290 TraceCheckUtils]: 18: Hoare triple {32037#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32037#false} is VALID [2022-04-08 10:04:37,908 INFO L290 TraceCheckUtils]: 17: Hoare triple {32037#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32037#false} is VALID [2022-04-08 10:04:37,908 INFO L290 TraceCheckUtils]: 16: Hoare triple {32037#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32037#false} is VALID [2022-04-08 10:04:37,908 INFO L290 TraceCheckUtils]: 15: Hoare triple {32178#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {32037#false} is VALID [2022-04-08 10:04:37,909 INFO L290 TraceCheckUtils]: 14: Hoare triple {32182#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32178#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:04:37,909 INFO L290 TraceCheckUtils]: 13: Hoare triple {32186#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {32182#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:37,910 INFO L290 TraceCheckUtils]: 12: Hoare triple {32186#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {32186#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:37,910 INFO L290 TraceCheckUtils]: 11: Hoare triple {32193#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32186#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:04:37,911 INFO L290 TraceCheckUtils]: 10: Hoare triple {32197#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32193#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:04:37,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {32201#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32197#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:04:37,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {32205#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32201#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:04:37,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {32209#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32205#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:04:37,913 INFO L290 TraceCheckUtils]: 6: Hoare triple {32213#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {32209#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:04:37,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {32036#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32213#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:37,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {32036#true} call #t~ret13 := main(); {32036#true} is VALID [2022-04-08 10:04:37,914 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32036#true} {32036#true} #72#return; {32036#true} is VALID [2022-04-08 10:04:37,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {32036#true} assume true; {32036#true} is VALID [2022-04-08 10:04:37,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {32036#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32036#true} is VALID [2022-04-08 10:04:37,914 INFO L272 TraceCheckUtils]: 0: Hoare triple {32036#true} call ULTIMATE.init(); {32036#true} is VALID [2022-04-08 10:04:37,916 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-08 10:04:37,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238553736] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:04:37,917 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:04:37,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-08 10:04:37,917 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:04:37,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1148626284] [2022-04-08 10:04:37,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1148626284] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:04:37,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:04:37,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 10:04:37,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561474838] [2022-04-08 10:04:37,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:04:37,918 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 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 29 [2022-04-08 10:04:37,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:04:37,918 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 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-08 10:04:37,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:37,932 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 10:04:37,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:37,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 10:04:37,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2022-04-08 10:04:37,933 INFO L87 Difference]: Start difference. First operand 187 states and 253 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 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-08 10:04:39,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:39,656 INFO L93 Difference]: Finished difference Result 254 states and 326 transitions. [2022-04-08 10:04:39,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 10:04:39,657 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 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 29 [2022-04-08 10:04:39,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:04:39,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 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-08 10:04:39,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 78 transitions. [2022-04-08 10:04:39,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 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-08 10:04:39,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 78 transitions. [2022-04-08 10:04:39,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 78 transitions. [2022-04-08 10:04:39,717 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:39,720 INFO L225 Difference]: With dead ends: 254 [2022-04-08 10:04:39,720 INFO L226 Difference]: Without dead ends: 240 [2022-04-08 10:04:39,720 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=218, Invalid=774, Unknown=0, NotChecked=0, Total=992 [2022-04-08 10:04:39,720 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 44 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:04:39,720 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 79 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:04:39,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-04-08 10:04:40,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 187. [2022-04-08 10:04:40,360 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:04:40,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 240 states. Second operand has 187 states, 182 states have (on average 1.3626373626373627) internal successors, (248), 182 states have internal predecessors, (248), 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-08 10:04:40,361 INFO L74 IsIncluded]: Start isIncluded. First operand 240 states. Second operand has 187 states, 182 states have (on average 1.3626373626373627) internal successors, (248), 182 states have internal predecessors, (248), 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-08 10:04:40,361 INFO L87 Difference]: Start difference. First operand 240 states. Second operand has 187 states, 182 states have (on average 1.3626373626373627) internal successors, (248), 182 states have internal predecessors, (248), 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-08 10:04:40,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:40,364 INFO L93 Difference]: Finished difference Result 240 states and 312 transitions. [2022-04-08 10:04:40,364 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 312 transitions. [2022-04-08 10:04:40,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:40,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:40,364 INFO L74 IsIncluded]: Start isIncluded. First operand has 187 states, 182 states have (on average 1.3626373626373627) internal successors, (248), 182 states have internal predecessors, (248), 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 240 states. [2022-04-08 10:04:40,364 INFO L87 Difference]: Start difference. First operand has 187 states, 182 states have (on average 1.3626373626373627) internal successors, (248), 182 states have internal predecessors, (248), 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 240 states. [2022-04-08 10:04:40,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:40,366 INFO L93 Difference]: Finished difference Result 240 states and 312 transitions. [2022-04-08 10:04:40,367 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 312 transitions. [2022-04-08 10:04:40,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:40,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:40,367 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:04:40,367 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:04:40,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 182 states have (on average 1.3626373626373627) internal successors, (248), 182 states have internal predecessors, (248), 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-08 10:04:40,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 252 transitions. [2022-04-08 10:04:40,369 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 252 transitions. Word has length 29 [2022-04-08 10:04:40,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:04:40,369 INFO L478 AbstractCegarLoop]: Abstraction has 187 states and 252 transitions. [2022-04-08 10:04:40,369 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 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-08 10:04:40,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 187 states and 252 transitions. [2022-04-08 10:04:41,139 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 252 edges. 252 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:41,139 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 252 transitions. [2022-04-08 10:04:41,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 10:04:41,139 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:04:41,139 INFO L499 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:04:41,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-04-08 10:04:41,340 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-04-08 10:04:41,340 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:04:41,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:04:41,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1675631048, now seen corresponding path program 27 times [2022-04-08 10:04:41,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:41,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [93831861] [2022-04-08 10:04:41,342 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:04:41,342 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:04:41,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1675631048, now seen corresponding path program 28 times [2022-04-08 10:04:41,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:04:41,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035922307] [2022-04-08 10:04:41,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:04:41,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:04:41,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:41,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:04:41,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:41,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {33637#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {33616#true} is VALID [2022-04-08 10:04:41,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {33616#true} assume true; {33616#true} is VALID [2022-04-08 10:04:41,569 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33616#true} {33616#true} #72#return; {33616#true} is VALID [2022-04-08 10:04:41,570 INFO L272 TraceCheckUtils]: 0: Hoare triple {33616#true} call ULTIMATE.init(); {33637#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:04:41,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {33637#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {33616#true} is VALID [2022-04-08 10:04:41,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {33616#true} assume true; {33616#true} is VALID [2022-04-08 10:04:41,570 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33616#true} {33616#true} #72#return; {33616#true} is VALID [2022-04-08 10:04:41,570 INFO L272 TraceCheckUtils]: 4: Hoare triple {33616#true} call #t~ret13 := main(); {33616#true} is VALID [2022-04-08 10:04:41,570 INFO L290 TraceCheckUtils]: 5: Hoare triple {33616#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {33621#(= main_~y~0 0)} is VALID [2022-04-08 10:04:41,571 INFO L290 TraceCheckUtils]: 6: Hoare triple {33621#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33622#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:41,571 INFO L290 TraceCheckUtils]: 7: Hoare triple {33622#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33623#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:41,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {33623#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33624#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:41,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {33624#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33625#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:41,573 INFO L290 TraceCheckUtils]: 10: Hoare triple {33625#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33626#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:41,573 INFO L290 TraceCheckUtils]: 11: Hoare triple {33626#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33627#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:41,574 INFO L290 TraceCheckUtils]: 12: Hoare triple {33627#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33628#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:41,574 INFO L290 TraceCheckUtils]: 13: Hoare triple {33628#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33629#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:41,574 INFO L290 TraceCheckUtils]: 14: Hoare triple {33629#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33630#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:04:41,575 INFO L290 TraceCheckUtils]: 15: Hoare triple {33630#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33631#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:04:41,575 INFO L290 TraceCheckUtils]: 16: Hoare triple {33631#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33632#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:04:41,576 INFO L290 TraceCheckUtils]: 17: Hoare triple {33632#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33633#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:04:41,576 INFO L290 TraceCheckUtils]: 18: Hoare triple {33633#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33634#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:04:41,577 INFO L290 TraceCheckUtils]: 19: Hoare triple {33634#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33635#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:04:41,577 INFO L290 TraceCheckUtils]: 20: Hoare triple {33635#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {33635#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:04:41,578 INFO L290 TraceCheckUtils]: 21: Hoare triple {33635#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {33636#(and (<= 14 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:04:41,578 INFO L290 TraceCheckUtils]: 22: Hoare triple {33636#(and (<= 14 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {33617#false} is VALID [2022-04-08 10:04:41,578 INFO L290 TraceCheckUtils]: 23: Hoare triple {33617#false} assume !(~y~0 % 4294967296 > 0); {33617#false} is VALID [2022-04-08 10:04:41,578 INFO L290 TraceCheckUtils]: 24: Hoare triple {33617#false} assume !(~x~0 % 4294967296 > 0); {33617#false} is VALID [2022-04-08 10:04:41,578 INFO L272 TraceCheckUtils]: 25: Hoare triple {33617#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {33617#false} is VALID [2022-04-08 10:04:41,578 INFO L290 TraceCheckUtils]: 26: Hoare triple {33617#false} ~cond := #in~cond; {33617#false} is VALID [2022-04-08 10:04:41,578 INFO L290 TraceCheckUtils]: 27: Hoare triple {33617#false} assume 0 == ~cond; {33617#false} is VALID [2022-04-08 10:04:41,578 INFO L290 TraceCheckUtils]: 28: Hoare triple {33617#false} assume !false; {33617#false} is VALID [2022-04-08 10:04:41,579 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:04:41,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:04:41,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035922307] [2022-04-08 10:04:41,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035922307] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:04:41,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656790138] [2022-04-08 10:04:41,579 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:04:41,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:41,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:04:41,580 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:04:41,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-08 10:04:41,614 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:04:41,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:04:41,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 10:04:41,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:41,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:04:41,885 INFO L272 TraceCheckUtils]: 0: Hoare triple {33616#true} call ULTIMATE.init(); {33616#true} is VALID [2022-04-08 10:04:41,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {33616#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {33616#true} is VALID [2022-04-08 10:04:41,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {33616#true} assume true; {33616#true} is VALID [2022-04-08 10:04:41,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33616#true} {33616#true} #72#return; {33616#true} is VALID [2022-04-08 10:04:41,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {33616#true} call #t~ret13 := main(); {33616#true} is VALID [2022-04-08 10:04:41,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {33616#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {33621#(= main_~y~0 0)} is VALID [2022-04-08 10:04:41,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {33621#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33622#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:41,887 INFO L290 TraceCheckUtils]: 7: Hoare triple {33622#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33623#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:41,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {33623#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33624#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:41,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {33624#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33625#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:41,888 INFO L290 TraceCheckUtils]: 10: Hoare triple {33625#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33626#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:41,889 INFO L290 TraceCheckUtils]: 11: Hoare triple {33626#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33627#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:41,889 INFO L290 TraceCheckUtils]: 12: Hoare triple {33627#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33628#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:41,890 INFO L290 TraceCheckUtils]: 13: Hoare triple {33628#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33629#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:41,890 INFO L290 TraceCheckUtils]: 14: Hoare triple {33629#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33630#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:04:41,891 INFO L290 TraceCheckUtils]: 15: Hoare triple {33630#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33631#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:04:41,891 INFO L290 TraceCheckUtils]: 16: Hoare triple {33631#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33632#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:04:41,892 INFO L290 TraceCheckUtils]: 17: Hoare triple {33632#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33633#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:04:41,892 INFO L290 TraceCheckUtils]: 18: Hoare triple {33633#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33634#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:04:41,893 INFO L290 TraceCheckUtils]: 19: Hoare triple {33634#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33635#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:04:41,893 INFO L290 TraceCheckUtils]: 20: Hoare triple {33635#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {33635#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:04:41,893 INFO L290 TraceCheckUtils]: 21: Hoare triple {33635#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {33704#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-08 10:04:41,894 INFO L290 TraceCheckUtils]: 22: Hoare triple {33704#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !(~z~0 % 4294967296 > 0); {33617#false} is VALID [2022-04-08 10:04:41,894 INFO L290 TraceCheckUtils]: 23: Hoare triple {33617#false} assume !(~y~0 % 4294967296 > 0); {33617#false} is VALID [2022-04-08 10:04:41,894 INFO L290 TraceCheckUtils]: 24: Hoare triple {33617#false} assume !(~x~0 % 4294967296 > 0); {33617#false} is VALID [2022-04-08 10:04:41,894 INFO L272 TraceCheckUtils]: 25: Hoare triple {33617#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {33617#false} is VALID [2022-04-08 10:04:41,894 INFO L290 TraceCheckUtils]: 26: Hoare triple {33617#false} ~cond := #in~cond; {33617#false} is VALID [2022-04-08 10:04:41,894 INFO L290 TraceCheckUtils]: 27: Hoare triple {33617#false} assume 0 == ~cond; {33617#false} is VALID [2022-04-08 10:04:41,894 INFO L290 TraceCheckUtils]: 28: Hoare triple {33617#false} assume !false; {33617#false} is VALID [2022-04-08 10:04:41,894 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:04:41,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:04:42,343 INFO L290 TraceCheckUtils]: 28: Hoare triple {33617#false} assume !false; {33617#false} is VALID [2022-04-08 10:04:42,344 INFO L290 TraceCheckUtils]: 27: Hoare triple {33617#false} assume 0 == ~cond; {33617#false} is VALID [2022-04-08 10:04:42,344 INFO L290 TraceCheckUtils]: 26: Hoare triple {33617#false} ~cond := #in~cond; {33617#false} is VALID [2022-04-08 10:04:42,344 INFO L272 TraceCheckUtils]: 25: Hoare triple {33617#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {33617#false} is VALID [2022-04-08 10:04:42,344 INFO L290 TraceCheckUtils]: 24: Hoare triple {33617#false} assume !(~x~0 % 4294967296 > 0); {33617#false} is VALID [2022-04-08 10:04:42,344 INFO L290 TraceCheckUtils]: 23: Hoare triple {33617#false} assume !(~y~0 % 4294967296 > 0); {33617#false} is VALID [2022-04-08 10:04:42,344 INFO L290 TraceCheckUtils]: 22: Hoare triple {33744#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {33617#false} is VALID [2022-04-08 10:04:42,344 INFO L290 TraceCheckUtils]: 21: Hoare triple {33748#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {33744#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:04:42,345 INFO L290 TraceCheckUtils]: 20: Hoare triple {33748#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {33748#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:04:42,345 INFO L290 TraceCheckUtils]: 19: Hoare triple {33755#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33748#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:04:42,346 INFO L290 TraceCheckUtils]: 18: Hoare triple {33759#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33755#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:04:42,347 INFO L290 TraceCheckUtils]: 17: Hoare triple {33763#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33759#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:04:42,347 INFO L290 TraceCheckUtils]: 16: Hoare triple {33767#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33763#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:04:42,348 INFO L290 TraceCheckUtils]: 15: Hoare triple {33771#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33767#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:04:42,348 INFO L290 TraceCheckUtils]: 14: Hoare triple {33775#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33771#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:42,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {33779#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33775#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:04:42,349 INFO L290 TraceCheckUtils]: 12: Hoare triple {33783#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33779#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:42,350 INFO L290 TraceCheckUtils]: 11: Hoare triple {33787#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33783#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:04:42,351 INFO L290 TraceCheckUtils]: 10: Hoare triple {33791#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33787#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:04:42,351 INFO L290 TraceCheckUtils]: 9: Hoare triple {33795#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33791#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:04:42,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {33799#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33795#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:04:42,353 INFO L290 TraceCheckUtils]: 7: Hoare triple {33803#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33799#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:04:42,353 INFO L290 TraceCheckUtils]: 6: Hoare triple {33807#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {33803#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:04:42,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {33616#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {33807#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:04:42,354 INFO L272 TraceCheckUtils]: 4: Hoare triple {33616#true} call #t~ret13 := main(); {33616#true} is VALID [2022-04-08 10:04:42,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33616#true} {33616#true} #72#return; {33616#true} is VALID [2022-04-08 10:04:42,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {33616#true} assume true; {33616#true} is VALID [2022-04-08 10:04:42,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {33616#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {33616#true} is VALID [2022-04-08 10:04:42,354 INFO L272 TraceCheckUtils]: 0: Hoare triple {33616#true} call ULTIMATE.init(); {33616#true} is VALID [2022-04-08 10:04:42,354 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:04:42,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656790138] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:04:42,354 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:04:42,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-08 10:04:42,354 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:04:42,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [93831861] [2022-04-08 10:04:42,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [93831861] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:04:42,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:04:42,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 10:04:42,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377931438] [2022-04-08 10:04:42,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:04:42,355 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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 29 [2022-04-08 10:04:42,355 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:04:42,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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-08 10:04:42,372 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-08 10:04:42,372 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 10:04:42,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:42,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 10:04:42,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=964, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 10:04:42,372 INFO L87 Difference]: Start difference. First operand 187 states and 252 transitions. Second operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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-08 10:04:45,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:45,723 INFO L93 Difference]: Finished difference Result 333 states and 501 transitions. [2022-04-08 10:04:45,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 10:04:45,723 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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 29 [2022-04-08 10:04:45,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:04:45,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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-08 10:04:45,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 163 transitions. [2022-04-08 10:04:45,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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-08 10:04:45,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 163 transitions. [2022-04-08 10:04:45,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 163 transitions. [2022-04-08 10:04:45,807 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:45,811 INFO L225 Difference]: With dead ends: 333 [2022-04-08 10:04:45,811 INFO L226 Difference]: Without dead ends: 313 [2022-04-08 10:04:45,811 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=602, Invalid=2050, Unknown=0, NotChecked=0, Total=2652 [2022-04-08 10:04:45,812 INFO L913 BasicCegarLoop]: 71 mSDtfsCounter, 118 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1924 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 2006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:04:45,812 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 153 Invalid, 2006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1924 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-08 10:04:45,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-04-08 10:04:46,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 200. [2022-04-08 10:04:46,220 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:04:46,220 INFO L82 GeneralOperation]: Start isEquivalent. First operand 313 states. Second operand has 200 states, 195 states have (on average 1.3692307692307693) internal successors, (267), 195 states have internal predecessors, (267), 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-08 10:04:46,235 INFO L74 IsIncluded]: Start isIncluded. First operand 313 states. Second operand has 200 states, 195 states have (on average 1.3692307692307693) internal successors, (267), 195 states have internal predecessors, (267), 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-08 10:04:46,235 INFO L87 Difference]: Start difference. First operand 313 states. Second operand has 200 states, 195 states have (on average 1.3692307692307693) internal successors, (267), 195 states have internal predecessors, (267), 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-08 10:04:46,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:46,239 INFO L93 Difference]: Finished difference Result 313 states and 399 transitions. [2022-04-08 10:04:46,239 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 399 transitions. [2022-04-08 10:04:46,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:46,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:46,239 INFO L74 IsIncluded]: Start isIncluded. First operand has 200 states, 195 states have (on average 1.3692307692307693) internal successors, (267), 195 states have internal predecessors, (267), 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 313 states. [2022-04-08 10:04:46,240 INFO L87 Difference]: Start difference. First operand has 200 states, 195 states have (on average 1.3692307692307693) internal successors, (267), 195 states have internal predecessors, (267), 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 313 states. [2022-04-08 10:04:46,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:46,243 INFO L93 Difference]: Finished difference Result 313 states and 399 transitions. [2022-04-08 10:04:46,243 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 399 transitions. [2022-04-08 10:04:46,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:46,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:46,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:04:46,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:04:46,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 195 states have (on average 1.3692307692307693) internal successors, (267), 195 states have internal predecessors, (267), 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-08 10:04:46,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 271 transitions. [2022-04-08 10:04:46,262 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 271 transitions. Word has length 29 [2022-04-08 10:04:46,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:04:46,262 INFO L478 AbstractCegarLoop]: Abstraction has 200 states and 271 transitions. [2022-04-08 10:04:46,263 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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-08 10:04:46,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 200 states and 271 transitions. [2022-04-08 10:04:46,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 271 edges. 271 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:46,927 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 271 transitions. [2022-04-08 10:04:46,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 10:04:46,928 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:04:46,928 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:04:46,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-04-08 10:04:47,143 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-08 10:04:47,144 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:04:47,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:04:47,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1541621168, now seen corresponding path program 17 times [2022-04-08 10:04:47,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:47,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [334399950] [2022-04-08 10:04:47,159 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:04:47,159 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:04:47,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1541621168, now seen corresponding path program 18 times [2022-04-08 10:04:47,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:04:47,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611972089] [2022-04-08 10:04:47,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:04:47,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:04:47,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:47,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:04:47,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:47,283 INFO L290 TraceCheckUtils]: 0: Hoare triple {35567#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {35552#true} is VALID [2022-04-08 10:04:47,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {35552#true} assume true; {35552#true} is VALID [2022-04-08 10:04:47,284 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35552#true} {35552#true} #72#return; {35552#true} is VALID [2022-04-08 10:04:47,284 INFO L272 TraceCheckUtils]: 0: Hoare triple {35552#true} call ULTIMATE.init(); {35567#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:04:47,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {35567#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {35552#true} is VALID [2022-04-08 10:04:47,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {35552#true} assume true; {35552#true} is VALID [2022-04-08 10:04:47,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35552#true} {35552#true} #72#return; {35552#true} is VALID [2022-04-08 10:04:47,284 INFO L272 TraceCheckUtils]: 4: Hoare triple {35552#true} call #t~ret13 := main(); {35552#true} is VALID [2022-04-08 10:04:47,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {35552#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35552#true} is VALID [2022-04-08 10:04:47,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {35552#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35557#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:04:47,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {35557#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35558#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-08 10:04:47,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {35558#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35559#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:04:47,287 INFO L290 TraceCheckUtils]: 9: Hoare triple {35559#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35560#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:04:47,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {35560#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35561#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:04:47,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {35561#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {35561#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:04:47,289 INFO L290 TraceCheckUtils]: 12: Hoare triple {35561#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {35561#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:04:47,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {35561#(<= (* (div (+ 5 main_~x~0) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {35562#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-08 10:04:47,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {35562#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {35563#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 2) main_~x~0)} is VALID [2022-04-08 10:04:47,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {35563#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 2) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {35564#(<= (+ 3 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:04:47,291 INFO L290 TraceCheckUtils]: 16: Hoare triple {35564#(<= (+ 3 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {35565#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-08 10:04:47,292 INFO L290 TraceCheckUtils]: 17: Hoare triple {35565#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {35566#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:04:47,292 INFO L290 TraceCheckUtils]: 18: Hoare triple {35566#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {35566#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:04:47,293 INFO L290 TraceCheckUtils]: 19: Hoare triple {35566#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35566#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:04:47,293 INFO L290 TraceCheckUtils]: 20: Hoare triple {35566#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35566#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:04:47,293 INFO L290 TraceCheckUtils]: 21: Hoare triple {35566#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35566#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:04:47,294 INFO L290 TraceCheckUtils]: 22: Hoare triple {35566#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35566#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:04:47,294 INFO L290 TraceCheckUtils]: 23: Hoare triple {35566#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35566#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:04:47,295 INFO L290 TraceCheckUtils]: 24: Hoare triple {35566#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {35566#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:04:47,295 INFO L290 TraceCheckUtils]: 25: Hoare triple {35566#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {35553#false} is VALID [2022-04-08 10:04:47,295 INFO L272 TraceCheckUtils]: 26: Hoare triple {35553#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {35553#false} is VALID [2022-04-08 10:04:47,295 INFO L290 TraceCheckUtils]: 27: Hoare triple {35553#false} ~cond := #in~cond; {35553#false} is VALID [2022-04-08 10:04:47,295 INFO L290 TraceCheckUtils]: 28: Hoare triple {35553#false} assume 0 == ~cond; {35553#false} is VALID [2022-04-08 10:04:47,295 INFO L290 TraceCheckUtils]: 29: Hoare triple {35553#false} assume !false; {35553#false} is VALID [2022-04-08 10:04:47,295 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 10:04:47,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:04:47,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611972089] [2022-04-08 10:04:47,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611972089] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:04:47,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965144574] [2022-04-08 10:04:47,296 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:04:47,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:47,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:04:47,311 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:04:47,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-04-08 10:04:47,346 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 10:04:47,346 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:04:47,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-08 10:04:47,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:47,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:04:47,639 INFO L272 TraceCheckUtils]: 0: Hoare triple {35552#true} call ULTIMATE.init(); {35552#true} is VALID [2022-04-08 10:04:47,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {35552#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {35552#true} is VALID [2022-04-08 10:04:47,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {35552#true} assume true; {35552#true} is VALID [2022-04-08 10:04:47,639 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35552#true} {35552#true} #72#return; {35552#true} is VALID [2022-04-08 10:04:47,639 INFO L272 TraceCheckUtils]: 4: Hoare triple {35552#true} call #t~ret13 := main(); {35552#true} is VALID [2022-04-08 10:04:47,640 INFO L290 TraceCheckUtils]: 5: Hoare triple {35552#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35552#true} is VALID [2022-04-08 10:04:47,640 INFO L290 TraceCheckUtils]: 6: Hoare triple {35552#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35557#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:04:47,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {35557#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35592#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:04:47,642 INFO L290 TraceCheckUtils]: 8: Hoare triple {35592#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35596#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:47,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {35596#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35600#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:04:47,643 INFO L290 TraceCheckUtils]: 10: Hoare triple {35600#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35604#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:47,643 INFO L290 TraceCheckUtils]: 11: Hoare triple {35604#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {35604#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:47,644 INFO L290 TraceCheckUtils]: 12: Hoare triple {35604#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} ~z~0 := ~y~0; {35604#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:47,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {35604#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {35600#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:04:47,645 INFO L290 TraceCheckUtils]: 14: Hoare triple {35600#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {35596#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:47,646 INFO L290 TraceCheckUtils]: 15: Hoare triple {35596#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {35592#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:04:47,646 INFO L290 TraceCheckUtils]: 16: Hoare triple {35592#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {35557#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:04:47,647 INFO L290 TraceCheckUtils]: 17: Hoare triple {35557#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:47,647 INFO L290 TraceCheckUtils]: 18: Hoare triple {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:47,647 INFO L290 TraceCheckUtils]: 19: Hoare triple {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:47,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:47,648 INFO L290 TraceCheckUtils]: 21: Hoare triple {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:47,648 INFO L290 TraceCheckUtils]: 22: Hoare triple {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:47,649 INFO L290 TraceCheckUtils]: 23: Hoare triple {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:47,649 INFO L290 TraceCheckUtils]: 24: Hoare triple {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:47,649 INFO L290 TraceCheckUtils]: 25: Hoare triple {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {35553#false} is VALID [2022-04-08 10:04:47,649 INFO L272 TraceCheckUtils]: 26: Hoare triple {35553#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {35553#false} is VALID [2022-04-08 10:04:47,649 INFO L290 TraceCheckUtils]: 27: Hoare triple {35553#false} ~cond := #in~cond; {35553#false} is VALID [2022-04-08 10:04:47,650 INFO L290 TraceCheckUtils]: 28: Hoare triple {35553#false} assume 0 == ~cond; {35553#false} is VALID [2022-04-08 10:04:47,650 INFO L290 TraceCheckUtils]: 29: Hoare triple {35553#false} assume !false; {35553#false} is VALID [2022-04-08 10:04:47,650 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 10:04:47,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:04:47,769 INFO L290 TraceCheckUtils]: 29: Hoare triple {35553#false} assume !false; {35553#false} is VALID [2022-04-08 10:04:47,770 INFO L290 TraceCheckUtils]: 28: Hoare triple {35553#false} assume 0 == ~cond; {35553#false} is VALID [2022-04-08 10:04:47,770 INFO L290 TraceCheckUtils]: 27: Hoare triple {35553#false} ~cond := #in~cond; {35553#false} is VALID [2022-04-08 10:04:47,770 INFO L272 TraceCheckUtils]: 26: Hoare triple {35553#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {35553#false} is VALID [2022-04-08 10:04:47,770 INFO L290 TraceCheckUtils]: 25: Hoare triple {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {35553#false} is VALID [2022-04-08 10:04:47,771 INFO L290 TraceCheckUtils]: 24: Hoare triple {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:47,771 INFO L290 TraceCheckUtils]: 23: Hoare triple {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:47,771 INFO L290 TraceCheckUtils]: 22: Hoare triple {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:47,772 INFO L290 TraceCheckUtils]: 21: Hoare triple {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:47,772 INFO L290 TraceCheckUtils]: 20: Hoare triple {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:47,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:47,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:47,773 INFO L290 TraceCheckUtils]: 17: Hoare triple {35557#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {35626#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:47,774 INFO L290 TraceCheckUtils]: 16: Hoare triple {35592#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {35557#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:04:47,774 INFO L290 TraceCheckUtils]: 15: Hoare triple {35596#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {35592#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:04:47,775 INFO L290 TraceCheckUtils]: 14: Hoare triple {35600#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {35596#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:47,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {35604#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {35600#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:04:47,776 INFO L290 TraceCheckUtils]: 12: Hoare triple {35604#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} ~z~0 := ~y~0; {35604#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:47,776 INFO L290 TraceCheckUtils]: 11: Hoare triple {35604#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {35604#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:47,777 INFO L290 TraceCheckUtils]: 10: Hoare triple {35600#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35604#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:47,778 INFO L290 TraceCheckUtils]: 9: Hoare triple {35596#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35600#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:04:47,778 INFO L290 TraceCheckUtils]: 8: Hoare triple {35592#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35596#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:04:47,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {35557#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35592#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:04:47,780 INFO L290 TraceCheckUtils]: 6: Hoare triple {35552#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {35557#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:04:47,780 INFO L290 TraceCheckUtils]: 5: Hoare triple {35552#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35552#true} is VALID [2022-04-08 10:04:47,780 INFO L272 TraceCheckUtils]: 4: Hoare triple {35552#true} call #t~ret13 := main(); {35552#true} is VALID [2022-04-08 10:04:47,780 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35552#true} {35552#true} #72#return; {35552#true} is VALID [2022-04-08 10:04:47,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {35552#true} assume true; {35552#true} is VALID [2022-04-08 10:04:47,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {35552#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {35552#true} is VALID [2022-04-08 10:04:47,780 INFO L272 TraceCheckUtils]: 0: Hoare triple {35552#true} call ULTIMATE.init(); {35552#true} is VALID [2022-04-08 10:04:47,780 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 10:04:47,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965144574] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:04:47,780 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:04:47,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 18 [2022-04-08 10:04:47,780 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:04:47,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [334399950] [2022-04-08 10:04:47,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [334399950] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:04:47,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:04:47,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 10:04:47,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537242237] [2022-04-08 10:04:47,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:04:47,781 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 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 30 [2022-04-08 10:04:47,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:04:47,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 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-08 10:04:47,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:47,803 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 10:04:47,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:47,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 10:04:47,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2022-04-08 10:04:47,804 INFO L87 Difference]: Start difference. First operand 200 states and 271 transitions. Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 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-08 10:04:49,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:49,315 INFO L93 Difference]: Finished difference Result 242 states and 334 transitions. [2022-04-08 10:04:49,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 10:04:49,315 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 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 30 [2022-04-08 10:04:49,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:04:49,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 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-08 10:04:49,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 73 transitions. [2022-04-08 10:04:49,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 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-08 10:04:49,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 73 transitions. [2022-04-08 10:04:49,316 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 73 transitions. [2022-04-08 10:04:49,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:49,389 INFO L225 Difference]: With dead ends: 242 [2022-04-08 10:04:49,389 INFO L226 Difference]: Without dead ends: 237 [2022-04-08 10:04:49,389 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=175, Invalid=581, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:04:49,390 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 55 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:04:49,390 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 72 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:04:49,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-04-08 10:04:50,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 228. [2022-04-08 10:04:50,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:04:50,209 INFO L82 GeneralOperation]: Start isEquivalent. First operand 237 states. Second operand has 228 states, 223 states have (on average 1.3766816143497758) internal successors, (307), 223 states have internal predecessors, (307), 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-08 10:04:50,209 INFO L74 IsIncluded]: Start isIncluded. First operand 237 states. Second operand has 228 states, 223 states have (on average 1.3766816143497758) internal successors, (307), 223 states have internal predecessors, (307), 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-08 10:04:50,209 INFO L87 Difference]: Start difference. First operand 237 states. Second operand has 228 states, 223 states have (on average 1.3766816143497758) internal successors, (307), 223 states have internal predecessors, (307), 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-08 10:04:50,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:50,211 INFO L93 Difference]: Finished difference Result 237 states and 325 transitions. [2022-04-08 10:04:50,211 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 325 transitions. [2022-04-08 10:04:50,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:50,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:50,212 INFO L74 IsIncluded]: Start isIncluded. First operand has 228 states, 223 states have (on average 1.3766816143497758) internal successors, (307), 223 states have internal predecessors, (307), 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 237 states. [2022-04-08 10:04:50,212 INFO L87 Difference]: Start difference. First operand has 228 states, 223 states have (on average 1.3766816143497758) internal successors, (307), 223 states have internal predecessors, (307), 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 237 states. [2022-04-08 10:04:50,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:50,214 INFO L93 Difference]: Finished difference Result 237 states and 325 transitions. [2022-04-08 10:04:50,214 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 325 transitions. [2022-04-08 10:04:50,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:50,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:50,214 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:04:50,214 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:04:50,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 223 states have (on average 1.3766816143497758) internal successors, (307), 223 states have internal predecessors, (307), 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-08 10:04:50,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 311 transitions. [2022-04-08 10:04:50,217 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 311 transitions. Word has length 30 [2022-04-08 10:04:50,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:04:50,217 INFO L478 AbstractCegarLoop]: Abstraction has 228 states and 311 transitions. [2022-04-08 10:04:50,217 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 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-08 10:04:50,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 228 states and 311 transitions. [2022-04-08 10:04:51,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 311 edges. 311 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:51,220 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 311 transitions. [2022-04-08 10:04:51,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 10:04:51,220 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:04:51,220 INFO L499 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:04:51,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-04-08 10:04:51,435 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-08 10:04:51,435 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:04:51,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:04:51,436 INFO L85 PathProgramCache]: Analyzing trace with hash 631750017, now seen corresponding path program 29 times [2022-04-08 10:04:51,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:51,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [638421215] [2022-04-08 10:04:51,438 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:04:51,438 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:04:51,438 INFO L85 PathProgramCache]: Analyzing trace with hash 631750017, now seen corresponding path program 30 times [2022-04-08 10:04:51,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:04:51,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484130179] [2022-04-08 10:04:51,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:04:51,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:04:51,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:51,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:04:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:51,657 INFO L290 TraceCheckUtils]: 0: Hoare triple {37208#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {37186#true} is VALID [2022-04-08 10:04:51,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {37186#true} assume true; {37186#true} is VALID [2022-04-08 10:04:51,657 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37186#true} {37186#true} #72#return; {37186#true} is VALID [2022-04-08 10:04:51,657 INFO L272 TraceCheckUtils]: 0: Hoare triple {37186#true} call ULTIMATE.init(); {37208#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:04:51,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {37208#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {37186#true} is VALID [2022-04-08 10:04:51,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {37186#true} assume true; {37186#true} is VALID [2022-04-08 10:04:51,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37186#true} {37186#true} #72#return; {37186#true} is VALID [2022-04-08 10:04:51,657 INFO L272 TraceCheckUtils]: 4: Hoare triple {37186#true} call #t~ret13 := main(); {37186#true} is VALID [2022-04-08 10:04:51,657 INFO L290 TraceCheckUtils]: 5: Hoare triple {37186#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {37191#(= main_~y~0 0)} is VALID [2022-04-08 10:04:51,658 INFO L290 TraceCheckUtils]: 6: Hoare triple {37191#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37192#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:51,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {37192#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37193#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:51,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {37193#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37194#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:51,659 INFO L290 TraceCheckUtils]: 9: Hoare triple {37194#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37195#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:51,659 INFO L290 TraceCheckUtils]: 10: Hoare triple {37195#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37196#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:51,660 INFO L290 TraceCheckUtils]: 11: Hoare triple {37196#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37197#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:51,660 INFO L290 TraceCheckUtils]: 12: Hoare triple {37197#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37198#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:51,660 INFO L290 TraceCheckUtils]: 13: Hoare triple {37198#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37199#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:51,661 INFO L290 TraceCheckUtils]: 14: Hoare triple {37199#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37200#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:04:51,661 INFO L290 TraceCheckUtils]: 15: Hoare triple {37200#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37201#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:04:51,661 INFO L290 TraceCheckUtils]: 16: Hoare triple {37201#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37202#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:04:51,662 INFO L290 TraceCheckUtils]: 17: Hoare triple {37202#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37203#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:04:51,662 INFO L290 TraceCheckUtils]: 18: Hoare triple {37203#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37204#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:04:51,663 INFO L290 TraceCheckUtils]: 19: Hoare triple {37204#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37205#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:04:51,663 INFO L290 TraceCheckUtils]: 20: Hoare triple {37205#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37206#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:04:51,663 INFO L290 TraceCheckUtils]: 21: Hoare triple {37206#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {37206#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:04:51,664 INFO L290 TraceCheckUtils]: 22: Hoare triple {37206#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {37207#(and (<= (div main_~z~0 4294967296) 0) (<= 15 main_~z~0))} is VALID [2022-04-08 10:04:51,664 INFO L290 TraceCheckUtils]: 23: Hoare triple {37207#(and (<= (div main_~z~0 4294967296) 0) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {37187#false} is VALID [2022-04-08 10:04:51,664 INFO L290 TraceCheckUtils]: 24: Hoare triple {37187#false} assume !(~y~0 % 4294967296 > 0); {37187#false} is VALID [2022-04-08 10:04:51,664 INFO L290 TraceCheckUtils]: 25: Hoare triple {37187#false} assume !(~x~0 % 4294967296 > 0); {37187#false} is VALID [2022-04-08 10:04:51,664 INFO L272 TraceCheckUtils]: 26: Hoare triple {37187#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {37187#false} is VALID [2022-04-08 10:04:51,664 INFO L290 TraceCheckUtils]: 27: Hoare triple {37187#false} ~cond := #in~cond; {37187#false} is VALID [2022-04-08 10:04:51,664 INFO L290 TraceCheckUtils]: 28: Hoare triple {37187#false} assume 0 == ~cond; {37187#false} is VALID [2022-04-08 10:04:51,664 INFO L290 TraceCheckUtils]: 29: Hoare triple {37187#false} assume !false; {37187#false} is VALID [2022-04-08 10:04:51,664 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:04:51,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:04:51,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484130179] [2022-04-08 10:04:51,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484130179] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:04:51,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421731113] [2022-04-08 10:04:51,665 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:04:51,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:51,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:04:51,665 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:04:51,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-04-08 10:04:51,847 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-08 10:04:51,847 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:04:51,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-08 10:04:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:51,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:04:52,067 INFO L272 TraceCheckUtils]: 0: Hoare triple {37186#true} call ULTIMATE.init(); {37186#true} is VALID [2022-04-08 10:04:52,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {37186#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {37186#true} is VALID [2022-04-08 10:04:52,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {37186#true} assume true; {37186#true} is VALID [2022-04-08 10:04:52,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37186#true} {37186#true} #72#return; {37186#true} is VALID [2022-04-08 10:04:52,067 INFO L272 TraceCheckUtils]: 4: Hoare triple {37186#true} call #t~ret13 := main(); {37186#true} is VALID [2022-04-08 10:04:52,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {37186#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {37191#(= main_~y~0 0)} is VALID [2022-04-08 10:04:52,068 INFO L290 TraceCheckUtils]: 6: Hoare triple {37191#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37192#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:52,068 INFO L290 TraceCheckUtils]: 7: Hoare triple {37192#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37193#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:04:52,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {37193#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37194#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:04:52,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {37194#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37195#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:04:52,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {37195#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37196#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:04:52,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {37196#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37197#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:04:52,071 INFO L290 TraceCheckUtils]: 12: Hoare triple {37197#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37198#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:04:52,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {37198#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37199#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:04:52,072 INFO L290 TraceCheckUtils]: 14: Hoare triple {37199#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37200#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:04:52,072 INFO L290 TraceCheckUtils]: 15: Hoare triple {37200#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37201#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:04:52,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {37201#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37202#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:04:52,073 INFO L290 TraceCheckUtils]: 17: Hoare triple {37202#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37203#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:04:52,074 INFO L290 TraceCheckUtils]: 18: Hoare triple {37203#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37204#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:04:52,074 INFO L290 TraceCheckUtils]: 19: Hoare triple {37204#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37205#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:04:52,075 INFO L290 TraceCheckUtils]: 20: Hoare triple {37205#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37206#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:04:52,075 INFO L290 TraceCheckUtils]: 21: Hoare triple {37206#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {37206#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:04:52,076 INFO L290 TraceCheckUtils]: 22: Hoare triple {37206#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {37278#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-08 10:04:52,076 INFO L290 TraceCheckUtils]: 23: Hoare triple {37278#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {37187#false} is VALID [2022-04-08 10:04:52,076 INFO L290 TraceCheckUtils]: 24: Hoare triple {37187#false} assume !(~y~0 % 4294967296 > 0); {37187#false} is VALID [2022-04-08 10:04:52,076 INFO L290 TraceCheckUtils]: 25: Hoare triple {37187#false} assume !(~x~0 % 4294967296 > 0); {37187#false} is VALID [2022-04-08 10:04:52,076 INFO L272 TraceCheckUtils]: 26: Hoare triple {37187#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {37187#false} is VALID [2022-04-08 10:04:52,076 INFO L290 TraceCheckUtils]: 27: Hoare triple {37187#false} ~cond := #in~cond; {37187#false} is VALID [2022-04-08 10:04:52,076 INFO L290 TraceCheckUtils]: 28: Hoare triple {37187#false} assume 0 == ~cond; {37187#false} is VALID [2022-04-08 10:04:52,076 INFO L290 TraceCheckUtils]: 29: Hoare triple {37187#false} assume !false; {37187#false} is VALID [2022-04-08 10:04:52,076 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:04:52,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:04:52,573 INFO L290 TraceCheckUtils]: 29: Hoare triple {37187#false} assume !false; {37187#false} is VALID [2022-04-08 10:04:52,573 INFO L290 TraceCheckUtils]: 28: Hoare triple {37187#false} assume 0 == ~cond; {37187#false} is VALID [2022-04-08 10:04:52,573 INFO L290 TraceCheckUtils]: 27: Hoare triple {37187#false} ~cond := #in~cond; {37187#false} is VALID [2022-04-08 10:04:52,573 INFO L272 TraceCheckUtils]: 26: Hoare triple {37187#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {37187#false} is VALID [2022-04-08 10:04:52,573 INFO L290 TraceCheckUtils]: 25: Hoare triple {37187#false} assume !(~x~0 % 4294967296 > 0); {37187#false} is VALID [2022-04-08 10:04:52,573 INFO L290 TraceCheckUtils]: 24: Hoare triple {37187#false} assume !(~y~0 % 4294967296 > 0); {37187#false} is VALID [2022-04-08 10:04:52,573 INFO L290 TraceCheckUtils]: 23: Hoare triple {37318#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {37187#false} is VALID [2022-04-08 10:04:52,574 INFO L290 TraceCheckUtils]: 22: Hoare triple {37322#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {37318#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:04:52,574 INFO L290 TraceCheckUtils]: 21: Hoare triple {37322#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {37322#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:04:52,574 INFO L290 TraceCheckUtils]: 20: Hoare triple {37329#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37322#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:04:52,575 INFO L290 TraceCheckUtils]: 19: Hoare triple {37333#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37329#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:04:52,576 INFO L290 TraceCheckUtils]: 18: Hoare triple {37337#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37333#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:04:52,576 INFO L290 TraceCheckUtils]: 17: Hoare triple {37341#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37337#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:04:52,577 INFO L290 TraceCheckUtils]: 16: Hoare triple {37345#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37341#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:04:52,578 INFO L290 TraceCheckUtils]: 15: Hoare triple {37349#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37345#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:52,578 INFO L290 TraceCheckUtils]: 14: Hoare triple {37353#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37349#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:04:52,579 INFO L290 TraceCheckUtils]: 13: Hoare triple {37357#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37353#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:04:52,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {37361#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37357#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:04:52,580 INFO L290 TraceCheckUtils]: 11: Hoare triple {37365#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37361#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:04:52,581 INFO L290 TraceCheckUtils]: 10: Hoare triple {37369#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37365#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:04:52,581 INFO L290 TraceCheckUtils]: 9: Hoare triple {37373#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37369#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:04:52,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {37377#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37373#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:04:52,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {37381#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37377#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:04:52,583 INFO L290 TraceCheckUtils]: 6: Hoare triple {37385#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {37381#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:04:52,583 INFO L290 TraceCheckUtils]: 5: Hoare triple {37186#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {37385#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:04:52,584 INFO L272 TraceCheckUtils]: 4: Hoare triple {37186#true} call #t~ret13 := main(); {37186#true} is VALID [2022-04-08 10:04:52,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37186#true} {37186#true} #72#return; {37186#true} is VALID [2022-04-08 10:04:52,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {37186#true} assume true; {37186#true} is VALID [2022-04-08 10:04:52,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {37186#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {37186#true} is VALID [2022-04-08 10:04:52,584 INFO L272 TraceCheckUtils]: 0: Hoare triple {37186#true} call ULTIMATE.init(); {37186#true} is VALID [2022-04-08 10:04:52,584 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:04:52,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421731113] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:04:52,584 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:04:52,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-08 10:04:52,584 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:04:52,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [638421215] [2022-04-08 10:04:52,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [638421215] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:04:52,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:04:52,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 10:04:52,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844210801] [2022-04-08 10:04:52,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:04:52,585 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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 30 [2022-04-08 10:04:52,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:04:52,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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-08 10:04:52,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:52,602 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 10:04:52,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:52,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 10:04:52,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1075, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 10:04:52,603 INFO L87 Difference]: Start difference. First operand 228 states and 311 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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-08 10:04:56,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:56,829 INFO L93 Difference]: Finished difference Result 405 states and 615 transitions. [2022-04-08 10:04:56,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 10:04:56,829 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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 30 [2022-04-08 10:04:56,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:04:56,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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-08 10:04:56,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 173 transitions. [2022-04-08 10:04:56,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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-08 10:04:56,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 173 transitions. [2022-04-08 10:04:56,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 173 transitions. [2022-04-08 10:04:56,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:56,923 INFO L225 Difference]: With dead ends: 405 [2022-04-08 10:04:56,924 INFO L226 Difference]: Without dead ends: 383 [2022-04-08 10:04:56,924 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=673, Invalid=2297, Unknown=0, NotChecked=0, Total=2970 [2022-04-08 10:04:56,925 INFO L913 BasicCegarLoop]: 76 mSDtfsCounter, 131 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 2195 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 2287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 2195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:04:56,925 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 163 Invalid, 2287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 2195 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-08 10:04:56,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-04-08 10:04:57,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 243. [2022-04-08 10:04:57,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:04:57,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 383 states. Second operand has 243 states, 238 states have (on average 1.3823529411764706) internal successors, (329), 238 states have internal predecessors, (329), 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-08 10:04:57,934 INFO L74 IsIncluded]: Start isIncluded. First operand 383 states. Second operand has 243 states, 238 states have (on average 1.3823529411764706) internal successors, (329), 238 states have internal predecessors, (329), 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-08 10:04:57,934 INFO L87 Difference]: Start difference. First operand 383 states. Second operand has 243 states, 238 states have (on average 1.3823529411764706) internal successors, (329), 238 states have internal predecessors, (329), 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-08 10:04:57,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:57,939 INFO L93 Difference]: Finished difference Result 383 states and 489 transitions. [2022-04-08 10:04:57,939 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 489 transitions. [2022-04-08 10:04:57,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:57,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:57,939 INFO L74 IsIncluded]: Start isIncluded. First operand has 243 states, 238 states have (on average 1.3823529411764706) internal successors, (329), 238 states have internal predecessors, (329), 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 383 states. [2022-04-08 10:04:57,939 INFO L87 Difference]: Start difference. First operand has 243 states, 238 states have (on average 1.3823529411764706) internal successors, (329), 238 states have internal predecessors, (329), 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 383 states. [2022-04-08 10:04:57,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:04:57,944 INFO L93 Difference]: Finished difference Result 383 states and 489 transitions. [2022-04-08 10:04:57,944 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 489 transitions. [2022-04-08 10:04:57,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:04:57,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:04:57,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:04:57,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:04:57,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 238 states have (on average 1.3823529411764706) internal successors, (329), 238 states have internal predecessors, (329), 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-08 10:04:57,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 333 transitions. [2022-04-08 10:04:57,947 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 333 transitions. Word has length 30 [2022-04-08 10:04:57,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:04:57,947 INFO L478 AbstractCegarLoop]: Abstraction has 243 states and 333 transitions. [2022-04-08 10:04:57,947 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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-08 10:04:57,948 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 243 states and 333 transitions. [2022-04-08 10:04:59,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 333 edges. 333 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:04:59,068 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 333 transitions. [2022-04-08 10:04:59,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 10:04:59,072 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:04:59,072 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:04:59,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-04-08 10:04:59,275 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-04-08 10:04:59,275 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:04:59,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:04:59,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1818120792, now seen corresponding path program 29 times [2022-04-08 10:04:59,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:04:59,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2035272604] [2022-04-08 10:04:59,289 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:04:59,289 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:04:59,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1818120792, now seen corresponding path program 30 times [2022-04-08 10:04:59,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:04:59,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967457200] [2022-04-08 10:04:59,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:04:59,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:04:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:59,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:04:59,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:59,666 INFO L290 TraceCheckUtils]: 0: Hoare triple {39521#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {39502#true} is VALID [2022-04-08 10:04:59,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {39502#true} assume true; {39502#true} is VALID [2022-04-08 10:04:59,666 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39502#true} {39502#true} #72#return; {39502#true} is VALID [2022-04-08 10:04:59,666 INFO L272 TraceCheckUtils]: 0: Hoare triple {39502#true} call ULTIMATE.init(); {39521#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:04:59,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {39521#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {39502#true} is VALID [2022-04-08 10:04:59,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {39502#true} assume true; {39502#true} is VALID [2022-04-08 10:04:59,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39502#true} {39502#true} #72#return; {39502#true} is VALID [2022-04-08 10:04:59,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {39502#true} call #t~ret13 := main(); {39502#true} is VALID [2022-04-08 10:04:59,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {39502#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {39507#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-08 10:04:59,669 INFO L290 TraceCheckUtils]: 6: Hoare triple {39507#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39508#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:59,671 INFO L290 TraceCheckUtils]: 7: Hoare triple {39508#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39509#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-08 10:04:59,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {39509#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39510#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:04:59,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {39510#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39511#(and (<= main_~y~0 4) (<= (+ main_~x~0 4) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0)))} is VALID [2022-04-08 10:04:59,678 INFO L290 TraceCheckUtils]: 10: Hoare triple {39511#(and (<= main_~y~0 4) (<= (+ main_~x~0 4) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0)))} assume !(~x~0 % 4294967296 > 0); {39512#(and (<= main_~y~0 4) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} is VALID [2022-04-08 10:04:59,679 INFO L290 TraceCheckUtils]: 11: Hoare triple {39512#(and (<= main_~y~0 4) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} ~z~0 := ~y~0; {39512#(and (<= main_~y~0 4) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} is VALID [2022-04-08 10:04:59,680 INFO L290 TraceCheckUtils]: 12: Hoare triple {39512#(and (<= main_~y~0 4) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39513#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 4))} is VALID [2022-04-08 10:04:59,680 INFO L290 TraceCheckUtils]: 13: Hoare triple {39513#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39513#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 4))} is VALID [2022-04-08 10:04:59,680 INFO L290 TraceCheckUtils]: 14: Hoare triple {39513#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39513#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 4))} is VALID [2022-04-08 10:04:59,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {39513#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39513#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 4))} is VALID [2022-04-08 10:04:59,681 INFO L290 TraceCheckUtils]: 16: Hoare triple {39513#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 4))} assume !(~z~0 % 4294967296 > 0); {39513#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 4))} is VALID [2022-04-08 10:04:59,682 INFO L290 TraceCheckUtils]: 17: Hoare triple {39513#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39514#(and (<= main_~n~0 (+ main_~y~0 1 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 3))} is VALID [2022-04-08 10:04:59,682 INFO L290 TraceCheckUtils]: 18: Hoare triple {39514#(and (<= main_~n~0 (+ main_~y~0 1 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 3))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39515#(and (<= main_~y~0 2) (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:04:59,683 INFO L290 TraceCheckUtils]: 19: Hoare triple {39515#(and (<= main_~y~0 2) (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39516#(and (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:59,684 INFO L290 TraceCheckUtils]: 20: Hoare triple {39516#(and (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39517#(and (<= main_~n~0 (+ main_~y~0 4 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 0))} is VALID [2022-04-08 10:04:59,684 INFO L290 TraceCheckUtils]: 21: Hoare triple {39517#(and (<= main_~n~0 (+ main_~y~0 4 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 0))} assume !(~y~0 % 4294967296 > 0); {39517#(and (<= main_~n~0 (+ main_~y~0 4 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 0))} is VALID [2022-04-08 10:04:59,685 INFO L290 TraceCheckUtils]: 22: Hoare triple {39517#(and (<= main_~n~0 (+ main_~y~0 4 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {39516#(and (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 1))} is VALID [2022-04-08 10:04:59,685 INFO L290 TraceCheckUtils]: 23: Hoare triple {39516#(and (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {39515#(and (<= main_~y~0 2) (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:04:59,686 INFO L290 TraceCheckUtils]: 24: Hoare triple {39515#(and (<= main_~y~0 2) (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {39514#(and (<= main_~n~0 (+ main_~y~0 1 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 3))} is VALID [2022-04-08 10:04:59,687 INFO L290 TraceCheckUtils]: 25: Hoare triple {39514#(and (<= main_~n~0 (+ main_~y~0 1 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 3))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {39518#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (div main_~y~0 4294967296) 0) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:04:59,688 INFO L290 TraceCheckUtils]: 26: Hoare triple {39518#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (div main_~y~0 4294967296) 0) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {39518#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (div main_~y~0 4294967296) 0) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:04:59,688 INFO L272 TraceCheckUtils]: 27: Hoare triple {39518#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (div main_~y~0 4294967296) 0) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {39519#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:04:59,689 INFO L290 TraceCheckUtils]: 28: Hoare triple {39519#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {39520#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:04:59,689 INFO L290 TraceCheckUtils]: 29: Hoare triple {39520#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {39503#false} is VALID [2022-04-08 10:04:59,689 INFO L290 TraceCheckUtils]: 30: Hoare triple {39503#false} assume !false; {39503#false} is VALID [2022-04-08 10:04:59,689 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 10:04:59,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:04:59,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967457200] [2022-04-08 10:04:59,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967457200] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:04:59,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928575424] [2022-04-08 10:04:59,690 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:04:59,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:04:59,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:04:59,690 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:04:59,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-04-08 10:04:59,803 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 10:04:59,803 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:04:59,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-08 10:04:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:04:59,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:05:00,684 INFO L272 TraceCheckUtils]: 0: Hoare triple {39502#true} call ULTIMATE.init(); {39502#true} is VALID [2022-04-08 10:05:00,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {39502#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {39502#true} is VALID [2022-04-08 10:05:00,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {39502#true} assume true; {39502#true} is VALID [2022-04-08 10:05:00,684 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39502#true} {39502#true} #72#return; {39502#true} is VALID [2022-04-08 10:05:00,684 INFO L272 TraceCheckUtils]: 4: Hoare triple {39502#true} call #t~ret13 := main(); {39502#true} is VALID [2022-04-08 10:05:00,684 INFO L290 TraceCheckUtils]: 5: Hoare triple {39502#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {39507#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-08 10:05:00,685 INFO L290 TraceCheckUtils]: 6: Hoare triple {39507#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39543#(and (= (+ main_~x~0 1) main_~n~0) (= main_~y~0 1))} is VALID [2022-04-08 10:05:00,685 INFO L290 TraceCheckUtils]: 7: Hoare triple {39543#(and (= (+ main_~x~0 1) main_~n~0) (= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39547#(and (= main_~y~0 2) (< 0 (mod (+ main_~x~0 1) 4294967296)) (= main_~n~0 (+ main_~x~0 2)))} is VALID [2022-04-08 10:05:00,686 INFO L290 TraceCheckUtils]: 8: Hoare triple {39547#(and (= main_~y~0 2) (< 0 (mod (+ main_~x~0 1) 4294967296)) (= main_~n~0 (+ main_~x~0 2)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39551#(and (= (+ main_~x~0 3) main_~n~0) (= main_~y~0 3) (< 0 (mod (+ main_~x~0 2) 4294967296)))} is VALID [2022-04-08 10:05:00,687 INFO L290 TraceCheckUtils]: 9: Hoare triple {39551#(and (= (+ main_~x~0 3) main_~n~0) (= main_~y~0 3) (< 0 (mod (+ main_~x~0 2) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39555#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= 3 (+ (- 1) main_~y~0)) (= (+ main_~n~0 (- 3)) (+ main_~x~0 1)))} is VALID [2022-04-08 10:05:00,687 INFO L290 TraceCheckUtils]: 10: Hoare triple {39555#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= 3 (+ (- 1) main_~y~0)) (= (+ main_~n~0 (- 3)) (+ main_~x~0 1)))} assume !(~x~0 % 4294967296 > 0); {39559#(and (= main_~y~0 4) (<= (mod main_~x~0 4294967296) 0) (= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-08 10:05:00,688 INFO L290 TraceCheckUtils]: 11: Hoare triple {39559#(and (= main_~y~0 4) (<= (mod main_~x~0 4294967296) 0) (= (+ main_~x~0 4) main_~n~0))} ~z~0 := ~y~0; {39559#(and (= main_~y~0 4) (<= (mod main_~x~0 4294967296) 0) (= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-08 10:05:00,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {39559#(and (= main_~y~0 4) (<= (mod main_~x~0 4294967296) 0) (= (+ main_~x~0 4) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39566#(and (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= main_~y~0 4) (= (+ main_~n~0 (- 3)) main_~x~0))} is VALID [2022-04-08 10:05:00,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {39566#(and (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= main_~y~0 4) (= (+ main_~n~0 (- 3)) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39570#(and (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= (+ (- 2) main_~n~0) main_~x~0) (= main_~y~0 4))} is VALID [2022-04-08 10:05:00,689 INFO L290 TraceCheckUtils]: 14: Hoare triple {39570#(and (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= (+ (- 2) main_~n~0) main_~x~0) (= main_~y~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39574#(and (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= main_~x~0 (+ (- 1) main_~n~0)) (= main_~y~0 4))} is VALID [2022-04-08 10:05:00,690 INFO L290 TraceCheckUtils]: 15: Hoare triple {39574#(and (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= main_~x~0 (+ (- 1) main_~n~0)) (= main_~y~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39578#(and (= main_~n~0 main_~x~0) (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= main_~y~0 4))} is VALID [2022-04-08 10:05:00,690 INFO L290 TraceCheckUtils]: 16: Hoare triple {39578#(and (= main_~n~0 main_~x~0) (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= main_~y~0 4))} assume !(~z~0 % 4294967296 > 0); {39578#(and (= main_~n~0 main_~x~0) (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= main_~y~0 4))} is VALID [2022-04-08 10:05:00,690 INFO L290 TraceCheckUtils]: 17: Hoare triple {39578#(and (= main_~n~0 main_~x~0) (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= main_~y~0 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39585#(and (= main_~n~0 main_~x~0) (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= 4 (+ main_~y~0 1)))} is VALID [2022-04-08 10:05:00,691 INFO L290 TraceCheckUtils]: 18: Hoare triple {39585#(and (= main_~n~0 main_~x~0) (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= 4 (+ main_~y~0 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39589#(and (= main_~n~0 main_~x~0) (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= 3 (+ main_~y~0 1)))} is VALID [2022-04-08 10:05:00,691 INFO L290 TraceCheckUtils]: 19: Hoare triple {39589#(and (= main_~n~0 main_~x~0) (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= 3 (+ main_~y~0 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39593#(and (= main_~n~0 main_~x~0) (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= (+ main_~y~0 2) 3))} is VALID [2022-04-08 10:05:00,691 INFO L290 TraceCheckUtils]: 20: Hoare triple {39593#(and (= main_~n~0 main_~x~0) (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= (+ main_~y~0 2) 3))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39597#(and (= main_~n~0 main_~x~0) (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= (+ main_~y~0 1) 1))} is VALID [2022-04-08 10:05:00,692 INFO L290 TraceCheckUtils]: 21: Hoare triple {39597#(and (= main_~n~0 main_~x~0) (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= (+ main_~y~0 1) 1))} assume !(~y~0 % 4294967296 > 0); {39597#(and (= main_~n~0 main_~x~0) (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= (+ main_~y~0 1) 1))} is VALID [2022-04-08 10:05:00,693 INFO L290 TraceCheckUtils]: 22: Hoare triple {39597#(and (= main_~n~0 main_~x~0) (<= (mod (+ 4294967292 main_~n~0) 4294967296) 0) (= (+ main_~y~0 1) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {39516#(and (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:00,693 INFO L290 TraceCheckUtils]: 23: Hoare triple {39516#(and (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {39515#(and (<= main_~y~0 2) (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:05:00,694 INFO L290 TraceCheckUtils]: 24: Hoare triple {39515#(and (<= main_~y~0 2) (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {39514#(and (<= main_~n~0 (+ main_~y~0 1 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 3))} is VALID [2022-04-08 10:05:00,694 INFO L290 TraceCheckUtils]: 25: Hoare triple {39514#(and (<= main_~n~0 (+ main_~y~0 1 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 3))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {39513#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 4))} is VALID [2022-04-08 10:05:00,695 INFO L290 TraceCheckUtils]: 26: Hoare triple {39513#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 4))} assume !(~x~0 % 4294967296 > 0); {39513#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 4))} is VALID [2022-04-08 10:05:00,696 INFO L272 TraceCheckUtils]: 27: Hoare triple {39513#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 4)) 4294967296) 4294967296))) (<= main_~y~0 4))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {39619#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:05:00,696 INFO L290 TraceCheckUtils]: 28: Hoare triple {39619#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {39623#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:05:00,696 INFO L290 TraceCheckUtils]: 29: Hoare triple {39623#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {39503#false} is VALID [2022-04-08 10:05:00,696 INFO L290 TraceCheckUtils]: 30: Hoare triple {39503#false} assume !false; {39503#false} is VALID [2022-04-08 10:05:00,696 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:05:00,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:05:01,537 INFO L290 TraceCheckUtils]: 30: Hoare triple {39503#false} assume !false; {39503#false} is VALID [2022-04-08 10:05:01,537 INFO L290 TraceCheckUtils]: 29: Hoare triple {39623#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {39503#false} is VALID [2022-04-08 10:05:01,537 INFO L290 TraceCheckUtils]: 28: Hoare triple {39619#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {39623#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:05:01,538 INFO L272 TraceCheckUtils]: 27: Hoare triple {39639#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {39619#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:05:01,538 INFO L290 TraceCheckUtils]: 26: Hoare triple {39639#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {39639#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:05:01,538 INFO L290 TraceCheckUtils]: 25: Hoare triple {39646#(= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {39639#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:05:01,539 INFO L290 TraceCheckUtils]: 24: Hoare triple {39650#(= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {39646#(= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:05:01,540 INFO L290 TraceCheckUtils]: 23: Hoare triple {39654#(= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {39650#(= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:05:01,540 INFO L290 TraceCheckUtils]: 22: Hoare triple {39658#(= (mod main_~n~0 4294967296) (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {39654#(= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:05:01,540 INFO L290 TraceCheckUtils]: 21: Hoare triple {39658#(= (mod main_~n~0 4294967296) (mod (+ main_~y~0 4) 4294967296))} assume !(~y~0 % 4294967296 > 0); {39658#(= (mod main_~n~0 4294967296) (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:05:01,541 INFO L290 TraceCheckUtils]: 20: Hoare triple {39654#(= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39658#(= (mod main_~n~0 4294967296) (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:05:01,542 INFO L290 TraceCheckUtils]: 19: Hoare triple {39650#(= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39654#(= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:05:01,542 INFO L290 TraceCheckUtils]: 18: Hoare triple {39646#(= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39650#(= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:05:01,543 INFO L290 TraceCheckUtils]: 17: Hoare triple {39639#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39646#(= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:05:01,543 INFO L290 TraceCheckUtils]: 16: Hoare triple {39639#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {39639#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:05:01,543 INFO L290 TraceCheckUtils]: 15: Hoare triple {39639#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39639#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:05:01,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {39639#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39639#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:05:01,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {39639#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39639#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:05:01,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {39639#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39639#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:05:01,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {39639#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {39639#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:05:01,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {39695#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {39639#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:05:01,546 INFO L290 TraceCheckUtils]: 9: Hoare triple {39699#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39695#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:05:01,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {39703#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39699#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-08 10:05:01,547 INFO L290 TraceCheckUtils]: 7: Hoare triple {39707#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39703#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296)))} is VALID [2022-04-08 10:05:01,548 INFO L290 TraceCheckUtils]: 6: Hoare triple {39711#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 4) 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {39707#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:05:01,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {39502#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {39711#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 4) 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:05:01,549 INFO L272 TraceCheckUtils]: 4: Hoare triple {39502#true} call #t~ret13 := main(); {39502#true} is VALID [2022-04-08 10:05:01,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39502#true} {39502#true} #72#return; {39502#true} is VALID [2022-04-08 10:05:01,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {39502#true} assume true; {39502#true} is VALID [2022-04-08 10:05:01,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {39502#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {39502#true} is VALID [2022-04-08 10:05:01,549 INFO L272 TraceCheckUtils]: 0: Hoare triple {39502#true} call ULTIMATE.init(); {39502#true} is VALID [2022-04-08 10:05:01,549 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 10:05:01,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928575424] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:05:01,549 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:05:01,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22, 14] total 42 [2022-04-08 10:05:01,549 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:05:01,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2035272604] [2022-04-08 10:05:01,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2035272604] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:05:01,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:05:01,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 10:05:01,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031979663] [2022-04-08 10:05:01,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:05:01,550 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 15 states have internal predecessors, (25), 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 31 [2022-04-08 10:05:01,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:05:01,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 15 states have internal predecessors, (25), 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-08 10:05:01,602 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-08 10:05:01,602 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 10:05:01,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:01,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 10:05:01,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1499, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 10:05:01,603 INFO L87 Difference]: Start difference. First operand 243 states and 333 transitions. Second operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 15 states have internal predecessors, (25), 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-08 10:05:03,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:03,338 INFO L93 Difference]: Finished difference Result 258 states and 348 transitions. [2022-04-08 10:05:03,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 10:05:03,339 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 15 states have internal predecessors, (25), 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 31 [2022-04-08 10:05:03,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:05:03,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 15 states have internal predecessors, (25), 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-08 10:05:03,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 45 transitions. [2022-04-08 10:05:03,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 15 states have internal predecessors, (25), 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-08 10:05:03,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 45 transitions. [2022-04-08 10:05:03,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 45 transitions. [2022-04-08 10:05:03,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:03,382 INFO L225 Difference]: With dead ends: 258 [2022-04-08 10:05:03,382 INFO L226 Difference]: Without dead ends: 253 [2022-04-08 10:05:03,383 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=339, Invalid=2741, Unknown=0, NotChecked=0, Total=3080 [2022-04-08 10:05:03,383 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 26 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:05:03,383 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 78 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:05:03,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-04-08 10:05:03,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 243. [2022-04-08 10:05:03,944 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:05:03,944 INFO L82 GeneralOperation]: Start isEquivalent. First operand 253 states. Second operand has 243 states, 238 states have (on average 1.3823529411764706) internal successors, (329), 238 states have internal predecessors, (329), 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-08 10:05:03,944 INFO L74 IsIncluded]: Start isIncluded. First operand 253 states. Second operand has 243 states, 238 states have (on average 1.3823529411764706) internal successors, (329), 238 states have internal predecessors, (329), 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-08 10:05:03,944 INFO L87 Difference]: Start difference. First operand 253 states. Second operand has 243 states, 238 states have (on average 1.3823529411764706) internal successors, (329), 238 states have internal predecessors, (329), 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-08 10:05:03,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:03,947 INFO L93 Difference]: Finished difference Result 253 states and 343 transitions. [2022-04-08 10:05:03,947 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 343 transitions. [2022-04-08 10:05:03,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:03,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:03,947 INFO L74 IsIncluded]: Start isIncluded. First operand has 243 states, 238 states have (on average 1.3823529411764706) internal successors, (329), 238 states have internal predecessors, (329), 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 253 states. [2022-04-08 10:05:03,948 INFO L87 Difference]: Start difference. First operand has 243 states, 238 states have (on average 1.3823529411764706) internal successors, (329), 238 states have internal predecessors, (329), 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 253 states. [2022-04-08 10:05:03,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:03,950 INFO L93 Difference]: Finished difference Result 253 states and 343 transitions. [2022-04-08 10:05:03,950 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 343 transitions. [2022-04-08 10:05:03,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:03,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:03,950 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:05:03,950 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:05:03,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 238 states have (on average 1.3823529411764706) internal successors, (329), 238 states have internal predecessors, (329), 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-08 10:05:03,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 333 transitions. [2022-04-08 10:05:03,953 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 333 transitions. Word has length 31 [2022-04-08 10:05:03,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:05:03,955 INFO L478 AbstractCegarLoop]: Abstraction has 243 states and 333 transitions. [2022-04-08 10:05:03,955 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 15 states have internal predecessors, (25), 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-08 10:05:03,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 243 states and 333 transitions. [2022-04-08 10:05:05,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 333 edges. 333 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:05,073 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 333 transitions. [2022-04-08 10:05:05,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 10:05:05,074 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:05:05,074 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:05:05,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-04-08 10:05:05,290 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-04-08 10:05:05,290 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:05:05,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:05:05,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1038157448, now seen corresponding path program 31 times [2022-04-08 10:05:05,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:05,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1596914544] [2022-04-08 10:05:05,296 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:05:05,296 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:05:05,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1038157448, now seen corresponding path program 32 times [2022-04-08 10:05:05,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:05:05,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625558904] [2022-04-08 10:05:05,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:05:05,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:05:05,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:05,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:05:05,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:05,468 INFO L290 TraceCheckUtils]: 0: Hoare triple {41283#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {41268#true} is VALID [2022-04-08 10:05:05,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {41268#true} assume true; {41268#true} is VALID [2022-04-08 10:05:05,468 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41268#true} {41268#true} #72#return; {41268#true} is VALID [2022-04-08 10:05:05,468 INFO L272 TraceCheckUtils]: 0: Hoare triple {41268#true} call ULTIMATE.init(); {41283#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:05:05,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {41283#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {41268#true} is VALID [2022-04-08 10:05:05,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {41268#true} assume true; {41268#true} is VALID [2022-04-08 10:05:05,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41268#true} {41268#true} #72#return; {41268#true} is VALID [2022-04-08 10:05:05,469 INFO L272 TraceCheckUtils]: 4: Hoare triple {41268#true} call #t~ret13 := main(); {41268#true} is VALID [2022-04-08 10:05:05,469 INFO L290 TraceCheckUtils]: 5: Hoare triple {41268#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {41273#(= main_~y~0 0)} is VALID [2022-04-08 10:05:05,469 INFO L290 TraceCheckUtils]: 6: Hoare triple {41273#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41274#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:05,470 INFO L290 TraceCheckUtils]: 7: Hoare triple {41274#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41275#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:05,470 INFO L290 TraceCheckUtils]: 8: Hoare triple {41275#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41276#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:05,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {41276#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41277#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:05,471 INFO L290 TraceCheckUtils]: 10: Hoare triple {41277#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41278#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:05,471 INFO L290 TraceCheckUtils]: 11: Hoare triple {41278#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {41278#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:05,472 INFO L290 TraceCheckUtils]: 12: Hoare triple {41278#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {41279#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:05:05,472 INFO L290 TraceCheckUtils]: 13: Hoare triple {41279#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41280#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:05:05,473 INFO L290 TraceCheckUtils]: 14: Hoare triple {41280#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41281#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:05:05,473 INFO L290 TraceCheckUtils]: 15: Hoare triple {41281#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41282#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-08 10:05:05,473 INFO L290 TraceCheckUtils]: 16: Hoare triple {41282#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {41269#false} is VALID [2022-04-08 10:05:05,473 INFO L290 TraceCheckUtils]: 17: Hoare triple {41269#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41269#false} is VALID [2022-04-08 10:05:05,473 INFO L290 TraceCheckUtils]: 18: Hoare triple {41269#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41269#false} is VALID [2022-04-08 10:05:05,474 INFO L290 TraceCheckUtils]: 19: Hoare triple {41269#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41269#false} is VALID [2022-04-08 10:05:05,474 INFO L290 TraceCheckUtils]: 20: Hoare triple {41269#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41269#false} is VALID [2022-04-08 10:05:05,474 INFO L290 TraceCheckUtils]: 21: Hoare triple {41269#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41269#false} is VALID [2022-04-08 10:05:05,474 INFO L290 TraceCheckUtils]: 22: Hoare triple {41269#false} assume !(~y~0 % 4294967296 > 0); {41269#false} is VALID [2022-04-08 10:05:05,474 INFO L290 TraceCheckUtils]: 23: Hoare triple {41269#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {41269#false} is VALID [2022-04-08 10:05:05,474 INFO L290 TraceCheckUtils]: 24: Hoare triple {41269#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {41269#false} is VALID [2022-04-08 10:05:05,474 INFO L290 TraceCheckUtils]: 25: Hoare triple {41269#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {41269#false} is VALID [2022-04-08 10:05:05,474 INFO L290 TraceCheckUtils]: 26: Hoare triple {41269#false} assume !(~x~0 % 4294967296 > 0); {41269#false} is VALID [2022-04-08 10:05:05,474 INFO L272 TraceCheckUtils]: 27: Hoare triple {41269#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {41269#false} is VALID [2022-04-08 10:05:05,474 INFO L290 TraceCheckUtils]: 28: Hoare triple {41269#false} ~cond := #in~cond; {41269#false} is VALID [2022-04-08 10:05:05,474 INFO L290 TraceCheckUtils]: 29: Hoare triple {41269#false} assume 0 == ~cond; {41269#false} is VALID [2022-04-08 10:05:05,474 INFO L290 TraceCheckUtils]: 30: Hoare triple {41269#false} assume !false; {41269#false} is VALID [2022-04-08 10:05:05,474 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-08 10:05:05,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:05:05,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625558904] [2022-04-08 10:05:05,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625558904] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:05:05,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762435788] [2022-04-08 10:05:05,474 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:05:05,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:05,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:05:05,478 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:05:05,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-04-08 10:05:05,520 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:05:05,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:05:05,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 10:05:05,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:05,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:05:05,686 INFO L272 TraceCheckUtils]: 0: Hoare triple {41268#true} call ULTIMATE.init(); {41268#true} is VALID [2022-04-08 10:05:05,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {41268#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {41268#true} is VALID [2022-04-08 10:05:05,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {41268#true} assume true; {41268#true} is VALID [2022-04-08 10:05:05,686 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41268#true} {41268#true} #72#return; {41268#true} is VALID [2022-04-08 10:05:05,686 INFO L272 TraceCheckUtils]: 4: Hoare triple {41268#true} call #t~ret13 := main(); {41268#true} is VALID [2022-04-08 10:05:05,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {41268#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {41273#(= main_~y~0 0)} is VALID [2022-04-08 10:05:05,687 INFO L290 TraceCheckUtils]: 6: Hoare triple {41273#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41274#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:05,687 INFO L290 TraceCheckUtils]: 7: Hoare triple {41274#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41275#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:05,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {41275#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41276#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:05,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {41276#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41277#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:05,689 INFO L290 TraceCheckUtils]: 10: Hoare triple {41277#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41278#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:05,689 INFO L290 TraceCheckUtils]: 11: Hoare triple {41278#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {41278#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:05,689 INFO L290 TraceCheckUtils]: 12: Hoare triple {41278#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {41323#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:05,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {41323#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41327#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:05:05,690 INFO L290 TraceCheckUtils]: 14: Hoare triple {41327#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41331#(and (= main_~y~0 (+ main_~z~0 2)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:05,691 INFO L290 TraceCheckUtils]: 15: Hoare triple {41331#(and (= main_~y~0 (+ main_~z~0 2)) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41335#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:05,691 INFO L290 TraceCheckUtils]: 16: Hoare triple {41335#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~z~0 % 4294967296 > 0); {41269#false} is VALID [2022-04-08 10:05:05,691 INFO L290 TraceCheckUtils]: 17: Hoare triple {41269#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41269#false} is VALID [2022-04-08 10:05:05,691 INFO L290 TraceCheckUtils]: 18: Hoare triple {41269#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41269#false} is VALID [2022-04-08 10:05:05,691 INFO L290 TraceCheckUtils]: 19: Hoare triple {41269#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41269#false} is VALID [2022-04-08 10:05:05,691 INFO L290 TraceCheckUtils]: 20: Hoare triple {41269#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41269#false} is VALID [2022-04-08 10:05:05,691 INFO L290 TraceCheckUtils]: 21: Hoare triple {41269#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41269#false} is VALID [2022-04-08 10:05:05,691 INFO L290 TraceCheckUtils]: 22: Hoare triple {41269#false} assume !(~y~0 % 4294967296 > 0); {41269#false} is VALID [2022-04-08 10:05:05,691 INFO L290 TraceCheckUtils]: 23: Hoare triple {41269#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {41269#false} is VALID [2022-04-08 10:05:05,691 INFO L290 TraceCheckUtils]: 24: Hoare triple {41269#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {41269#false} is VALID [2022-04-08 10:05:05,691 INFO L290 TraceCheckUtils]: 25: Hoare triple {41269#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {41269#false} is VALID [2022-04-08 10:05:05,691 INFO L290 TraceCheckUtils]: 26: Hoare triple {41269#false} assume !(~x~0 % 4294967296 > 0); {41269#false} is VALID [2022-04-08 10:05:05,692 INFO L272 TraceCheckUtils]: 27: Hoare triple {41269#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {41269#false} is VALID [2022-04-08 10:05:05,692 INFO L290 TraceCheckUtils]: 28: Hoare triple {41269#false} ~cond := #in~cond; {41269#false} is VALID [2022-04-08 10:05:05,692 INFO L290 TraceCheckUtils]: 29: Hoare triple {41269#false} assume 0 == ~cond; {41269#false} is VALID [2022-04-08 10:05:05,692 INFO L290 TraceCheckUtils]: 30: Hoare triple {41269#false} assume !false; {41269#false} is VALID [2022-04-08 10:05:05,692 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-08 10:05:05,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:05:05,883 INFO L290 TraceCheckUtils]: 30: Hoare triple {41269#false} assume !false; {41269#false} is VALID [2022-04-08 10:05:05,883 INFO L290 TraceCheckUtils]: 29: Hoare triple {41269#false} assume 0 == ~cond; {41269#false} is VALID [2022-04-08 10:05:05,883 INFO L290 TraceCheckUtils]: 28: Hoare triple {41269#false} ~cond := #in~cond; {41269#false} is VALID [2022-04-08 10:05:05,883 INFO L272 TraceCheckUtils]: 27: Hoare triple {41269#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {41269#false} is VALID [2022-04-08 10:05:05,883 INFO L290 TraceCheckUtils]: 26: Hoare triple {41269#false} assume !(~x~0 % 4294967296 > 0); {41269#false} is VALID [2022-04-08 10:05:05,883 INFO L290 TraceCheckUtils]: 25: Hoare triple {41269#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {41269#false} is VALID [2022-04-08 10:05:05,884 INFO L290 TraceCheckUtils]: 24: Hoare triple {41269#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {41269#false} is VALID [2022-04-08 10:05:05,884 INFO L290 TraceCheckUtils]: 23: Hoare triple {41269#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {41269#false} is VALID [2022-04-08 10:05:05,884 INFO L290 TraceCheckUtils]: 22: Hoare triple {41269#false} assume !(~y~0 % 4294967296 > 0); {41269#false} is VALID [2022-04-08 10:05:05,884 INFO L290 TraceCheckUtils]: 21: Hoare triple {41269#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41269#false} is VALID [2022-04-08 10:05:05,884 INFO L290 TraceCheckUtils]: 20: Hoare triple {41411#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41269#false} is VALID [2022-04-08 10:05:05,885 INFO L290 TraceCheckUtils]: 19: Hoare triple {41415#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41411#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:05:05,885 INFO L290 TraceCheckUtils]: 18: Hoare triple {41419#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41415#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:05:05,886 INFO L290 TraceCheckUtils]: 17: Hoare triple {41423#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41419#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:05:05,886 INFO L290 TraceCheckUtils]: 16: Hoare triple {41427#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {41423#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:05:05,887 INFO L290 TraceCheckUtils]: 15: Hoare triple {41431#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41427#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-08 10:05:05,888 INFO L290 TraceCheckUtils]: 14: Hoare triple {41435#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41431#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:05:05,888 INFO L290 TraceCheckUtils]: 13: Hoare triple {41439#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41435#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-08 10:05:05,889 INFO L290 TraceCheckUtils]: 12: Hoare triple {41268#true} ~z~0 := ~y~0; {41439#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:05:05,889 INFO L290 TraceCheckUtils]: 11: Hoare triple {41268#true} assume !(~x~0 % 4294967296 > 0); {41268#true} is VALID [2022-04-08 10:05:05,889 INFO L290 TraceCheckUtils]: 10: Hoare triple {41268#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41268#true} is VALID [2022-04-08 10:05:05,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {41268#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41268#true} is VALID [2022-04-08 10:05:05,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {41268#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41268#true} is VALID [2022-04-08 10:05:05,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {41268#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41268#true} is VALID [2022-04-08 10:05:05,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {41268#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {41268#true} is VALID [2022-04-08 10:05:05,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {41268#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {41268#true} is VALID [2022-04-08 10:05:05,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {41268#true} call #t~ret13 := main(); {41268#true} is VALID [2022-04-08 10:05:05,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41268#true} {41268#true} #72#return; {41268#true} is VALID [2022-04-08 10:05:05,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {41268#true} assume true; {41268#true} is VALID [2022-04-08 10:05:05,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {41268#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {41268#true} is VALID [2022-04-08 10:05:05,889 INFO L272 TraceCheckUtils]: 0: Hoare triple {41268#true} call ULTIMATE.init(); {41268#true} is VALID [2022-04-08 10:05:05,889 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-08 10:05:05,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762435788] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:05:05,890 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:05:05,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 10] total 25 [2022-04-08 10:05:05,890 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:05:05,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1596914544] [2022-04-08 10:05:05,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1596914544] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:05:05,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:05:05,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 10:05:05,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74889981] [2022-04-08 10:05:05,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:05:05,891 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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 31 [2022-04-08 10:05:05,891 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:05:05,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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-08 10:05:05,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:05,904 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 10:05:05,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:05,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 10:05:05,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2022-04-08 10:05:05,905 INFO L87 Difference]: Start difference. First operand 243 states and 333 transitions. Second operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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-08 10:05:08,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:08,007 INFO L93 Difference]: Finished difference Result 297 states and 392 transitions. [2022-04-08 10:05:08,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 10:05:08,007 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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 31 [2022-04-08 10:05:08,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:05:08,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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-08 10:05:08,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 73 transitions. [2022-04-08 10:05:08,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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-08 10:05:08,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 73 transitions. [2022-04-08 10:05:08,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 73 transitions. [2022-04-08 10:05:08,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:08,052 INFO L225 Difference]: With dead ends: 297 [2022-04-08 10:05:08,052 INFO L226 Difference]: Without dead ends: 282 [2022-04-08 10:05:08,052 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=209, Invalid=1197, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 10:05:08,052 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 34 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:05:08,053 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 72 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:05:08,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-04-08 10:05:08,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 243. [2022-04-08 10:05:08,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:05:08,607 INFO L82 GeneralOperation]: Start isEquivalent. First operand 282 states. Second operand has 243 states, 238 states have (on average 1.3781512605042017) internal successors, (328), 238 states have internal predecessors, (328), 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-08 10:05:08,607 INFO L74 IsIncluded]: Start isIncluded. First operand 282 states. Second operand has 243 states, 238 states have (on average 1.3781512605042017) internal successors, (328), 238 states have internal predecessors, (328), 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-08 10:05:08,608 INFO L87 Difference]: Start difference. First operand 282 states. Second operand has 243 states, 238 states have (on average 1.3781512605042017) internal successors, (328), 238 states have internal predecessors, (328), 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-08 10:05:08,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:08,611 INFO L93 Difference]: Finished difference Result 282 states and 377 transitions. [2022-04-08 10:05:08,611 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 377 transitions. [2022-04-08 10:05:08,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:08,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:08,611 INFO L74 IsIncluded]: Start isIncluded. First operand has 243 states, 238 states have (on average 1.3781512605042017) internal successors, (328), 238 states have internal predecessors, (328), 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 282 states. [2022-04-08 10:05:08,611 INFO L87 Difference]: Start difference. First operand has 243 states, 238 states have (on average 1.3781512605042017) internal successors, (328), 238 states have internal predecessors, (328), 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 282 states. [2022-04-08 10:05:08,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:08,614 INFO L93 Difference]: Finished difference Result 282 states and 377 transitions. [2022-04-08 10:05:08,614 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 377 transitions. [2022-04-08 10:05:08,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:08,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:08,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:05:08,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:05:08,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 238 states have (on average 1.3781512605042017) internal successors, (328), 238 states have internal predecessors, (328), 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-08 10:05:08,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 332 transitions. [2022-04-08 10:05:08,617 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 332 transitions. Word has length 31 [2022-04-08 10:05:08,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:05:08,618 INFO L478 AbstractCegarLoop]: Abstraction has 243 states and 332 transitions. [2022-04-08 10:05:08,618 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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-08 10:05:08,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 243 states and 332 transitions. [2022-04-08 10:05:11,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 332 edges. 332 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:11,383 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 332 transitions. [2022-04-08 10:05:11,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 10:05:11,383 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:05:11,383 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:05:11,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-04-08 10:05:11,598 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-04-08 10:05:11,599 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:05:11,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:05:11,599 INFO L85 PathProgramCache]: Analyzing trace with hash -281941914, now seen corresponding path program 19 times [2022-04-08 10:05:11,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:11,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [615045478] [2022-04-08 10:05:11,601 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:05:11,601 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:05:11,601 INFO L85 PathProgramCache]: Analyzing trace with hash -281941914, now seen corresponding path program 20 times [2022-04-08 10:05:11,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:05:11,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952874178] [2022-04-08 10:05:11,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:05:11,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:05:11,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:11,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:05:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:11,817 INFO L290 TraceCheckUtils]: 0: Hoare triple {43168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {43151#true} is VALID [2022-04-08 10:05:11,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {43151#true} assume true; {43151#true} is VALID [2022-04-08 10:05:11,817 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43151#true} {43151#true} #72#return; {43151#true} is VALID [2022-04-08 10:05:11,818 INFO L272 TraceCheckUtils]: 0: Hoare triple {43151#true} call ULTIMATE.init(); {43168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:05:11,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {43168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {43151#true} is VALID [2022-04-08 10:05:11,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {43151#true} assume true; {43151#true} is VALID [2022-04-08 10:05:11,818 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43151#true} {43151#true} #72#return; {43151#true} is VALID [2022-04-08 10:05:11,818 INFO L272 TraceCheckUtils]: 4: Hoare triple {43151#true} call #t~ret13 := main(); {43151#true} is VALID [2022-04-08 10:05:11,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {43151#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {43156#(= main_~y~0 0)} is VALID [2022-04-08 10:05:11,819 INFO L290 TraceCheckUtils]: 6: Hoare triple {43156#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43157#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:11,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {43157#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43158#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:11,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {43158#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43159#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:11,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {43159#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43160#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:11,821 INFO L290 TraceCheckUtils]: 10: Hoare triple {43160#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43161#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:11,821 INFO L290 TraceCheckUtils]: 11: Hoare triple {43161#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {43161#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:11,821 INFO L290 TraceCheckUtils]: 12: Hoare triple {43161#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {43162#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:05:11,822 INFO L290 TraceCheckUtils]: 13: Hoare triple {43162#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43163#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:05:11,822 INFO L290 TraceCheckUtils]: 14: Hoare triple {43163#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43164#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:05:11,823 INFO L290 TraceCheckUtils]: 15: Hoare triple {43164#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43165#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:05:11,823 INFO L290 TraceCheckUtils]: 16: Hoare triple {43165#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43166#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:05:11,824 INFO L290 TraceCheckUtils]: 17: Hoare triple {43166#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43167#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:05:11,824 INFO L290 TraceCheckUtils]: 18: Hoare triple {43167#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43152#false} is VALID [2022-04-08 10:05:11,824 INFO L290 TraceCheckUtils]: 19: Hoare triple {43152#false} assume !(~z~0 % 4294967296 > 0); {43152#false} is VALID [2022-04-08 10:05:11,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {43152#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43152#false} is VALID [2022-04-08 10:05:11,824 INFO L290 TraceCheckUtils]: 21: Hoare triple {43152#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43152#false} is VALID [2022-04-08 10:05:11,825 INFO L290 TraceCheckUtils]: 22: Hoare triple {43152#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43152#false} is VALID [2022-04-08 10:05:11,825 INFO L290 TraceCheckUtils]: 23: Hoare triple {43152#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43152#false} is VALID [2022-04-08 10:05:11,825 INFO L290 TraceCheckUtils]: 24: Hoare triple {43152#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43152#false} is VALID [2022-04-08 10:05:11,825 INFO L290 TraceCheckUtils]: 25: Hoare triple {43152#false} assume !(~y~0 % 4294967296 > 0); {43152#false} is VALID [2022-04-08 10:05:11,825 INFO L290 TraceCheckUtils]: 26: Hoare triple {43152#false} assume !(~x~0 % 4294967296 > 0); {43152#false} is VALID [2022-04-08 10:05:11,825 INFO L272 TraceCheckUtils]: 27: Hoare triple {43152#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {43152#false} is VALID [2022-04-08 10:05:11,825 INFO L290 TraceCheckUtils]: 28: Hoare triple {43152#false} ~cond := #in~cond; {43152#false} is VALID [2022-04-08 10:05:11,825 INFO L290 TraceCheckUtils]: 29: Hoare triple {43152#false} assume 0 == ~cond; {43152#false} is VALID [2022-04-08 10:05:11,825 INFO L290 TraceCheckUtils]: 30: Hoare triple {43152#false} assume !false; {43152#false} is VALID [2022-04-08 10:05:11,825 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 10:05:11,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:05:11,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952874178] [2022-04-08 10:05:11,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952874178] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:05:11,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32285160] [2022-04-08 10:05:11,825 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:05:11,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:11,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:05:11,835 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:05:11,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-04-08 10:05:11,895 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:05:11,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:05:11,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-08 10:05:11,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:11,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:05:12,139 INFO L272 TraceCheckUtils]: 0: Hoare triple {43151#true} call ULTIMATE.init(); {43151#true} is VALID [2022-04-08 10:05:12,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {43151#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {43151#true} is VALID [2022-04-08 10:05:12,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {43151#true} assume true; {43151#true} is VALID [2022-04-08 10:05:12,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43151#true} {43151#true} #72#return; {43151#true} is VALID [2022-04-08 10:05:12,140 INFO L272 TraceCheckUtils]: 4: Hoare triple {43151#true} call #t~ret13 := main(); {43151#true} is VALID [2022-04-08 10:05:12,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {43151#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {43156#(= main_~y~0 0)} is VALID [2022-04-08 10:05:12,140 INFO L290 TraceCheckUtils]: 6: Hoare triple {43156#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43157#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:12,141 INFO L290 TraceCheckUtils]: 7: Hoare triple {43157#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43158#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:12,141 INFO L290 TraceCheckUtils]: 8: Hoare triple {43158#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43159#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:12,142 INFO L290 TraceCheckUtils]: 9: Hoare triple {43159#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43160#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:12,142 INFO L290 TraceCheckUtils]: 10: Hoare triple {43160#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43161#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:12,143 INFO L290 TraceCheckUtils]: 11: Hoare triple {43161#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {43161#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:12,143 INFO L290 TraceCheckUtils]: 12: Hoare triple {43161#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {43208#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:12,143 INFO L290 TraceCheckUtils]: 13: Hoare triple {43208#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43212#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:05:12,144 INFO L290 TraceCheckUtils]: 14: Hoare triple {43212#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43216#(and (= main_~y~0 (+ main_~z~0 2)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:12,144 INFO L290 TraceCheckUtils]: 15: Hoare triple {43216#(and (= main_~y~0 (+ main_~z~0 2)) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43220#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:12,145 INFO L290 TraceCheckUtils]: 16: Hoare triple {43220#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43224#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:12,146 INFO L290 TraceCheckUtils]: 17: Hoare triple {43224#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43228#(and (<= 5 main_~y~0) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:12,146 INFO L290 TraceCheckUtils]: 18: Hoare triple {43228#(and (<= 5 main_~y~0) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43152#false} is VALID [2022-04-08 10:05:12,146 INFO L290 TraceCheckUtils]: 19: Hoare triple {43152#false} assume !(~z~0 % 4294967296 > 0); {43152#false} is VALID [2022-04-08 10:05:12,146 INFO L290 TraceCheckUtils]: 20: Hoare triple {43152#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43152#false} is VALID [2022-04-08 10:05:12,146 INFO L290 TraceCheckUtils]: 21: Hoare triple {43152#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43152#false} is VALID [2022-04-08 10:05:12,146 INFO L290 TraceCheckUtils]: 22: Hoare triple {43152#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43152#false} is VALID [2022-04-08 10:05:12,146 INFO L290 TraceCheckUtils]: 23: Hoare triple {43152#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43152#false} is VALID [2022-04-08 10:05:12,146 INFO L290 TraceCheckUtils]: 24: Hoare triple {43152#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43152#false} is VALID [2022-04-08 10:05:12,146 INFO L290 TraceCheckUtils]: 25: Hoare triple {43152#false} assume !(~y~0 % 4294967296 > 0); {43152#false} is VALID [2022-04-08 10:05:12,146 INFO L290 TraceCheckUtils]: 26: Hoare triple {43152#false} assume !(~x~0 % 4294967296 > 0); {43152#false} is VALID [2022-04-08 10:05:12,147 INFO L272 TraceCheckUtils]: 27: Hoare triple {43152#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {43152#false} is VALID [2022-04-08 10:05:12,147 INFO L290 TraceCheckUtils]: 28: Hoare triple {43152#false} ~cond := #in~cond; {43152#false} is VALID [2022-04-08 10:05:12,147 INFO L290 TraceCheckUtils]: 29: Hoare triple {43152#false} assume 0 == ~cond; {43152#false} is VALID [2022-04-08 10:05:12,147 INFO L290 TraceCheckUtils]: 30: Hoare triple {43152#false} assume !false; {43152#false} is VALID [2022-04-08 10:05:12,147 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 10:05:12,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:05:12,485 INFO L290 TraceCheckUtils]: 30: Hoare triple {43152#false} assume !false; {43152#false} is VALID [2022-04-08 10:05:12,485 INFO L290 TraceCheckUtils]: 29: Hoare triple {43152#false} assume 0 == ~cond; {43152#false} is VALID [2022-04-08 10:05:12,485 INFO L290 TraceCheckUtils]: 28: Hoare triple {43152#false} ~cond := #in~cond; {43152#false} is VALID [2022-04-08 10:05:12,485 INFO L272 TraceCheckUtils]: 27: Hoare triple {43152#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {43152#false} is VALID [2022-04-08 10:05:12,485 INFO L290 TraceCheckUtils]: 26: Hoare triple {43152#false} assume !(~x~0 % 4294967296 > 0); {43152#false} is VALID [2022-04-08 10:05:12,486 INFO L290 TraceCheckUtils]: 25: Hoare triple {43283#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {43152#false} is VALID [2022-04-08 10:05:12,486 INFO L290 TraceCheckUtils]: 24: Hoare triple {43287#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43283#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:05:12,487 INFO L290 TraceCheckUtils]: 23: Hoare triple {43291#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43287#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:12,488 INFO L290 TraceCheckUtils]: 22: Hoare triple {43295#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43291#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:05:12,488 INFO L290 TraceCheckUtils]: 21: Hoare triple {43299#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43295#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:05:12,489 INFO L290 TraceCheckUtils]: 20: Hoare triple {43303#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43299#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:12,489 INFO L290 TraceCheckUtils]: 19: Hoare triple {43303#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {43303#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:12,490 INFO L290 TraceCheckUtils]: 18: Hoare triple {43310#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43303#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:12,491 INFO L290 TraceCheckUtils]: 17: Hoare triple {43314#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43310#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-08 10:05:12,491 INFO L290 TraceCheckUtils]: 16: Hoare triple {43318#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43314#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:05:12,492 INFO L290 TraceCheckUtils]: 15: Hoare triple {43322#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43318#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-08 10:05:12,493 INFO L290 TraceCheckUtils]: 14: Hoare triple {43326#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43322#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:05:12,493 INFO L290 TraceCheckUtils]: 13: Hoare triple {43330#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43326#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-08 10:05:12,494 INFO L290 TraceCheckUtils]: 12: Hoare triple {43151#true} ~z~0 := ~y~0; {43330#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-08 10:05:12,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {43151#true} assume !(~x~0 % 4294967296 > 0); {43151#true} is VALID [2022-04-08 10:05:12,494 INFO L290 TraceCheckUtils]: 10: Hoare triple {43151#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43151#true} is VALID [2022-04-08 10:05:12,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {43151#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43151#true} is VALID [2022-04-08 10:05:12,494 INFO L290 TraceCheckUtils]: 8: Hoare triple {43151#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43151#true} is VALID [2022-04-08 10:05:12,494 INFO L290 TraceCheckUtils]: 7: Hoare triple {43151#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43151#true} is VALID [2022-04-08 10:05:12,494 INFO L290 TraceCheckUtils]: 6: Hoare triple {43151#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {43151#true} is VALID [2022-04-08 10:05:12,494 INFO L290 TraceCheckUtils]: 5: Hoare triple {43151#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {43151#true} is VALID [2022-04-08 10:05:12,494 INFO L272 TraceCheckUtils]: 4: Hoare triple {43151#true} call #t~ret13 := main(); {43151#true} is VALID [2022-04-08 10:05:12,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43151#true} {43151#true} #72#return; {43151#true} is VALID [2022-04-08 10:05:12,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {43151#true} assume true; {43151#true} is VALID [2022-04-08 10:05:12,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {43151#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {43151#true} is VALID [2022-04-08 10:05:12,494 INFO L272 TraceCheckUtils]: 0: Hoare triple {43151#true} call ULTIMATE.init(); {43151#true} is VALID [2022-04-08 10:05:12,495 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 10:05:12,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32285160] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:05:12,495 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:05:12,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 33 [2022-04-08 10:05:12,495 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:05:12,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [615045478] [2022-04-08 10:05:12,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [615045478] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:05:12,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:05:12,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 10:05:12,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925089010] [2022-04-08 10:05:12,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:05:12,495 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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 31 [2022-04-08 10:05:12,496 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:05:12,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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-08 10:05:12,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:12,513 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 10:05:12,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:12,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 10:05:12,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=873, Unknown=0, NotChecked=0, Total=1056 [2022-04-08 10:05:12,513 INFO L87 Difference]: Start difference. First operand 243 states and 332 transitions. Second operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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-08 10:05:15,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:15,335 INFO L93 Difference]: Finished difference Result 294 states and 387 transitions. [2022-04-08 10:05:15,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-08 10:05:15,336 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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 31 [2022-04-08 10:05:15,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:05:15,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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-08 10:05:15,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 85 transitions. [2022-04-08 10:05:15,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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-08 10:05:15,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 85 transitions. [2022-04-08 10:05:15,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 85 transitions. [2022-04-08 10:05:15,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:15,405 INFO L225 Difference]: With dead ends: 294 [2022-04-08 10:05:15,405 INFO L226 Difference]: Without dead ends: 271 [2022-04-08 10:05:15,406 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=690, Invalid=3600, Unknown=0, NotChecked=0, Total=4290 [2022-04-08 10:05:15,406 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 38 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:05:15,406 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 79 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:05:15,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-04-08 10:05:16,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 242. [2022-04-08 10:05:16,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:05:16,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 271 states. Second operand has 242 states, 237 states have (on average 1.3670886075949367) internal successors, (324), 237 states have internal predecessors, (324), 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-08 10:05:16,439 INFO L74 IsIncluded]: Start isIncluded. First operand 271 states. Second operand has 242 states, 237 states have (on average 1.3670886075949367) internal successors, (324), 237 states have internal predecessors, (324), 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-08 10:05:16,439 INFO L87 Difference]: Start difference. First operand 271 states. Second operand has 242 states, 237 states have (on average 1.3670886075949367) internal successors, (324), 237 states have internal predecessors, (324), 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-08 10:05:16,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:16,442 INFO L93 Difference]: Finished difference Result 271 states and 361 transitions. [2022-04-08 10:05:16,442 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 361 transitions. [2022-04-08 10:05:16,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:16,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:16,442 INFO L74 IsIncluded]: Start isIncluded. First operand has 242 states, 237 states have (on average 1.3670886075949367) internal successors, (324), 237 states have internal predecessors, (324), 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 271 states. [2022-04-08 10:05:16,442 INFO L87 Difference]: Start difference. First operand has 242 states, 237 states have (on average 1.3670886075949367) internal successors, (324), 237 states have internal predecessors, (324), 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 271 states. [2022-04-08 10:05:16,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:16,445 INFO L93 Difference]: Finished difference Result 271 states and 361 transitions. [2022-04-08 10:05:16,445 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 361 transitions. [2022-04-08 10:05:16,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:16,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:16,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:05:16,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:05:16,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 237 states have (on average 1.3670886075949367) internal successors, (324), 237 states have internal predecessors, (324), 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-08 10:05:16,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 328 transitions. [2022-04-08 10:05:16,448 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 328 transitions. Word has length 31 [2022-04-08 10:05:16,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:05:16,448 INFO L478 AbstractCegarLoop]: Abstraction has 242 states and 328 transitions. [2022-04-08 10:05:16,449 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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-08 10:05:16,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 242 states and 328 transitions. [2022-04-08 10:05:17,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 328 edges. 328 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:17,518 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 328 transitions. [2022-04-08 10:05:17,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 10:05:17,518 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:05:17,518 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:05:17,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-04-08 10:05:17,727 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:17,727 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:05:17,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:05:17,728 INFO L85 PathProgramCache]: Analyzing trace with hash 874450008, now seen corresponding path program 33 times [2022-04-08 10:05:17,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:17,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2138795094] [2022-04-08 10:05:17,730 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:05:17,730 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:05:17,731 INFO L85 PathProgramCache]: Analyzing trace with hash 874450008, now seen corresponding path program 34 times [2022-04-08 10:05:17,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:05:17,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854062188] [2022-04-08 10:05:17,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:05:17,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:05:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:17,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:05:17,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:17,889 INFO L290 TraceCheckUtils]: 0: Hoare triple {45067#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {45052#true} is VALID [2022-04-08 10:05:17,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {45052#true} assume true; {45052#true} is VALID [2022-04-08 10:05:17,889 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45052#true} {45052#true} #72#return; {45052#true} is VALID [2022-04-08 10:05:17,889 INFO L272 TraceCheckUtils]: 0: Hoare triple {45052#true} call ULTIMATE.init(); {45067#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:05:17,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {45067#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {45052#true} is VALID [2022-04-08 10:05:17,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {45052#true} assume true; {45052#true} is VALID [2022-04-08 10:05:17,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45052#true} {45052#true} #72#return; {45052#true} is VALID [2022-04-08 10:05:17,890 INFO L272 TraceCheckUtils]: 4: Hoare triple {45052#true} call #t~ret13 := main(); {45052#true} is VALID [2022-04-08 10:05:17,890 INFO L290 TraceCheckUtils]: 5: Hoare triple {45052#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {45057#(= main_~y~0 0)} is VALID [2022-04-08 10:05:17,890 INFO L290 TraceCheckUtils]: 6: Hoare triple {45057#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45058#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:17,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {45058#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45059#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:17,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {45059#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45060#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:17,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {45060#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45061#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:17,892 INFO L290 TraceCheckUtils]: 10: Hoare triple {45061#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45062#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:17,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {45062#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45063#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:17,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {45063#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {45063#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:17,894 INFO L290 TraceCheckUtils]: 13: Hoare triple {45063#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {45064#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:05:17,894 INFO L290 TraceCheckUtils]: 14: Hoare triple {45064#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {45065#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:05:17,895 INFO L290 TraceCheckUtils]: 15: Hoare triple {45065#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {45066#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:05:17,895 INFO L290 TraceCheckUtils]: 16: Hoare triple {45066#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {45053#false} is VALID [2022-04-08 10:05:17,895 INFO L290 TraceCheckUtils]: 17: Hoare triple {45053#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45053#false} is VALID [2022-04-08 10:05:17,895 INFO L290 TraceCheckUtils]: 18: Hoare triple {45053#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45053#false} is VALID [2022-04-08 10:05:17,895 INFO L290 TraceCheckUtils]: 19: Hoare triple {45053#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45053#false} is VALID [2022-04-08 10:05:17,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {45053#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45053#false} is VALID [2022-04-08 10:05:17,895 INFO L290 TraceCheckUtils]: 21: Hoare triple {45053#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45053#false} is VALID [2022-04-08 10:05:17,895 INFO L290 TraceCheckUtils]: 22: Hoare triple {45053#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45053#false} is VALID [2022-04-08 10:05:17,895 INFO L290 TraceCheckUtils]: 23: Hoare triple {45053#false} assume !(~y~0 % 4294967296 > 0); {45053#false} is VALID [2022-04-08 10:05:17,895 INFO L290 TraceCheckUtils]: 24: Hoare triple {45053#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {45053#false} is VALID [2022-04-08 10:05:17,895 INFO L290 TraceCheckUtils]: 25: Hoare triple {45053#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {45053#false} is VALID [2022-04-08 10:05:17,896 INFO L290 TraceCheckUtils]: 26: Hoare triple {45053#false} assume !(~x~0 % 4294967296 > 0); {45053#false} is VALID [2022-04-08 10:05:17,896 INFO L272 TraceCheckUtils]: 27: Hoare triple {45053#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {45053#false} is VALID [2022-04-08 10:05:17,896 INFO L290 TraceCheckUtils]: 28: Hoare triple {45053#false} ~cond := #in~cond; {45053#false} is VALID [2022-04-08 10:05:17,896 INFO L290 TraceCheckUtils]: 29: Hoare triple {45053#false} assume 0 == ~cond; {45053#false} is VALID [2022-04-08 10:05:17,896 INFO L290 TraceCheckUtils]: 30: Hoare triple {45053#false} assume !false; {45053#false} is VALID [2022-04-08 10:05:17,896 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 10:05:17,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:05:17,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854062188] [2022-04-08 10:05:17,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854062188] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:05:17,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890625207] [2022-04-08 10:05:17,896 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:05:17,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:17,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:05:17,911 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:05:17,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-04-08 10:05:17,960 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:05:17,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:05:17,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 10:05:17,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:17,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:05:18,162 INFO L272 TraceCheckUtils]: 0: Hoare triple {45052#true} call ULTIMATE.init(); {45052#true} is VALID [2022-04-08 10:05:18,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {45052#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {45052#true} is VALID [2022-04-08 10:05:18,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {45052#true} assume true; {45052#true} is VALID [2022-04-08 10:05:18,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45052#true} {45052#true} #72#return; {45052#true} is VALID [2022-04-08 10:05:18,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {45052#true} call #t~ret13 := main(); {45052#true} is VALID [2022-04-08 10:05:18,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {45052#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {45057#(= main_~y~0 0)} is VALID [2022-04-08 10:05:18,163 INFO L290 TraceCheckUtils]: 6: Hoare triple {45057#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45058#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:18,163 INFO L290 TraceCheckUtils]: 7: Hoare triple {45058#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45059#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:18,164 INFO L290 TraceCheckUtils]: 8: Hoare triple {45059#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45060#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:18,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {45060#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45061#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:18,165 INFO L290 TraceCheckUtils]: 10: Hoare triple {45061#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45062#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:18,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {45062#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45063#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:18,166 INFO L290 TraceCheckUtils]: 12: Hoare triple {45063#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {45063#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:18,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {45063#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {45064#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:05:18,166 INFO L290 TraceCheckUtils]: 14: Hoare triple {45064#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {45065#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:05:18,167 INFO L290 TraceCheckUtils]: 15: Hoare triple {45065#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {45116#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:05:18,167 INFO L290 TraceCheckUtils]: 16: Hoare triple {45116#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {45053#false} is VALID [2022-04-08 10:05:18,167 INFO L290 TraceCheckUtils]: 17: Hoare triple {45053#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45053#false} is VALID [2022-04-08 10:05:18,167 INFO L290 TraceCheckUtils]: 18: Hoare triple {45053#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45053#false} is VALID [2022-04-08 10:05:18,167 INFO L290 TraceCheckUtils]: 19: Hoare triple {45053#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45053#false} is VALID [2022-04-08 10:05:18,167 INFO L290 TraceCheckUtils]: 20: Hoare triple {45053#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45053#false} is VALID [2022-04-08 10:05:18,168 INFO L290 TraceCheckUtils]: 21: Hoare triple {45053#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45053#false} is VALID [2022-04-08 10:05:18,168 INFO L290 TraceCheckUtils]: 22: Hoare triple {45053#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45053#false} is VALID [2022-04-08 10:05:18,168 INFO L290 TraceCheckUtils]: 23: Hoare triple {45053#false} assume !(~y~0 % 4294967296 > 0); {45053#false} is VALID [2022-04-08 10:05:18,168 INFO L290 TraceCheckUtils]: 24: Hoare triple {45053#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {45053#false} is VALID [2022-04-08 10:05:18,168 INFO L290 TraceCheckUtils]: 25: Hoare triple {45053#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {45053#false} is VALID [2022-04-08 10:05:18,168 INFO L290 TraceCheckUtils]: 26: Hoare triple {45053#false} assume !(~x~0 % 4294967296 > 0); {45053#false} is VALID [2022-04-08 10:05:18,168 INFO L272 TraceCheckUtils]: 27: Hoare triple {45053#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {45053#false} is VALID [2022-04-08 10:05:18,168 INFO L290 TraceCheckUtils]: 28: Hoare triple {45053#false} ~cond := #in~cond; {45053#false} is VALID [2022-04-08 10:05:18,168 INFO L290 TraceCheckUtils]: 29: Hoare triple {45053#false} assume 0 == ~cond; {45053#false} is VALID [2022-04-08 10:05:18,168 INFO L290 TraceCheckUtils]: 30: Hoare triple {45053#false} assume !false; {45053#false} is VALID [2022-04-08 10:05:18,168 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 10:05:18,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:05:18,396 INFO L290 TraceCheckUtils]: 30: Hoare triple {45053#false} assume !false; {45053#false} is VALID [2022-04-08 10:05:18,396 INFO L290 TraceCheckUtils]: 29: Hoare triple {45053#false} assume 0 == ~cond; {45053#false} is VALID [2022-04-08 10:05:18,396 INFO L290 TraceCheckUtils]: 28: Hoare triple {45053#false} ~cond := #in~cond; {45053#false} is VALID [2022-04-08 10:05:18,396 INFO L272 TraceCheckUtils]: 27: Hoare triple {45053#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {45053#false} is VALID [2022-04-08 10:05:18,396 INFO L290 TraceCheckUtils]: 26: Hoare triple {45053#false} assume !(~x~0 % 4294967296 > 0); {45053#false} is VALID [2022-04-08 10:05:18,396 INFO L290 TraceCheckUtils]: 25: Hoare triple {45053#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {45053#false} is VALID [2022-04-08 10:05:18,396 INFO L290 TraceCheckUtils]: 24: Hoare triple {45053#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {45053#false} is VALID [2022-04-08 10:05:18,396 INFO L290 TraceCheckUtils]: 23: Hoare triple {45053#false} assume !(~y~0 % 4294967296 > 0); {45053#false} is VALID [2022-04-08 10:05:18,396 INFO L290 TraceCheckUtils]: 22: Hoare triple {45053#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45053#false} is VALID [2022-04-08 10:05:18,396 INFO L290 TraceCheckUtils]: 21: Hoare triple {45053#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45053#false} is VALID [2022-04-08 10:05:18,396 INFO L290 TraceCheckUtils]: 20: Hoare triple {45053#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45053#false} is VALID [2022-04-08 10:05:18,396 INFO L290 TraceCheckUtils]: 19: Hoare triple {45053#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45053#false} is VALID [2022-04-08 10:05:18,396 INFO L290 TraceCheckUtils]: 18: Hoare triple {45053#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45053#false} is VALID [2022-04-08 10:05:18,396 INFO L290 TraceCheckUtils]: 17: Hoare triple {45053#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {45053#false} is VALID [2022-04-08 10:05:18,397 INFO L290 TraceCheckUtils]: 16: Hoare triple {45204#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {45053#false} is VALID [2022-04-08 10:05:18,397 INFO L290 TraceCheckUtils]: 15: Hoare triple {45208#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {45204#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:05:18,398 INFO L290 TraceCheckUtils]: 14: Hoare triple {45212#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {45208#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:18,398 INFO L290 TraceCheckUtils]: 13: Hoare triple {45216#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {45212#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:05:18,399 INFO L290 TraceCheckUtils]: 12: Hoare triple {45216#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {45216#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:05:18,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {45223#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45216#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:05:18,400 INFO L290 TraceCheckUtils]: 10: Hoare triple {45227#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45223#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:18,401 INFO L290 TraceCheckUtils]: 9: Hoare triple {45231#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45227#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:05:18,401 INFO L290 TraceCheckUtils]: 8: Hoare triple {45235#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45231#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:05:18,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {45239#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45235#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:05:18,402 INFO L290 TraceCheckUtils]: 6: Hoare triple {45243#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {45239#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:05:18,403 INFO L290 TraceCheckUtils]: 5: Hoare triple {45052#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {45243#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:05:18,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {45052#true} call #t~ret13 := main(); {45052#true} is VALID [2022-04-08 10:05:18,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45052#true} {45052#true} #72#return; {45052#true} is VALID [2022-04-08 10:05:18,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {45052#true} assume true; {45052#true} is VALID [2022-04-08 10:05:18,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {45052#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {45052#true} is VALID [2022-04-08 10:05:18,403 INFO L272 TraceCheckUtils]: 0: Hoare triple {45052#true} call ULTIMATE.init(); {45052#true} is VALID [2022-04-08 10:05:18,403 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 10:05:18,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890625207] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:05:18,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:05:18,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-08 10:05:18,403 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:05:18,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2138795094] [2022-04-08 10:05:18,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2138795094] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:05:18,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:05:18,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 10:05:18,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914332769] [2022-04-08 10:05:18,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:05:18,404 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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 31 [2022-04-08 10:05:18,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:05:18,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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-08 10:05:18,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:18,421 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 10:05:18,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:18,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 10:05:18,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2022-04-08 10:05:18,422 INFO L87 Difference]: Start difference. First operand 242 states and 328 transitions. Second operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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-08 10:05:20,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:20,454 INFO L93 Difference]: Finished difference Result 312 states and 404 transitions. [2022-04-08 10:05:20,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 10:05:20,454 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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 31 [2022-04-08 10:05:20,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:05:20,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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-08 10:05:20,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 81 transitions. [2022-04-08 10:05:20,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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-08 10:05:20,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 81 transitions. [2022-04-08 10:05:20,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 81 transitions. [2022-04-08 10:05:20,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:20,508 INFO L225 Difference]: With dead ends: 312 [2022-04-08 10:05:20,508 INFO L226 Difference]: Without dead ends: 297 [2022-04-08 10:05:20,508 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=282, Invalid=1050, Unknown=0, NotChecked=0, Total=1332 [2022-04-08 10:05:20,510 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 42 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:05:20,510 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 78 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:05:20,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2022-04-08 10:05:21,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 242. [2022-04-08 10:05:21,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:05:21,216 INFO L82 GeneralOperation]: Start isEquivalent. First operand 297 states. Second operand has 242 states, 237 states have (on average 1.3628691983122363) internal successors, (323), 237 states have internal predecessors, (323), 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-08 10:05:21,216 INFO L74 IsIncluded]: Start isIncluded. First operand 297 states. Second operand has 242 states, 237 states have (on average 1.3628691983122363) internal successors, (323), 237 states have internal predecessors, (323), 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-08 10:05:21,217 INFO L87 Difference]: Start difference. First operand 297 states. Second operand has 242 states, 237 states have (on average 1.3628691983122363) internal successors, (323), 237 states have internal predecessors, (323), 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-08 10:05:21,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:21,220 INFO L93 Difference]: Finished difference Result 297 states and 389 transitions. [2022-04-08 10:05:21,220 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 389 transitions. [2022-04-08 10:05:21,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:21,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:21,220 INFO L74 IsIncluded]: Start isIncluded. First operand has 242 states, 237 states have (on average 1.3628691983122363) internal successors, (323), 237 states have internal predecessors, (323), 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 297 states. [2022-04-08 10:05:21,221 INFO L87 Difference]: Start difference. First operand has 242 states, 237 states have (on average 1.3628691983122363) internal successors, (323), 237 states have internal predecessors, (323), 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 297 states. [2022-04-08 10:05:21,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:21,224 INFO L93 Difference]: Finished difference Result 297 states and 389 transitions. [2022-04-08 10:05:21,224 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 389 transitions. [2022-04-08 10:05:21,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:21,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:21,225 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:05:21,225 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:05:21,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 237 states have (on average 1.3628691983122363) internal successors, (323), 237 states have internal predecessors, (323), 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-08 10:05:21,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 327 transitions. [2022-04-08 10:05:21,228 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 327 transitions. Word has length 31 [2022-04-08 10:05:21,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:05:21,228 INFO L478 AbstractCegarLoop]: Abstraction has 242 states and 327 transitions. [2022-04-08 10:05:21,228 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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-08 10:05:21,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 242 states and 327 transitions. [2022-04-08 10:05:22,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 327 edges. 327 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:22,395 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 327 transitions. [2022-04-08 10:05:22,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 10:05:22,396 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:05:22,396 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:05:22,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-04-08 10:05:22,611 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:22,611 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:05:22,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:05:22,612 INFO L85 PathProgramCache]: Analyzing trace with hash 2116095112, now seen corresponding path program 35 times [2022-04-08 10:05:22,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:22,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [683786102] [2022-04-08 10:05:22,621 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:05:22,621 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:05:22,621 INFO L85 PathProgramCache]: Analyzing trace with hash 2116095112, now seen corresponding path program 36 times [2022-04-08 10:05:22,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:05:22,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012374249] [2022-04-08 10:05:22,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:05:22,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:05:22,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:22,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:05:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:22,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {47007#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {46992#true} is VALID [2022-04-08 10:05:22,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {46992#true} assume true; {46992#true} is VALID [2022-04-08 10:05:22,754 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46992#true} {46992#true} #72#return; {46992#true} is VALID [2022-04-08 10:05:22,754 INFO L272 TraceCheckUtils]: 0: Hoare triple {46992#true} call ULTIMATE.init(); {47007#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:05:22,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {47007#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {46992#true} is VALID [2022-04-08 10:05:22,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {46992#true} assume true; {46992#true} is VALID [2022-04-08 10:05:22,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46992#true} {46992#true} #72#return; {46992#true} is VALID [2022-04-08 10:05:22,755 INFO L272 TraceCheckUtils]: 4: Hoare triple {46992#true} call #t~ret13 := main(); {46992#true} is VALID [2022-04-08 10:05:22,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {46992#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {46997#(= main_~y~0 0)} is VALID [2022-04-08 10:05:22,755 INFO L290 TraceCheckUtils]: 6: Hoare triple {46997#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46998#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:22,756 INFO L290 TraceCheckUtils]: 7: Hoare triple {46998#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46999#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:22,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {46999#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47000#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:22,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {47000#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47001#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:22,757 INFO L290 TraceCheckUtils]: 10: Hoare triple {47001#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47002#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:22,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {47002#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47003#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:22,758 INFO L290 TraceCheckUtils]: 12: Hoare triple {47003#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47004#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:22,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {47004#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {47004#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:22,759 INFO L290 TraceCheckUtils]: 14: Hoare triple {47004#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {47005#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:05:22,759 INFO L290 TraceCheckUtils]: 15: Hoare triple {47005#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47006#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-08 10:05:22,760 INFO L290 TraceCheckUtils]: 16: Hoare triple {47006#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {46993#false} is VALID [2022-04-08 10:05:22,760 INFO L290 TraceCheckUtils]: 17: Hoare triple {46993#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46993#false} is VALID [2022-04-08 10:05:22,760 INFO L290 TraceCheckUtils]: 18: Hoare triple {46993#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46993#false} is VALID [2022-04-08 10:05:22,760 INFO L290 TraceCheckUtils]: 19: Hoare triple {46993#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46993#false} is VALID [2022-04-08 10:05:22,760 INFO L290 TraceCheckUtils]: 20: Hoare triple {46993#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46993#false} is VALID [2022-04-08 10:05:22,760 INFO L290 TraceCheckUtils]: 21: Hoare triple {46993#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46993#false} is VALID [2022-04-08 10:05:22,760 INFO L290 TraceCheckUtils]: 22: Hoare triple {46993#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46993#false} is VALID [2022-04-08 10:05:22,760 INFO L290 TraceCheckUtils]: 23: Hoare triple {46993#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46993#false} is VALID [2022-04-08 10:05:22,760 INFO L290 TraceCheckUtils]: 24: Hoare triple {46993#false} assume !(~y~0 % 4294967296 > 0); {46993#false} is VALID [2022-04-08 10:05:22,760 INFO L290 TraceCheckUtils]: 25: Hoare triple {46993#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {46993#false} is VALID [2022-04-08 10:05:22,760 INFO L290 TraceCheckUtils]: 26: Hoare triple {46993#false} assume !(~x~0 % 4294967296 > 0); {46993#false} is VALID [2022-04-08 10:05:22,760 INFO L272 TraceCheckUtils]: 27: Hoare triple {46993#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {46993#false} is VALID [2022-04-08 10:05:22,760 INFO L290 TraceCheckUtils]: 28: Hoare triple {46993#false} ~cond := #in~cond; {46993#false} is VALID [2022-04-08 10:05:22,760 INFO L290 TraceCheckUtils]: 29: Hoare triple {46993#false} assume 0 == ~cond; {46993#false} is VALID [2022-04-08 10:05:22,761 INFO L290 TraceCheckUtils]: 30: Hoare triple {46993#false} assume !false; {46993#false} is VALID [2022-04-08 10:05:22,761 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-08 10:05:22,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:05:22,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012374249] [2022-04-08 10:05:22,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012374249] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:05:22,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225449475] [2022-04-08 10:05:22,761 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:05:22,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:22,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:05:22,762 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:05:22,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-04-08 10:05:22,833 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 10:05:22,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:05:22,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 10:05:22,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:22,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:05:23,060 INFO L272 TraceCheckUtils]: 0: Hoare triple {46992#true} call ULTIMATE.init(); {46992#true} is VALID [2022-04-08 10:05:23,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {46992#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {46992#true} is VALID [2022-04-08 10:05:23,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {46992#true} assume true; {46992#true} is VALID [2022-04-08 10:05:23,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46992#true} {46992#true} #72#return; {46992#true} is VALID [2022-04-08 10:05:23,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {46992#true} call #t~ret13 := main(); {46992#true} is VALID [2022-04-08 10:05:23,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {46992#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {46997#(= main_~y~0 0)} is VALID [2022-04-08 10:05:23,061 INFO L290 TraceCheckUtils]: 6: Hoare triple {46997#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46998#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:23,062 INFO L290 TraceCheckUtils]: 7: Hoare triple {46998#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {46999#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:23,062 INFO L290 TraceCheckUtils]: 8: Hoare triple {46999#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47000#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:23,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {47000#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47001#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:23,063 INFO L290 TraceCheckUtils]: 10: Hoare triple {47001#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47002#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:23,064 INFO L290 TraceCheckUtils]: 11: Hoare triple {47002#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47003#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:23,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {47003#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47004#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:23,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {47004#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {47004#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:23,065 INFO L290 TraceCheckUtils]: 14: Hoare triple {47004#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {47005#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:05:23,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {47005#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47056#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:05:23,066 INFO L290 TraceCheckUtils]: 16: Hoare triple {47056#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {46993#false} is VALID [2022-04-08 10:05:23,066 INFO L290 TraceCheckUtils]: 17: Hoare triple {46993#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46993#false} is VALID [2022-04-08 10:05:23,066 INFO L290 TraceCheckUtils]: 18: Hoare triple {46993#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46993#false} is VALID [2022-04-08 10:05:23,066 INFO L290 TraceCheckUtils]: 19: Hoare triple {46993#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46993#false} is VALID [2022-04-08 10:05:23,066 INFO L290 TraceCheckUtils]: 20: Hoare triple {46993#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46993#false} is VALID [2022-04-08 10:05:23,066 INFO L290 TraceCheckUtils]: 21: Hoare triple {46993#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46993#false} is VALID [2022-04-08 10:05:23,066 INFO L290 TraceCheckUtils]: 22: Hoare triple {46993#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46993#false} is VALID [2022-04-08 10:05:23,066 INFO L290 TraceCheckUtils]: 23: Hoare triple {46993#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46993#false} is VALID [2022-04-08 10:05:23,066 INFO L290 TraceCheckUtils]: 24: Hoare triple {46993#false} assume !(~y~0 % 4294967296 > 0); {46993#false} is VALID [2022-04-08 10:05:23,066 INFO L290 TraceCheckUtils]: 25: Hoare triple {46993#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {46993#false} is VALID [2022-04-08 10:05:23,066 INFO L290 TraceCheckUtils]: 26: Hoare triple {46993#false} assume !(~x~0 % 4294967296 > 0); {46993#false} is VALID [2022-04-08 10:05:23,066 INFO L272 TraceCheckUtils]: 27: Hoare triple {46993#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {46993#false} is VALID [2022-04-08 10:05:23,066 INFO L290 TraceCheckUtils]: 28: Hoare triple {46993#false} ~cond := #in~cond; {46993#false} is VALID [2022-04-08 10:05:23,066 INFO L290 TraceCheckUtils]: 29: Hoare triple {46993#false} assume 0 == ~cond; {46993#false} is VALID [2022-04-08 10:05:23,066 INFO L290 TraceCheckUtils]: 30: Hoare triple {46993#false} assume !false; {46993#false} is VALID [2022-04-08 10:05:23,067 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-08 10:05:23,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:05:23,291 INFO L290 TraceCheckUtils]: 30: Hoare triple {46993#false} assume !false; {46993#false} is VALID [2022-04-08 10:05:23,291 INFO L290 TraceCheckUtils]: 29: Hoare triple {46993#false} assume 0 == ~cond; {46993#false} is VALID [2022-04-08 10:05:23,291 INFO L290 TraceCheckUtils]: 28: Hoare triple {46993#false} ~cond := #in~cond; {46993#false} is VALID [2022-04-08 10:05:23,292 INFO L272 TraceCheckUtils]: 27: Hoare triple {46993#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {46993#false} is VALID [2022-04-08 10:05:23,292 INFO L290 TraceCheckUtils]: 26: Hoare triple {46993#false} assume !(~x~0 % 4294967296 > 0); {46993#false} is VALID [2022-04-08 10:05:23,292 INFO L290 TraceCheckUtils]: 25: Hoare triple {46993#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {46993#false} is VALID [2022-04-08 10:05:23,292 INFO L290 TraceCheckUtils]: 24: Hoare triple {46993#false} assume !(~y~0 % 4294967296 > 0); {46993#false} is VALID [2022-04-08 10:05:23,292 INFO L290 TraceCheckUtils]: 23: Hoare triple {46993#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46993#false} is VALID [2022-04-08 10:05:23,292 INFO L290 TraceCheckUtils]: 22: Hoare triple {46993#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46993#false} is VALID [2022-04-08 10:05:23,292 INFO L290 TraceCheckUtils]: 21: Hoare triple {46993#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46993#false} is VALID [2022-04-08 10:05:23,292 INFO L290 TraceCheckUtils]: 20: Hoare triple {46993#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46993#false} is VALID [2022-04-08 10:05:23,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {46993#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46993#false} is VALID [2022-04-08 10:05:23,292 INFO L290 TraceCheckUtils]: 18: Hoare triple {46993#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46993#false} is VALID [2022-04-08 10:05:23,292 INFO L290 TraceCheckUtils]: 17: Hoare triple {46993#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46993#false} is VALID [2022-04-08 10:05:23,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {47144#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {46993#false} is VALID [2022-04-08 10:05:23,293 INFO L290 TraceCheckUtils]: 15: Hoare triple {47148#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47144#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:05:23,293 INFO L290 TraceCheckUtils]: 14: Hoare triple {47152#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {47148#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:23,294 INFO L290 TraceCheckUtils]: 13: Hoare triple {47152#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {47152#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:23,294 INFO L290 TraceCheckUtils]: 12: Hoare triple {47159#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47152#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:05:23,295 INFO L290 TraceCheckUtils]: 11: Hoare triple {47163#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47159#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:05:23,296 INFO L290 TraceCheckUtils]: 10: Hoare triple {47167#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47163#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:05:23,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {47171#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47167#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:05:23,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {47175#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47171#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:05:23,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {47179#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47175#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:05:23,298 INFO L290 TraceCheckUtils]: 6: Hoare triple {47183#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {47179#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:23,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {46992#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {47183#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:05:23,298 INFO L272 TraceCheckUtils]: 4: Hoare triple {46992#true} call #t~ret13 := main(); {46992#true} is VALID [2022-04-08 10:05:23,298 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46992#true} {46992#true} #72#return; {46992#true} is VALID [2022-04-08 10:05:23,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {46992#true} assume true; {46992#true} is VALID [2022-04-08 10:05:23,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {46992#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {46992#true} is VALID [2022-04-08 10:05:23,299 INFO L272 TraceCheckUtils]: 0: Hoare triple {46992#true} call ULTIMATE.init(); {46992#true} is VALID [2022-04-08 10:05:23,299 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-08 10:05:23,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225449475] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:05:23,299 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:05:23,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-08 10:05:23,299 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:05:23,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [683786102] [2022-04-08 10:05:23,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [683786102] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:05:23,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:05:23,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 10:05:23,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588238837] [2022-04-08 10:05:23,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:05:23,300 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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 31 [2022-04-08 10:05:23,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:05:23,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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-08 10:05:23,316 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:23,316 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 10:05:23,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:23,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 10:05:23,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2022-04-08 10:05:23,316 INFO L87 Difference]: Start difference. First operand 242 states and 327 transitions. Second operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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-08 10:05:25,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:25,307 INFO L93 Difference]: Finished difference Result 329 states and 421 transitions. [2022-04-08 10:05:25,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 10:05:25,307 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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 31 [2022-04-08 10:05:25,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:05:25,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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-08 10:05:25,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 87 transitions. [2022-04-08 10:05:25,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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-08 10:05:25,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 87 transitions. [2022-04-08 10:05:25,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 87 transitions. [2022-04-08 10:05:25,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:25,356 INFO L225 Difference]: With dead ends: 329 [2022-04-08 10:05:25,356 INFO L226 Difference]: Without dead ends: 314 [2022-04-08 10:05:25,356 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=259, Invalid=931, Unknown=0, NotChecked=0, Total=1190 [2022-04-08 10:05:25,356 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 52 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:05:25,357 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 84 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:05:25,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2022-04-08 10:05:25,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 242. [2022-04-08 10:05:25,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:05:25,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 314 states. Second operand has 242 states, 237 states have (on average 1.358649789029536) internal successors, (322), 237 states have internal predecessors, (322), 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-08 10:05:25,971 INFO L74 IsIncluded]: Start isIncluded. First operand 314 states. Second operand has 242 states, 237 states have (on average 1.358649789029536) internal successors, (322), 237 states have internal predecessors, (322), 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-08 10:05:25,971 INFO L87 Difference]: Start difference. First operand 314 states. Second operand has 242 states, 237 states have (on average 1.358649789029536) internal successors, (322), 237 states have internal predecessors, (322), 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-08 10:05:25,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:25,975 INFO L93 Difference]: Finished difference Result 314 states and 406 transitions. [2022-04-08 10:05:25,975 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 406 transitions. [2022-04-08 10:05:25,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:25,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:25,975 INFO L74 IsIncluded]: Start isIncluded. First operand has 242 states, 237 states have (on average 1.358649789029536) internal successors, (322), 237 states have internal predecessors, (322), 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 314 states. [2022-04-08 10:05:25,975 INFO L87 Difference]: Start difference. First operand has 242 states, 237 states have (on average 1.358649789029536) internal successors, (322), 237 states have internal predecessors, (322), 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 314 states. [2022-04-08 10:05:25,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:25,979 INFO L93 Difference]: Finished difference Result 314 states and 406 transitions. [2022-04-08 10:05:25,979 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 406 transitions. [2022-04-08 10:05:25,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:25,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:25,979 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:05:25,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:05:25,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 237 states have (on average 1.358649789029536) internal successors, (322), 237 states have internal predecessors, (322), 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-08 10:05:25,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 326 transitions. [2022-04-08 10:05:25,982 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 326 transitions. Word has length 31 [2022-04-08 10:05:25,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:05:25,982 INFO L478 AbstractCegarLoop]: Abstraction has 242 states and 326 transitions. [2022-04-08 10:05:25,982 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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-08 10:05:25,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 242 states and 326 transitions. [2022-04-08 10:05:27,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 326 edges. 326 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:27,015 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 326 transitions. [2022-04-08 10:05:27,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-08 10:05:27,015 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:05:27,015 INFO L499 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:05:27,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-04-08 10:05:27,228 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-04-08 10:05:27,229 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:05:27,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:05:27,229 INFO L85 PathProgramCache]: Analyzing trace with hash -853881000, now seen corresponding path program 31 times [2022-04-08 10:05:27,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:27,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [805798672] [2022-04-08 10:05:27,231 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:05:27,231 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:05:27,231 INFO L85 PathProgramCache]: Analyzing trace with hash -853881000, now seen corresponding path program 32 times [2022-04-08 10:05:27,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:05:27,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656284390] [2022-04-08 10:05:27,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:05:27,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:05:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:27,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:05:27,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:27,535 INFO L290 TraceCheckUtils]: 0: Hoare triple {49019#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {48996#true} is VALID [2022-04-08 10:05:27,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {48996#true} assume true; {48996#true} is VALID [2022-04-08 10:05:27,535 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48996#true} {48996#true} #72#return; {48996#true} is VALID [2022-04-08 10:05:27,536 INFO L272 TraceCheckUtils]: 0: Hoare triple {48996#true} call ULTIMATE.init(); {49019#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:05:27,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {49019#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {48996#true} is VALID [2022-04-08 10:05:27,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {48996#true} assume true; {48996#true} is VALID [2022-04-08 10:05:27,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48996#true} {48996#true} #72#return; {48996#true} is VALID [2022-04-08 10:05:27,536 INFO L272 TraceCheckUtils]: 4: Hoare triple {48996#true} call #t~ret13 := main(); {48996#true} is VALID [2022-04-08 10:05:27,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {48996#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {49001#(= main_~y~0 0)} is VALID [2022-04-08 10:05:27,537 INFO L290 TraceCheckUtils]: 6: Hoare triple {49001#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49002#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:27,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {49002#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49003#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:27,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {49003#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49004#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:27,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {49004#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49005#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:27,538 INFO L290 TraceCheckUtils]: 10: Hoare triple {49005#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49006#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:27,539 INFO L290 TraceCheckUtils]: 11: Hoare triple {49006#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49007#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:27,539 INFO L290 TraceCheckUtils]: 12: Hoare triple {49007#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49008#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:27,540 INFO L290 TraceCheckUtils]: 13: Hoare triple {49008#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49009#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:27,540 INFO L290 TraceCheckUtils]: 14: Hoare triple {49009#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49010#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:27,541 INFO L290 TraceCheckUtils]: 15: Hoare triple {49010#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49011#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:05:27,541 INFO L290 TraceCheckUtils]: 16: Hoare triple {49011#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49012#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:05:27,542 INFO L290 TraceCheckUtils]: 17: Hoare triple {49012#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49013#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:05:27,542 INFO L290 TraceCheckUtils]: 18: Hoare triple {49013#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49014#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:05:27,542 INFO L290 TraceCheckUtils]: 19: Hoare triple {49014#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49015#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:05:27,543 INFO L290 TraceCheckUtils]: 20: Hoare triple {49015#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49016#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:05:27,543 INFO L290 TraceCheckUtils]: 21: Hoare triple {49016#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49017#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:05:27,544 INFO L290 TraceCheckUtils]: 22: Hoare triple {49017#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {49017#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:05:27,544 INFO L290 TraceCheckUtils]: 23: Hoare triple {49017#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {49018#(and (<= 16 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:05:27,544 INFO L290 TraceCheckUtils]: 24: Hoare triple {49018#(and (<= 16 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {48997#false} is VALID [2022-04-08 10:05:27,545 INFO L290 TraceCheckUtils]: 25: Hoare triple {48997#false} assume !(~y~0 % 4294967296 > 0); {48997#false} is VALID [2022-04-08 10:05:27,545 INFO L290 TraceCheckUtils]: 26: Hoare triple {48997#false} assume !(~x~0 % 4294967296 > 0); {48997#false} is VALID [2022-04-08 10:05:27,545 INFO L272 TraceCheckUtils]: 27: Hoare triple {48997#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {48997#false} is VALID [2022-04-08 10:05:27,545 INFO L290 TraceCheckUtils]: 28: Hoare triple {48997#false} ~cond := #in~cond; {48997#false} is VALID [2022-04-08 10:05:27,545 INFO L290 TraceCheckUtils]: 29: Hoare triple {48997#false} assume 0 == ~cond; {48997#false} is VALID [2022-04-08 10:05:27,545 INFO L290 TraceCheckUtils]: 30: Hoare triple {48997#false} assume !false; {48997#false} is VALID [2022-04-08 10:05:27,545 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:05:27,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:05:27,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656284390] [2022-04-08 10:05:27,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656284390] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:05:27,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874934358] [2022-04-08 10:05:27,545 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:05:27,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:27,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:05:27,546 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:05:27,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-04-08 10:05:27,582 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:05:27,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:05:27,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-08 10:05:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:27,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:05:27,888 INFO L272 TraceCheckUtils]: 0: Hoare triple {48996#true} call ULTIMATE.init(); {48996#true} is VALID [2022-04-08 10:05:27,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {48996#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {48996#true} is VALID [2022-04-08 10:05:27,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {48996#true} assume true; {48996#true} is VALID [2022-04-08 10:05:27,888 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48996#true} {48996#true} #72#return; {48996#true} is VALID [2022-04-08 10:05:27,888 INFO L272 TraceCheckUtils]: 4: Hoare triple {48996#true} call #t~ret13 := main(); {48996#true} is VALID [2022-04-08 10:05:27,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {48996#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {49001#(= main_~y~0 0)} is VALID [2022-04-08 10:05:27,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {49001#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49002#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:27,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {49002#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49003#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:27,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {49003#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49004#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:27,890 INFO L290 TraceCheckUtils]: 9: Hoare triple {49004#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49005#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:27,891 INFO L290 TraceCheckUtils]: 10: Hoare triple {49005#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49006#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:27,891 INFO L290 TraceCheckUtils]: 11: Hoare triple {49006#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49007#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:27,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {49007#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49008#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:27,892 INFO L290 TraceCheckUtils]: 13: Hoare triple {49008#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49009#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:27,893 INFO L290 TraceCheckUtils]: 14: Hoare triple {49009#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49010#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:27,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {49010#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49011#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:05:27,894 INFO L290 TraceCheckUtils]: 16: Hoare triple {49011#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49012#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:05:27,894 INFO L290 TraceCheckUtils]: 17: Hoare triple {49012#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49013#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:05:27,895 INFO L290 TraceCheckUtils]: 18: Hoare triple {49013#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49014#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:05:27,895 INFO L290 TraceCheckUtils]: 19: Hoare triple {49014#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49015#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:05:27,896 INFO L290 TraceCheckUtils]: 20: Hoare triple {49015#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49016#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:05:27,896 INFO L290 TraceCheckUtils]: 21: Hoare triple {49016#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49017#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:05:27,897 INFO L290 TraceCheckUtils]: 22: Hoare triple {49017#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {49017#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:05:27,897 INFO L290 TraceCheckUtils]: 23: Hoare triple {49017#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {49092#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-08 10:05:27,898 INFO L290 TraceCheckUtils]: 24: Hoare triple {49092#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !(~z~0 % 4294967296 > 0); {48997#false} is VALID [2022-04-08 10:05:27,898 INFO L290 TraceCheckUtils]: 25: Hoare triple {48997#false} assume !(~y~0 % 4294967296 > 0); {48997#false} is VALID [2022-04-08 10:05:27,898 INFO L290 TraceCheckUtils]: 26: Hoare triple {48997#false} assume !(~x~0 % 4294967296 > 0); {48997#false} is VALID [2022-04-08 10:05:27,898 INFO L272 TraceCheckUtils]: 27: Hoare triple {48997#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {48997#false} is VALID [2022-04-08 10:05:27,898 INFO L290 TraceCheckUtils]: 28: Hoare triple {48997#false} ~cond := #in~cond; {48997#false} is VALID [2022-04-08 10:05:27,898 INFO L290 TraceCheckUtils]: 29: Hoare triple {48997#false} assume 0 == ~cond; {48997#false} is VALID [2022-04-08 10:05:27,898 INFO L290 TraceCheckUtils]: 30: Hoare triple {48997#false} assume !false; {48997#false} is VALID [2022-04-08 10:05:27,898 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:05:27,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:05:28,452 INFO L290 TraceCheckUtils]: 30: Hoare triple {48997#false} assume !false; {48997#false} is VALID [2022-04-08 10:05:28,452 INFO L290 TraceCheckUtils]: 29: Hoare triple {48997#false} assume 0 == ~cond; {48997#false} is VALID [2022-04-08 10:05:28,452 INFO L290 TraceCheckUtils]: 28: Hoare triple {48997#false} ~cond := #in~cond; {48997#false} is VALID [2022-04-08 10:05:28,452 INFO L272 TraceCheckUtils]: 27: Hoare triple {48997#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {48997#false} is VALID [2022-04-08 10:05:28,452 INFO L290 TraceCheckUtils]: 26: Hoare triple {48997#false} assume !(~x~0 % 4294967296 > 0); {48997#false} is VALID [2022-04-08 10:05:28,452 INFO L290 TraceCheckUtils]: 25: Hoare triple {48997#false} assume !(~y~0 % 4294967296 > 0); {48997#false} is VALID [2022-04-08 10:05:28,453 INFO L290 TraceCheckUtils]: 24: Hoare triple {49132#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {48997#false} is VALID [2022-04-08 10:05:28,453 INFO L290 TraceCheckUtils]: 23: Hoare triple {49136#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {49132#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:05:28,453 INFO L290 TraceCheckUtils]: 22: Hoare triple {49136#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {49136#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:05:28,454 INFO L290 TraceCheckUtils]: 21: Hoare triple {49143#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49136#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:05:28,454 INFO L290 TraceCheckUtils]: 20: Hoare triple {49147#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49143#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:05:28,455 INFO L290 TraceCheckUtils]: 19: Hoare triple {49151#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49147#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:05:28,456 INFO L290 TraceCheckUtils]: 18: Hoare triple {49155#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49151#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:05:28,456 INFO L290 TraceCheckUtils]: 17: Hoare triple {49159#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49155#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:05:28,457 INFO L290 TraceCheckUtils]: 16: Hoare triple {49163#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49159#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:28,458 INFO L290 TraceCheckUtils]: 15: Hoare triple {49167#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49163#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:05:28,458 INFO L290 TraceCheckUtils]: 14: Hoare triple {49171#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49167#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:28,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {49175#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49171#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:05:28,459 INFO L290 TraceCheckUtils]: 12: Hoare triple {49179#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49175#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:05:28,460 INFO L290 TraceCheckUtils]: 11: Hoare triple {49183#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49179#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:05:28,461 INFO L290 TraceCheckUtils]: 10: Hoare triple {49187#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49183#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:05:28,461 INFO L290 TraceCheckUtils]: 9: Hoare triple {49191#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49187#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:05:28,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {49195#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49191#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:05:28,463 INFO L290 TraceCheckUtils]: 7: Hoare triple {49199#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49195#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:05:28,463 INFO L290 TraceCheckUtils]: 6: Hoare triple {49203#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {49199#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:05:28,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {48996#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {49203#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:05:28,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {48996#true} call #t~ret13 := main(); {48996#true} is VALID [2022-04-08 10:05:28,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48996#true} {48996#true} #72#return; {48996#true} is VALID [2022-04-08 10:05:28,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {48996#true} assume true; {48996#true} is VALID [2022-04-08 10:05:28,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {48996#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {48996#true} is VALID [2022-04-08 10:05:28,464 INFO L272 TraceCheckUtils]: 0: Hoare triple {48996#true} call ULTIMATE.init(); {48996#true} is VALID [2022-04-08 10:05:28,464 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:05:28,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874934358] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:05:28,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:05:28,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-08 10:05:28,464 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:05:28,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [805798672] [2022-04-08 10:05:28,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [805798672] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:05:28,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:05:28,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 10:05:28,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663195381] [2022-04-08 10:05:28,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:05:28,465 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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 31 [2022-04-08 10:05:28,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:05:28,465 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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-08 10:05:28,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:28,484 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 10:05:28,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:28,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 10:05:28,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=1192, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 10:05:28,484 INFO L87 Difference]: Start difference. First operand 242 states and 326 transitions. Second operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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-08 10:05:33,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:33,952 INFO L93 Difference]: Finished difference Result 427 states and 645 transitions. [2022-04-08 10:05:33,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 10:05:33,952 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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 31 [2022-04-08 10:05:33,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:05:33,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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-08 10:05:33,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 183 transitions. [2022-04-08 10:05:33,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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-08 10:05:33,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 183 transitions. [2022-04-08 10:05:33,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 183 transitions. [2022-04-08 10:05:34,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:34,060 INFO L225 Difference]: With dead ends: 427 [2022-04-08 10:05:34,060 INFO L226 Difference]: Without dead ends: 405 [2022-04-08 10:05:34,060 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=748, Invalid=2558, Unknown=0, NotChecked=0, Total=3306 [2022-04-08 10:05:34,061 INFO L913 BasicCegarLoop]: 81 mSDtfsCounter, 136 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 2486 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 2580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 2486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:05:34,061 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 173 Invalid, 2580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 2486 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-08 10:05:34,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2022-04-08 10:05:34,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 257. [2022-04-08 10:05:34,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:05:34,654 INFO L82 GeneralOperation]: Start isEquivalent. First operand 405 states. Second operand has 257 states, 252 states have (on average 1.3650793650793651) internal successors, (344), 252 states have internal predecessors, (344), 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-08 10:05:34,654 INFO L74 IsIncluded]: Start isIncluded. First operand 405 states. Second operand has 257 states, 252 states have (on average 1.3650793650793651) internal successors, (344), 252 states have internal predecessors, (344), 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-08 10:05:34,654 INFO L87 Difference]: Start difference. First operand 405 states. Second operand has 257 states, 252 states have (on average 1.3650793650793651) internal successors, (344), 252 states have internal predecessors, (344), 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-08 10:05:34,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:34,660 INFO L93 Difference]: Finished difference Result 405 states and 513 transitions. [2022-04-08 10:05:34,660 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 513 transitions. [2022-04-08 10:05:34,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:34,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:34,660 INFO L74 IsIncluded]: Start isIncluded. First operand has 257 states, 252 states have (on average 1.3650793650793651) internal successors, (344), 252 states have internal predecessors, (344), 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 405 states. [2022-04-08 10:05:34,660 INFO L87 Difference]: Start difference. First operand has 257 states, 252 states have (on average 1.3650793650793651) internal successors, (344), 252 states have internal predecessors, (344), 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 405 states. [2022-04-08 10:05:34,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:34,666 INFO L93 Difference]: Finished difference Result 405 states and 513 transitions. [2022-04-08 10:05:34,666 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 513 transitions. [2022-04-08 10:05:34,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:34,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:34,666 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:05:34,666 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:05:34,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 252 states have (on average 1.3650793650793651) internal successors, (344), 252 states have internal predecessors, (344), 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-08 10:05:34,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 348 transitions. [2022-04-08 10:05:34,669 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 348 transitions. Word has length 31 [2022-04-08 10:05:34,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:05:34,669 INFO L478 AbstractCegarLoop]: Abstraction has 257 states and 348 transitions. [2022-04-08 10:05:34,669 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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-08 10:05:34,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 257 states and 348 transitions. [2022-04-08 10:05:35,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 348 edges. 348 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:35,941 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 348 transitions. [2022-04-08 10:05:35,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 10:05:35,942 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:05:35,942 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:05:35,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-04-08 10:05:36,157 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-04-08 10:05:36,157 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:05:36,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:05:36,157 INFO L85 PathProgramCache]: Analyzing trace with hash 561664800, now seen corresponding path program 37 times [2022-04-08 10:05:36,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:36,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1819171934] [2022-04-08 10:05:36,159 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:05:36,160 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:05:36,160 INFO L85 PathProgramCache]: Analyzing trace with hash 561664800, now seen corresponding path program 38 times [2022-04-08 10:05:36,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:05:36,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342342952] [2022-04-08 10:05:36,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:05:36,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:05:36,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:36,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:05:36,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:36,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {51448#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {51438#true} is VALID [2022-04-08 10:05:36,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {51438#true} assume true; {51438#true} is VALID [2022-04-08 10:05:36,280 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {51438#true} {51438#true} #72#return; {51438#true} is VALID [2022-04-08 10:05:36,280 INFO L272 TraceCheckUtils]: 0: Hoare triple {51438#true} call ULTIMATE.init(); {51448#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:05:36,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {51448#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {51438#true} is VALID [2022-04-08 10:05:36,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {51438#true} assume true; {51438#true} is VALID [2022-04-08 10:05:36,280 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51438#true} {51438#true} #72#return; {51438#true} is VALID [2022-04-08 10:05:36,281 INFO L272 TraceCheckUtils]: 4: Hoare triple {51438#true} call #t~ret13 := main(); {51438#true} is VALID [2022-04-08 10:05:36,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {51438#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {51438#true} is VALID [2022-04-08 10:05:36,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {51438#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51438#true} is VALID [2022-04-08 10:05:36,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {51438#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51438#true} is VALID [2022-04-08 10:05:36,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {51438#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51438#true} is VALID [2022-04-08 10:05:36,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {51438#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51438#true} is VALID [2022-04-08 10:05:36,281 INFO L290 TraceCheckUtils]: 10: Hoare triple {51438#true} assume !(~x~0 % 4294967296 > 0); {51443#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:05:36,281 INFO L290 TraceCheckUtils]: 11: Hoare triple {51443#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {51443#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:05:36,282 INFO L290 TraceCheckUtils]: 12: Hoare triple {51443#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51444#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:05:36,283 INFO L290 TraceCheckUtils]: 13: Hoare triple {51444#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51445#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:36,284 INFO L290 TraceCheckUtils]: 14: Hoare triple {51445#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51446#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:36,284 INFO L290 TraceCheckUtils]: 15: Hoare triple {51446#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:36,285 INFO L290 TraceCheckUtils]: 16: Hoare triple {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:36,285 INFO L290 TraceCheckUtils]: 17: Hoare triple {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:36,285 INFO L290 TraceCheckUtils]: 18: Hoare triple {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:36,286 INFO L290 TraceCheckUtils]: 19: Hoare triple {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:36,286 INFO L290 TraceCheckUtils]: 20: Hoare triple {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:36,286 INFO L290 TraceCheckUtils]: 21: Hoare triple {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:36,287 INFO L290 TraceCheckUtils]: 22: Hoare triple {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {51446#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:36,289 INFO L290 TraceCheckUtils]: 23: Hoare triple {51446#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {51445#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:36,290 INFO L290 TraceCheckUtils]: 24: Hoare triple {51445#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {51444#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:05:36,290 INFO L290 TraceCheckUtils]: 25: Hoare triple {51444#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {51443#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:05:36,291 INFO L290 TraceCheckUtils]: 26: Hoare triple {51443#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {51439#false} is VALID [2022-04-08 10:05:36,291 INFO L290 TraceCheckUtils]: 27: Hoare triple {51439#false} assume !(~x~0 % 4294967296 > 0); {51439#false} is VALID [2022-04-08 10:05:36,291 INFO L272 TraceCheckUtils]: 28: Hoare triple {51439#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {51439#false} is VALID [2022-04-08 10:05:36,291 INFO L290 TraceCheckUtils]: 29: Hoare triple {51439#false} ~cond := #in~cond; {51439#false} is VALID [2022-04-08 10:05:36,291 INFO L290 TraceCheckUtils]: 30: Hoare triple {51439#false} assume 0 == ~cond; {51439#false} is VALID [2022-04-08 10:05:36,291 INFO L290 TraceCheckUtils]: 31: Hoare triple {51439#false} assume !false; {51439#false} is VALID [2022-04-08 10:05:36,291 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-08 10:05:36,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:05:36,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342342952] [2022-04-08 10:05:36,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342342952] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:05:36,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580079323] [2022-04-08 10:05:36,291 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:05:36,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:36,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:05:36,292 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:05:36,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-04-08 10:05:36,330 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:05:36,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:05:36,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-08 10:05:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:36,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:05:36,545 INFO L272 TraceCheckUtils]: 0: Hoare triple {51438#true} call ULTIMATE.init(); {51438#true} is VALID [2022-04-08 10:05:36,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {51438#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {51438#true} is VALID [2022-04-08 10:05:36,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {51438#true} assume true; {51438#true} is VALID [2022-04-08 10:05:36,546 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51438#true} {51438#true} #72#return; {51438#true} is VALID [2022-04-08 10:05:36,546 INFO L272 TraceCheckUtils]: 4: Hoare triple {51438#true} call #t~ret13 := main(); {51438#true} is VALID [2022-04-08 10:05:36,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {51438#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {51438#true} is VALID [2022-04-08 10:05:36,546 INFO L290 TraceCheckUtils]: 6: Hoare triple {51438#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51438#true} is VALID [2022-04-08 10:05:36,546 INFO L290 TraceCheckUtils]: 7: Hoare triple {51438#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51438#true} is VALID [2022-04-08 10:05:36,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {51438#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51438#true} is VALID [2022-04-08 10:05:36,546 INFO L290 TraceCheckUtils]: 9: Hoare triple {51438#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51438#true} is VALID [2022-04-08 10:05:36,546 INFO L290 TraceCheckUtils]: 10: Hoare triple {51438#true} assume !(~x~0 % 4294967296 > 0); {51443#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:05:36,547 INFO L290 TraceCheckUtils]: 11: Hoare triple {51443#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {51443#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:05:36,547 INFO L290 TraceCheckUtils]: 12: Hoare triple {51443#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51444#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:05:36,548 INFO L290 TraceCheckUtils]: 13: Hoare triple {51444#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51445#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:36,549 INFO L290 TraceCheckUtils]: 14: Hoare triple {51445#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51446#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:36,550 INFO L290 TraceCheckUtils]: 15: Hoare triple {51446#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:36,550 INFO L290 TraceCheckUtils]: 16: Hoare triple {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:36,550 INFO L290 TraceCheckUtils]: 17: Hoare triple {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:36,551 INFO L290 TraceCheckUtils]: 18: Hoare triple {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:36,551 INFO L290 TraceCheckUtils]: 19: Hoare triple {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:36,551 INFO L290 TraceCheckUtils]: 20: Hoare triple {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:36,552 INFO L290 TraceCheckUtils]: 21: Hoare triple {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:36,552 INFO L290 TraceCheckUtils]: 22: Hoare triple {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {51446#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:36,553 INFO L290 TraceCheckUtils]: 23: Hoare triple {51446#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {51445#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:36,554 INFO L290 TraceCheckUtils]: 24: Hoare triple {51445#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {51444#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:05:36,555 INFO L290 TraceCheckUtils]: 25: Hoare triple {51444#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {51443#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:05:36,555 INFO L290 TraceCheckUtils]: 26: Hoare triple {51443#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {51439#false} is VALID [2022-04-08 10:05:36,555 INFO L290 TraceCheckUtils]: 27: Hoare triple {51439#false} assume !(~x~0 % 4294967296 > 0); {51439#false} is VALID [2022-04-08 10:05:36,555 INFO L272 TraceCheckUtils]: 28: Hoare triple {51439#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {51439#false} is VALID [2022-04-08 10:05:36,555 INFO L290 TraceCheckUtils]: 29: Hoare triple {51439#false} ~cond := #in~cond; {51439#false} is VALID [2022-04-08 10:05:36,555 INFO L290 TraceCheckUtils]: 30: Hoare triple {51439#false} assume 0 == ~cond; {51439#false} is VALID [2022-04-08 10:05:36,555 INFO L290 TraceCheckUtils]: 31: Hoare triple {51439#false} assume !false; {51439#false} is VALID [2022-04-08 10:05:36,555 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-08 10:05:36,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:05:36,742 INFO L290 TraceCheckUtils]: 31: Hoare triple {51439#false} assume !false; {51439#false} is VALID [2022-04-08 10:05:36,742 INFO L290 TraceCheckUtils]: 30: Hoare triple {51439#false} assume 0 == ~cond; {51439#false} is VALID [2022-04-08 10:05:36,742 INFO L290 TraceCheckUtils]: 29: Hoare triple {51439#false} ~cond := #in~cond; {51439#false} is VALID [2022-04-08 10:05:36,742 INFO L272 TraceCheckUtils]: 28: Hoare triple {51439#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {51439#false} is VALID [2022-04-08 10:05:36,742 INFO L290 TraceCheckUtils]: 27: Hoare triple {51439#false} assume !(~x~0 % 4294967296 > 0); {51439#false} is VALID [2022-04-08 10:05:36,743 INFO L290 TraceCheckUtils]: 26: Hoare triple {51443#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {51439#false} is VALID [2022-04-08 10:05:36,744 INFO L290 TraceCheckUtils]: 25: Hoare triple {51444#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {51443#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:05:36,744 INFO L290 TraceCheckUtils]: 24: Hoare triple {51445#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {51444#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:05:36,745 INFO L290 TraceCheckUtils]: 23: Hoare triple {51446#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {51445#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:36,746 INFO L290 TraceCheckUtils]: 22: Hoare triple {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {51446#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:36,746 INFO L290 TraceCheckUtils]: 21: Hoare triple {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:36,747 INFO L290 TraceCheckUtils]: 20: Hoare triple {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:36,747 INFO L290 TraceCheckUtils]: 19: Hoare triple {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:36,747 INFO L290 TraceCheckUtils]: 18: Hoare triple {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:36,748 INFO L290 TraceCheckUtils]: 17: Hoare triple {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:36,748 INFO L290 TraceCheckUtils]: 16: Hoare triple {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:36,749 INFO L290 TraceCheckUtils]: 15: Hoare triple {51446#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51447#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:36,749 INFO L290 TraceCheckUtils]: 14: Hoare triple {51445#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51446#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:36,750 INFO L290 TraceCheckUtils]: 13: Hoare triple {51444#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51445#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:36,750 INFO L290 TraceCheckUtils]: 12: Hoare triple {51443#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51444#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:05:36,751 INFO L290 TraceCheckUtils]: 11: Hoare triple {51443#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {51443#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:05:36,751 INFO L290 TraceCheckUtils]: 10: Hoare triple {51438#true} assume !(~x~0 % 4294967296 > 0); {51443#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:05:36,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {51438#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51438#true} is VALID [2022-04-08 10:05:36,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {51438#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51438#true} is VALID [2022-04-08 10:05:36,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {51438#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51438#true} is VALID [2022-04-08 10:05:36,751 INFO L290 TraceCheckUtils]: 6: Hoare triple {51438#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {51438#true} is VALID [2022-04-08 10:05:36,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {51438#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {51438#true} is VALID [2022-04-08 10:05:36,751 INFO L272 TraceCheckUtils]: 4: Hoare triple {51438#true} call #t~ret13 := main(); {51438#true} is VALID [2022-04-08 10:05:36,751 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51438#true} {51438#true} #72#return; {51438#true} is VALID [2022-04-08 10:05:36,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {51438#true} assume true; {51438#true} is VALID [2022-04-08 10:05:36,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {51438#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {51438#true} is VALID [2022-04-08 10:05:36,752 INFO L272 TraceCheckUtils]: 0: Hoare triple {51438#true} call ULTIMATE.init(); {51438#true} is VALID [2022-04-08 10:05:36,752 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-08 10:05:36,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580079323] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:05:36,752 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:05:36,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 8 [2022-04-08 10:05:36,752 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:05:36,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1819171934] [2022-04-08 10:05:36,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1819171934] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:05:36,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:05:36,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 10:05:36,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648834113] [2022-04-08 10:05:36,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:05:36,753 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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 32 [2022-04-08 10:05:36,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:05:36,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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-08 10:05:36,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:36,776 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 10:05:36,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:36,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 10:05:36,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-08 10:05:36,776 INFO L87 Difference]: Start difference. First operand 257 states and 348 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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-08 10:05:38,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:38,224 INFO L93 Difference]: Finished difference Result 278 states and 370 transitions. [2022-04-08 10:05:38,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 10:05:38,224 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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 32 [2022-04-08 10:05:38,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:05:38,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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-08 10:05:38,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2022-04-08 10:05:38,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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-08 10:05:38,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2022-04-08 10:05:38,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 51 transitions. [2022-04-08 10:05:38,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:38,261 INFO L225 Difference]: With dead ends: 278 [2022-04-08 10:05:38,261 INFO L226 Difference]: Without dead ends: 256 [2022-04-08 10:05:38,262 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-08 10:05:38,262 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 36 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:05:38,262 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 55 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:05:38,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-04-08 10:05:38,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 252. [2022-04-08 10:05:38,912 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:05:38,915 INFO L82 GeneralOperation]: Start isEquivalent. First operand 256 states. Second operand has 252 states, 247 states have (on average 1.368421052631579) internal successors, (338), 247 states have internal predecessors, (338), 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-08 10:05:38,915 INFO L74 IsIncluded]: Start isIncluded. First operand 256 states. Second operand has 252 states, 247 states have (on average 1.368421052631579) internal successors, (338), 247 states have internal predecessors, (338), 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-08 10:05:38,915 INFO L87 Difference]: Start difference. First operand 256 states. Second operand has 252 states, 247 states have (on average 1.368421052631579) internal successors, (338), 247 states have internal predecessors, (338), 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-08 10:05:38,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:38,918 INFO L93 Difference]: Finished difference Result 256 states and 346 transitions. [2022-04-08 10:05:38,918 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 346 transitions. [2022-04-08 10:05:38,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:38,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:38,918 INFO L74 IsIncluded]: Start isIncluded. First operand has 252 states, 247 states have (on average 1.368421052631579) internal successors, (338), 247 states have internal predecessors, (338), 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 256 states. [2022-04-08 10:05:38,918 INFO L87 Difference]: Start difference. First operand has 252 states, 247 states have (on average 1.368421052631579) internal successors, (338), 247 states have internal predecessors, (338), 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 256 states. [2022-04-08 10:05:38,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:38,921 INFO L93 Difference]: Finished difference Result 256 states and 346 transitions. [2022-04-08 10:05:38,921 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 346 transitions. [2022-04-08 10:05:38,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:38,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:38,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:05:38,921 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:05:38,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 247 states have (on average 1.368421052631579) internal successors, (338), 247 states have internal predecessors, (338), 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-08 10:05:38,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 342 transitions. [2022-04-08 10:05:38,930 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 342 transitions. Word has length 32 [2022-04-08 10:05:38,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:05:38,930 INFO L478 AbstractCegarLoop]: Abstraction has 252 states and 342 transitions. [2022-04-08 10:05:38,930 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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-08 10:05:38,930 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 252 states and 342 transitions. [2022-04-08 10:05:41,110 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 342 edges. 342 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:41,111 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 342 transitions. [2022-04-08 10:05:41,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 10:05:41,111 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:05:41,111 INFO L499 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:05:41,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2022-04-08 10:05:41,329 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-04-08 10:05:41,329 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:05:41,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:05:41,330 INFO L85 PathProgramCache]: Analyzing trace with hash 336197729, now seen corresponding path program 33 times [2022-04-08 10:05:41,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:41,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1277632388] [2022-04-08 10:05:41,331 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:05:41,332 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:05:41,332 INFO L85 PathProgramCache]: Analyzing trace with hash 336197729, now seen corresponding path program 34 times [2022-04-08 10:05:41,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:05:41,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493852875] [2022-04-08 10:05:41,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:05:41,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:05:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:41,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:05:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:41,674 INFO L290 TraceCheckUtils]: 0: Hoare triple {53246#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {53222#true} is VALID [2022-04-08 10:05:41,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {53222#true} assume true; {53222#true} is VALID [2022-04-08 10:05:41,674 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {53222#true} {53222#true} #72#return; {53222#true} is VALID [2022-04-08 10:05:41,674 INFO L272 TraceCheckUtils]: 0: Hoare triple {53222#true} call ULTIMATE.init(); {53246#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:05:41,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {53246#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {53222#true} is VALID [2022-04-08 10:05:41,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {53222#true} assume true; {53222#true} is VALID [2022-04-08 10:05:41,674 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53222#true} {53222#true} #72#return; {53222#true} is VALID [2022-04-08 10:05:41,674 INFO L272 TraceCheckUtils]: 4: Hoare triple {53222#true} call #t~ret13 := main(); {53222#true} is VALID [2022-04-08 10:05:41,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {53222#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {53227#(= main_~y~0 0)} is VALID [2022-04-08 10:05:41,675 INFO L290 TraceCheckUtils]: 6: Hoare triple {53227#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53228#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:41,676 INFO L290 TraceCheckUtils]: 7: Hoare triple {53228#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53229#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:41,676 INFO L290 TraceCheckUtils]: 8: Hoare triple {53229#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53230#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:41,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {53230#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53231#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:41,677 INFO L290 TraceCheckUtils]: 10: Hoare triple {53231#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53232#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:41,678 INFO L290 TraceCheckUtils]: 11: Hoare triple {53232#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53233#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:41,678 INFO L290 TraceCheckUtils]: 12: Hoare triple {53233#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53234#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:41,679 INFO L290 TraceCheckUtils]: 13: Hoare triple {53234#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53235#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:41,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {53235#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53236#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:41,680 INFO L290 TraceCheckUtils]: 15: Hoare triple {53236#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53237#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:05:41,680 INFO L290 TraceCheckUtils]: 16: Hoare triple {53237#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53238#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:05:41,681 INFO L290 TraceCheckUtils]: 17: Hoare triple {53238#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53239#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:05:41,681 INFO L290 TraceCheckUtils]: 18: Hoare triple {53239#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53240#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:05:41,681 INFO L290 TraceCheckUtils]: 19: Hoare triple {53240#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53241#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:05:41,682 INFO L290 TraceCheckUtils]: 20: Hoare triple {53241#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53242#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:05:41,682 INFO L290 TraceCheckUtils]: 21: Hoare triple {53242#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53243#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:05:41,683 INFO L290 TraceCheckUtils]: 22: Hoare triple {53243#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53244#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:05:41,683 INFO L290 TraceCheckUtils]: 23: Hoare triple {53244#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {53244#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:05:41,684 INFO L290 TraceCheckUtils]: 24: Hoare triple {53244#(and (<= main_~y~0 17) (<= 17 main_~y~0))} ~z~0 := ~y~0; {53245#(and (<= (div main_~z~0 4294967296) 0) (<= 17 main_~z~0))} is VALID [2022-04-08 10:05:41,684 INFO L290 TraceCheckUtils]: 25: Hoare triple {53245#(and (<= (div main_~z~0 4294967296) 0) (<= 17 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {53223#false} is VALID [2022-04-08 10:05:41,684 INFO L290 TraceCheckUtils]: 26: Hoare triple {53223#false} assume !(~y~0 % 4294967296 > 0); {53223#false} is VALID [2022-04-08 10:05:41,684 INFO L290 TraceCheckUtils]: 27: Hoare triple {53223#false} assume !(~x~0 % 4294967296 > 0); {53223#false} is VALID [2022-04-08 10:05:41,684 INFO L272 TraceCheckUtils]: 28: Hoare triple {53223#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {53223#false} is VALID [2022-04-08 10:05:41,684 INFO L290 TraceCheckUtils]: 29: Hoare triple {53223#false} ~cond := #in~cond; {53223#false} is VALID [2022-04-08 10:05:41,684 INFO L290 TraceCheckUtils]: 30: Hoare triple {53223#false} assume 0 == ~cond; {53223#false} is VALID [2022-04-08 10:05:41,684 INFO L290 TraceCheckUtils]: 31: Hoare triple {53223#false} assume !false; {53223#false} is VALID [2022-04-08 10:05:41,685 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:05:41,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:05:41,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493852875] [2022-04-08 10:05:41,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493852875] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:05:41,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620942311] [2022-04-08 10:05:41,685 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:05:41,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:41,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:05:41,691 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:05:41,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-04-08 10:05:41,731 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:05:41,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:05:41,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-08 10:05:41,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:41,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:05:42,039 INFO L272 TraceCheckUtils]: 0: Hoare triple {53222#true} call ULTIMATE.init(); {53222#true} is VALID [2022-04-08 10:05:42,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {53222#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {53222#true} is VALID [2022-04-08 10:05:42,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {53222#true} assume true; {53222#true} is VALID [2022-04-08 10:05:42,040 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53222#true} {53222#true} #72#return; {53222#true} is VALID [2022-04-08 10:05:42,040 INFO L272 TraceCheckUtils]: 4: Hoare triple {53222#true} call #t~ret13 := main(); {53222#true} is VALID [2022-04-08 10:05:42,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {53222#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {53227#(= main_~y~0 0)} is VALID [2022-04-08 10:05:42,040 INFO L290 TraceCheckUtils]: 6: Hoare triple {53227#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53228#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:42,041 INFO L290 TraceCheckUtils]: 7: Hoare triple {53228#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53229#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:42,041 INFO L290 TraceCheckUtils]: 8: Hoare triple {53229#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53230#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:42,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {53230#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53231#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:42,042 INFO L290 TraceCheckUtils]: 10: Hoare triple {53231#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53232#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:42,043 INFO L290 TraceCheckUtils]: 11: Hoare triple {53232#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53233#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:42,043 INFO L290 TraceCheckUtils]: 12: Hoare triple {53233#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53234#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:05:42,044 INFO L290 TraceCheckUtils]: 13: Hoare triple {53234#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53235#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:05:42,044 INFO L290 TraceCheckUtils]: 14: Hoare triple {53235#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53236#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:05:42,045 INFO L290 TraceCheckUtils]: 15: Hoare triple {53236#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53237#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:05:42,045 INFO L290 TraceCheckUtils]: 16: Hoare triple {53237#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53238#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:05:42,046 INFO L290 TraceCheckUtils]: 17: Hoare triple {53238#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53239#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:05:42,046 INFO L290 TraceCheckUtils]: 18: Hoare triple {53239#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53240#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:05:42,047 INFO L290 TraceCheckUtils]: 19: Hoare triple {53240#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53241#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:05:42,047 INFO L290 TraceCheckUtils]: 20: Hoare triple {53241#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53242#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:05:42,048 INFO L290 TraceCheckUtils]: 21: Hoare triple {53242#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53243#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:05:42,048 INFO L290 TraceCheckUtils]: 22: Hoare triple {53243#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53244#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:05:42,048 INFO L290 TraceCheckUtils]: 23: Hoare triple {53244#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {53244#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:05:42,049 INFO L290 TraceCheckUtils]: 24: Hoare triple {53244#(and (<= main_~y~0 17) (<= 17 main_~y~0))} ~z~0 := ~y~0; {53322#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-08 10:05:42,049 INFO L290 TraceCheckUtils]: 25: Hoare triple {53322#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !(~z~0 % 4294967296 > 0); {53223#false} is VALID [2022-04-08 10:05:42,049 INFO L290 TraceCheckUtils]: 26: Hoare triple {53223#false} assume !(~y~0 % 4294967296 > 0); {53223#false} is VALID [2022-04-08 10:05:42,049 INFO L290 TraceCheckUtils]: 27: Hoare triple {53223#false} assume !(~x~0 % 4294967296 > 0); {53223#false} is VALID [2022-04-08 10:05:42,049 INFO L272 TraceCheckUtils]: 28: Hoare triple {53223#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {53223#false} is VALID [2022-04-08 10:05:42,049 INFO L290 TraceCheckUtils]: 29: Hoare triple {53223#false} ~cond := #in~cond; {53223#false} is VALID [2022-04-08 10:05:42,049 INFO L290 TraceCheckUtils]: 30: Hoare triple {53223#false} assume 0 == ~cond; {53223#false} is VALID [2022-04-08 10:05:42,050 INFO L290 TraceCheckUtils]: 31: Hoare triple {53223#false} assume !false; {53223#false} is VALID [2022-04-08 10:05:42,050 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:05:42,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:05:42,643 INFO L290 TraceCheckUtils]: 31: Hoare triple {53223#false} assume !false; {53223#false} is VALID [2022-04-08 10:05:42,643 INFO L290 TraceCheckUtils]: 30: Hoare triple {53223#false} assume 0 == ~cond; {53223#false} is VALID [2022-04-08 10:05:42,643 INFO L290 TraceCheckUtils]: 29: Hoare triple {53223#false} ~cond := #in~cond; {53223#false} is VALID [2022-04-08 10:05:42,643 INFO L272 TraceCheckUtils]: 28: Hoare triple {53223#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {53223#false} is VALID [2022-04-08 10:05:42,643 INFO L290 TraceCheckUtils]: 27: Hoare triple {53223#false} assume !(~x~0 % 4294967296 > 0); {53223#false} is VALID [2022-04-08 10:05:42,643 INFO L290 TraceCheckUtils]: 26: Hoare triple {53223#false} assume !(~y~0 % 4294967296 > 0); {53223#false} is VALID [2022-04-08 10:05:42,643 INFO L290 TraceCheckUtils]: 25: Hoare triple {53362#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {53223#false} is VALID [2022-04-08 10:05:42,644 INFO L290 TraceCheckUtils]: 24: Hoare triple {53366#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {53362#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:05:42,644 INFO L290 TraceCheckUtils]: 23: Hoare triple {53366#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {53366#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:05:42,645 INFO L290 TraceCheckUtils]: 22: Hoare triple {53373#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53366#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:05:42,645 INFO L290 TraceCheckUtils]: 21: Hoare triple {53377#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53373#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:05:42,646 INFO L290 TraceCheckUtils]: 20: Hoare triple {53381#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53377#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:05:42,647 INFO L290 TraceCheckUtils]: 19: Hoare triple {53385#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53381#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:05:42,647 INFO L290 TraceCheckUtils]: 18: Hoare triple {53389#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53385#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:05:42,648 INFO L290 TraceCheckUtils]: 17: Hoare triple {53393#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53389#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:42,648 INFO L290 TraceCheckUtils]: 16: Hoare triple {53397#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53393#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:05:42,649 INFO L290 TraceCheckUtils]: 15: Hoare triple {53401#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53397#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:05:42,650 INFO L290 TraceCheckUtils]: 14: Hoare triple {53405#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53401#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:05:42,650 INFO L290 TraceCheckUtils]: 13: Hoare triple {53409#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53405#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:05:42,651 INFO L290 TraceCheckUtils]: 12: Hoare triple {53413#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53409#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:05:42,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {53417#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53413#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:05:42,652 INFO L290 TraceCheckUtils]: 10: Hoare triple {53421#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53417#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:05:42,653 INFO L290 TraceCheckUtils]: 9: Hoare triple {53425#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53421#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:05:42,653 INFO L290 TraceCheckUtils]: 8: Hoare triple {53429#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53425#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:05:42,654 INFO L290 TraceCheckUtils]: 7: Hoare triple {53433#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53429#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:05:42,654 INFO L290 TraceCheckUtils]: 6: Hoare triple {53437#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {53433#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:05:42,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {53222#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {53437#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:05:42,655 INFO L272 TraceCheckUtils]: 4: Hoare triple {53222#true} call #t~ret13 := main(); {53222#true} is VALID [2022-04-08 10:05:42,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53222#true} {53222#true} #72#return; {53222#true} is VALID [2022-04-08 10:05:42,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {53222#true} assume true; {53222#true} is VALID [2022-04-08 10:05:42,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {53222#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {53222#true} is VALID [2022-04-08 10:05:42,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {53222#true} call ULTIMATE.init(); {53222#true} is VALID [2022-04-08 10:05:42,655 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:05:42,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620942311] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:05:42,655 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:05:42,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-08 10:05:42,656 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:05:42,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1277632388] [2022-04-08 10:05:42,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1277632388] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:05:42,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:05:42,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 10:05:42,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128248778] [2022-04-08 10:05:42,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:05:42,656 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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 32 [2022-04-08 10:05:42,656 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:05:42,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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-08 10:05:42,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:42,675 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 10:05:42,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:42,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 10:05:42,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=1315, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 10:05:42,676 INFO L87 Difference]: Start difference. First operand 252 states and 342 transitions. Second operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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-08 10:05:47,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:47,449 INFO L93 Difference]: Finished difference Result 447 states and 678 transitions. [2022-04-08 10:05:47,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 10:05:47,449 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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 32 [2022-04-08 10:05:47,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:05:47,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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-08 10:05:47,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 189 transitions. [2022-04-08 10:05:47,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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-08 10:05:47,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 189 transitions. [2022-04-08 10:05:47,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 189 transitions. [2022-04-08 10:05:47,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:47,554 INFO L225 Difference]: With dead ends: 447 [2022-04-08 10:05:47,554 INFO L226 Difference]: Without dead ends: 424 [2022-04-08 10:05:47,554 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=827, Invalid=2833, Unknown=0, NotChecked=0, Total=3660 [2022-04-08 10:05:47,555 INFO L913 BasicCegarLoop]: 83 mSDtfsCounter, 140 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 2720 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 2820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 2720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:05:47,555 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 180 Invalid, 2820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 2720 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-08 10:05:47,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2022-04-08 10:05:48,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 267. [2022-04-08 10:05:48,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:05:48,235 INFO L82 GeneralOperation]: Start isEquivalent. First operand 424 states. Second operand has 267 states, 262 states have (on average 1.3740458015267176) internal successors, (360), 262 states have internal predecessors, (360), 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-08 10:05:48,236 INFO L74 IsIncluded]: Start isIncluded. First operand 424 states. Second operand has 267 states, 262 states have (on average 1.3740458015267176) internal successors, (360), 262 states have internal predecessors, (360), 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-08 10:05:48,236 INFO L87 Difference]: Start difference. First operand 424 states. Second operand has 267 states, 262 states have (on average 1.3740458015267176) internal successors, (360), 262 states have internal predecessors, (360), 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-08 10:05:48,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:48,242 INFO L93 Difference]: Finished difference Result 424 states and 539 transitions. [2022-04-08 10:05:48,242 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 539 transitions. [2022-04-08 10:05:48,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:48,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:48,242 INFO L74 IsIncluded]: Start isIncluded. First operand has 267 states, 262 states have (on average 1.3740458015267176) internal successors, (360), 262 states have internal predecessors, (360), 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 424 states. [2022-04-08 10:05:48,242 INFO L87 Difference]: Start difference. First operand has 267 states, 262 states have (on average 1.3740458015267176) internal successors, (360), 262 states have internal predecessors, (360), 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 424 states. [2022-04-08 10:05:48,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:48,248 INFO L93 Difference]: Finished difference Result 424 states and 539 transitions. [2022-04-08 10:05:48,248 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 539 transitions. [2022-04-08 10:05:48,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:48,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:48,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:05:48,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:05:48,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 262 states have (on average 1.3740458015267176) internal successors, (360), 262 states have internal predecessors, (360), 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-08 10:05:48,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 364 transitions. [2022-04-08 10:05:48,252 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 364 transitions. Word has length 32 [2022-04-08 10:05:48,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:05:48,252 INFO L478 AbstractCegarLoop]: Abstraction has 267 states and 364 transitions. [2022-04-08 10:05:48,252 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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-08 10:05:48,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 267 states and 364 transitions. [2022-04-08 10:05:49,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 364 edges. 364 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:49,261 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 364 transitions. [2022-04-08 10:05:49,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 10:05:49,261 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:05:49,261 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:05:49,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-04-08 10:05:49,477 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:49,477 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:05:49,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:05:49,478 INFO L85 PathProgramCache]: Analyzing trace with hash 2019384376, now seen corresponding path program 39 times [2022-04-08 10:05:49,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:49,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1009513007] [2022-04-08 10:05:49,480 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:05:49,480 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:05:49,480 INFO L85 PathProgramCache]: Analyzing trace with hash 2019384376, now seen corresponding path program 40 times [2022-04-08 10:05:49,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:05:49,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600672531] [2022-04-08 10:05:49,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:05:49,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:05:49,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:49,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:05:49,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:49,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {55788#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {55772#true} is VALID [2022-04-08 10:05:49,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {55772#true} assume true; {55772#true} is VALID [2022-04-08 10:05:49,644 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55772#true} {55772#true} #72#return; {55772#true} is VALID [2022-04-08 10:05:49,644 INFO L272 TraceCheckUtils]: 0: Hoare triple {55772#true} call ULTIMATE.init(); {55788#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:05:49,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {55788#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {55772#true} is VALID [2022-04-08 10:05:49,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {55772#true} assume true; {55772#true} is VALID [2022-04-08 10:05:49,645 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55772#true} {55772#true} #72#return; {55772#true} is VALID [2022-04-08 10:05:49,645 INFO L272 TraceCheckUtils]: 4: Hoare triple {55772#true} call #t~ret13 := main(); {55772#true} is VALID [2022-04-08 10:05:49,645 INFO L290 TraceCheckUtils]: 5: Hoare triple {55772#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {55777#(= main_~y~0 0)} is VALID [2022-04-08 10:05:49,645 INFO L290 TraceCheckUtils]: 6: Hoare triple {55777#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55778#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:49,646 INFO L290 TraceCheckUtils]: 7: Hoare triple {55778#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55779#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:49,646 INFO L290 TraceCheckUtils]: 8: Hoare triple {55779#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55780#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:49,646 INFO L290 TraceCheckUtils]: 9: Hoare triple {55780#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55781#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:49,647 INFO L290 TraceCheckUtils]: 10: Hoare triple {55781#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55782#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:49,647 INFO L290 TraceCheckUtils]: 11: Hoare triple {55782#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55783#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:49,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {55783#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {55783#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:49,648 INFO L290 TraceCheckUtils]: 13: Hoare triple {55783#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {55784#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:05:49,648 INFO L290 TraceCheckUtils]: 14: Hoare triple {55784#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55785#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:05:49,649 INFO L290 TraceCheckUtils]: 15: Hoare triple {55785#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55786#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:05:49,649 INFO L290 TraceCheckUtils]: 16: Hoare triple {55786#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55787#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:05:49,650 INFO L290 TraceCheckUtils]: 17: Hoare triple {55787#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {55773#false} is VALID [2022-04-08 10:05:49,650 INFO L290 TraceCheckUtils]: 18: Hoare triple {55773#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55773#false} is VALID [2022-04-08 10:05:49,650 INFO L290 TraceCheckUtils]: 19: Hoare triple {55773#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55773#false} is VALID [2022-04-08 10:05:49,650 INFO L290 TraceCheckUtils]: 20: Hoare triple {55773#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55773#false} is VALID [2022-04-08 10:05:49,650 INFO L290 TraceCheckUtils]: 21: Hoare triple {55773#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55773#false} is VALID [2022-04-08 10:05:49,650 INFO L290 TraceCheckUtils]: 22: Hoare triple {55773#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55773#false} is VALID [2022-04-08 10:05:49,650 INFO L290 TraceCheckUtils]: 23: Hoare triple {55773#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55773#false} is VALID [2022-04-08 10:05:49,650 INFO L290 TraceCheckUtils]: 24: Hoare triple {55773#false} assume !(~y~0 % 4294967296 > 0); {55773#false} is VALID [2022-04-08 10:05:49,650 INFO L290 TraceCheckUtils]: 25: Hoare triple {55773#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {55773#false} is VALID [2022-04-08 10:05:49,650 INFO L290 TraceCheckUtils]: 26: Hoare triple {55773#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {55773#false} is VALID [2022-04-08 10:05:49,650 INFO L290 TraceCheckUtils]: 27: Hoare triple {55773#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {55773#false} is VALID [2022-04-08 10:05:49,650 INFO L290 TraceCheckUtils]: 28: Hoare triple {55773#false} assume !(~x~0 % 4294967296 > 0); {55773#false} is VALID [2022-04-08 10:05:49,650 INFO L272 TraceCheckUtils]: 29: Hoare triple {55773#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {55773#false} is VALID [2022-04-08 10:05:49,650 INFO L290 TraceCheckUtils]: 30: Hoare triple {55773#false} ~cond := #in~cond; {55773#false} is VALID [2022-04-08 10:05:49,650 INFO L290 TraceCheckUtils]: 31: Hoare triple {55773#false} assume 0 == ~cond; {55773#false} is VALID [2022-04-08 10:05:49,650 INFO L290 TraceCheckUtils]: 32: Hoare triple {55773#false} assume !false; {55773#false} is VALID [2022-04-08 10:05:49,650 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-08 10:05:49,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:05:49,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600672531] [2022-04-08 10:05:49,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600672531] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:05:49,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479268622] [2022-04-08 10:05:49,651 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:05:49,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:49,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:05:49,652 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:05:49,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-04-08 10:05:49,698 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:05:49,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:05:49,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-08 10:05:49,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:49,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:05:49,856 INFO L272 TraceCheckUtils]: 0: Hoare triple {55772#true} call ULTIMATE.init(); {55772#true} is VALID [2022-04-08 10:05:49,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {55772#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {55772#true} is VALID [2022-04-08 10:05:49,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {55772#true} assume true; {55772#true} is VALID [2022-04-08 10:05:49,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55772#true} {55772#true} #72#return; {55772#true} is VALID [2022-04-08 10:05:49,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {55772#true} call #t~ret13 := main(); {55772#true} is VALID [2022-04-08 10:05:49,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {55772#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {55777#(= main_~y~0 0)} is VALID [2022-04-08 10:05:49,857 INFO L290 TraceCheckUtils]: 6: Hoare triple {55777#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55778#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:05:49,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {55778#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55779#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:05:49,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {55779#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55780#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:05:49,859 INFO L290 TraceCheckUtils]: 9: Hoare triple {55780#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55781#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:05:49,859 INFO L290 TraceCheckUtils]: 10: Hoare triple {55781#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55782#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:05:49,859 INFO L290 TraceCheckUtils]: 11: Hoare triple {55782#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55783#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:49,860 INFO L290 TraceCheckUtils]: 12: Hoare triple {55783#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {55783#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:49,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {55783#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {55831#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:49,860 INFO L290 TraceCheckUtils]: 14: Hoare triple {55831#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55835#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:05:49,861 INFO L290 TraceCheckUtils]: 15: Hoare triple {55835#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55839#(and (<= main_~y~0 6) (= main_~y~0 (+ main_~z~0 2)) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:49,861 INFO L290 TraceCheckUtils]: 16: Hoare triple {55839#(and (<= main_~y~0 6) (= main_~y~0 (+ main_~z~0 2)) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55843#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:05:49,874 INFO L290 TraceCheckUtils]: 17: Hoare triple {55843#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {55773#false} is VALID [2022-04-08 10:05:49,874 INFO L290 TraceCheckUtils]: 18: Hoare triple {55773#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55773#false} is VALID [2022-04-08 10:05:49,874 INFO L290 TraceCheckUtils]: 19: Hoare triple {55773#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55773#false} is VALID [2022-04-08 10:05:49,874 INFO L290 TraceCheckUtils]: 20: Hoare triple {55773#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55773#false} is VALID [2022-04-08 10:05:49,874 INFO L290 TraceCheckUtils]: 21: Hoare triple {55773#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55773#false} is VALID [2022-04-08 10:05:49,874 INFO L290 TraceCheckUtils]: 22: Hoare triple {55773#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55773#false} is VALID [2022-04-08 10:05:49,874 INFO L290 TraceCheckUtils]: 23: Hoare triple {55773#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55773#false} is VALID [2022-04-08 10:05:49,874 INFO L290 TraceCheckUtils]: 24: Hoare triple {55773#false} assume !(~y~0 % 4294967296 > 0); {55773#false} is VALID [2022-04-08 10:05:49,874 INFO L290 TraceCheckUtils]: 25: Hoare triple {55773#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {55773#false} is VALID [2022-04-08 10:05:49,874 INFO L290 TraceCheckUtils]: 26: Hoare triple {55773#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {55773#false} is VALID [2022-04-08 10:05:49,874 INFO L290 TraceCheckUtils]: 27: Hoare triple {55773#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {55773#false} is VALID [2022-04-08 10:05:49,874 INFO L290 TraceCheckUtils]: 28: Hoare triple {55773#false} assume !(~x~0 % 4294967296 > 0); {55773#false} is VALID [2022-04-08 10:05:49,874 INFO L272 TraceCheckUtils]: 29: Hoare triple {55773#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {55773#false} is VALID [2022-04-08 10:05:49,875 INFO L290 TraceCheckUtils]: 30: Hoare triple {55773#false} ~cond := #in~cond; {55773#false} is VALID [2022-04-08 10:05:49,875 INFO L290 TraceCheckUtils]: 31: Hoare triple {55773#false} assume 0 == ~cond; {55773#false} is VALID [2022-04-08 10:05:49,875 INFO L290 TraceCheckUtils]: 32: Hoare triple {55773#false} assume !false; {55773#false} is VALID [2022-04-08 10:05:49,875 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-08 10:05:49,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:05:50,064 INFO L290 TraceCheckUtils]: 32: Hoare triple {55773#false} assume !false; {55773#false} is VALID [2022-04-08 10:05:50,064 INFO L290 TraceCheckUtils]: 31: Hoare triple {55773#false} assume 0 == ~cond; {55773#false} is VALID [2022-04-08 10:05:50,064 INFO L290 TraceCheckUtils]: 30: Hoare triple {55773#false} ~cond := #in~cond; {55773#false} is VALID [2022-04-08 10:05:50,064 INFO L272 TraceCheckUtils]: 29: Hoare triple {55773#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {55773#false} is VALID [2022-04-08 10:05:50,064 INFO L290 TraceCheckUtils]: 28: Hoare triple {55773#false} assume !(~x~0 % 4294967296 > 0); {55773#false} is VALID [2022-04-08 10:05:50,064 INFO L290 TraceCheckUtils]: 27: Hoare triple {55773#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {55773#false} is VALID [2022-04-08 10:05:50,065 INFO L290 TraceCheckUtils]: 26: Hoare triple {55773#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {55773#false} is VALID [2022-04-08 10:05:50,065 INFO L290 TraceCheckUtils]: 25: Hoare triple {55773#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {55773#false} is VALID [2022-04-08 10:05:50,065 INFO L290 TraceCheckUtils]: 24: Hoare triple {55773#false} assume !(~y~0 % 4294967296 > 0); {55773#false} is VALID [2022-04-08 10:05:50,065 INFO L290 TraceCheckUtils]: 23: Hoare triple {55773#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55773#false} is VALID [2022-04-08 10:05:50,065 INFO L290 TraceCheckUtils]: 22: Hoare triple {55773#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55773#false} is VALID [2022-04-08 10:05:50,065 INFO L290 TraceCheckUtils]: 21: Hoare triple {55925#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55773#false} is VALID [2022-04-08 10:05:50,066 INFO L290 TraceCheckUtils]: 20: Hoare triple {55929#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55925#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:05:50,066 INFO L290 TraceCheckUtils]: 19: Hoare triple {55933#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55929#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:05:50,067 INFO L290 TraceCheckUtils]: 18: Hoare triple {55937#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {55933#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:05:50,067 INFO L290 TraceCheckUtils]: 17: Hoare triple {55941#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {55937#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:05:50,068 INFO L290 TraceCheckUtils]: 16: Hoare triple {55945#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55941#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-08 10:05:50,069 INFO L290 TraceCheckUtils]: 15: Hoare triple {55949#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55945#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:05:50,069 INFO L290 TraceCheckUtils]: 14: Hoare triple {55953#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55949#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-08 10:05:50,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {55772#true} ~z~0 := ~y~0; {55953#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:05:50,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {55772#true} assume !(~x~0 % 4294967296 > 0); {55772#true} is VALID [2022-04-08 10:05:50,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {55772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55772#true} is VALID [2022-04-08 10:05:50,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {55772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55772#true} is VALID [2022-04-08 10:05:50,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {55772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55772#true} is VALID [2022-04-08 10:05:50,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {55772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55772#true} is VALID [2022-04-08 10:05:50,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {55772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55772#true} is VALID [2022-04-08 10:05:50,070 INFO L290 TraceCheckUtils]: 6: Hoare triple {55772#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {55772#true} is VALID [2022-04-08 10:05:50,070 INFO L290 TraceCheckUtils]: 5: Hoare triple {55772#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {55772#true} is VALID [2022-04-08 10:05:50,070 INFO L272 TraceCheckUtils]: 4: Hoare triple {55772#true} call #t~ret13 := main(); {55772#true} is VALID [2022-04-08 10:05:50,070 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55772#true} {55772#true} #72#return; {55772#true} is VALID [2022-04-08 10:05:50,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {55772#true} assume true; {55772#true} is VALID [2022-04-08 10:05:50,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {55772#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {55772#true} is VALID [2022-04-08 10:05:50,070 INFO L272 TraceCheckUtils]: 0: Hoare triple {55772#true} call ULTIMATE.init(); {55772#true} is VALID [2022-04-08 10:05:50,070 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-08 10:05:50,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479268622] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:05:50,071 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:05:50,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 10] total 26 [2022-04-08 10:05:50,071 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:05:50,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1009513007] [2022-04-08 10:05:50,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1009513007] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:05:50,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:05:50,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 10:05:50,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861603835] [2022-04-08 10:05:50,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:05:50,071 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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 33 [2022-04-08 10:05:50,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:05:50,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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-08 10:05:50,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:50,085 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 10:05:50,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:50,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 10:05:50,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2022-04-08 10:05:50,086 INFO L87 Difference]: Start difference. First operand 267 states and 364 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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-08 10:05:51,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:51,821 INFO L93 Difference]: Finished difference Result 328 states and 431 transitions. [2022-04-08 10:05:51,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 10:05:51,821 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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 33 [2022-04-08 10:05:51,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:05:51,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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-08 10:05:51,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 78 transitions. [2022-04-08 10:05:51,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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-08 10:05:51,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 78 transitions. [2022-04-08 10:05:51,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 78 transitions. [2022-04-08 10:05:51,873 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:51,876 INFO L225 Difference]: With dead ends: 328 [2022-04-08 10:05:51,876 INFO L226 Difference]: Without dead ends: 312 [2022-04-08 10:05:51,877 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=222, Invalid=1338, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 10:05:51,877 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 34 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:05:51,877 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 76 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:05:51,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-04-08 10:05:52,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 267. [2022-04-08 10:05:52,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:05:52,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 312 states. Second operand has 267 states, 262 states have (on average 1.3702290076335877) internal successors, (359), 262 states have internal predecessors, (359), 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-08 10:05:52,558 INFO L74 IsIncluded]: Start isIncluded. First operand 312 states. Second operand has 267 states, 262 states have (on average 1.3702290076335877) internal successors, (359), 262 states have internal predecessors, (359), 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-08 10:05:52,558 INFO L87 Difference]: Start difference. First operand 312 states. Second operand has 267 states, 262 states have (on average 1.3702290076335877) internal successors, (359), 262 states have internal predecessors, (359), 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-08 10:05:52,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:52,561 INFO L93 Difference]: Finished difference Result 312 states and 415 transitions. [2022-04-08 10:05:52,561 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 415 transitions. [2022-04-08 10:05:52,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:52,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:52,562 INFO L74 IsIncluded]: Start isIncluded. First operand has 267 states, 262 states have (on average 1.3702290076335877) internal successors, (359), 262 states have internal predecessors, (359), 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 312 states. [2022-04-08 10:05:52,562 INFO L87 Difference]: Start difference. First operand has 267 states, 262 states have (on average 1.3702290076335877) internal successors, (359), 262 states have internal predecessors, (359), 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 312 states. [2022-04-08 10:05:52,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:52,565 INFO L93 Difference]: Finished difference Result 312 states and 415 transitions. [2022-04-08 10:05:52,565 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 415 transitions. [2022-04-08 10:05:52,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:52,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:52,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:05:52,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:05:52,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 262 states have (on average 1.3702290076335877) internal successors, (359), 262 states have internal predecessors, (359), 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-08 10:05:52,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 363 transitions. [2022-04-08 10:05:52,569 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 363 transitions. Word has length 33 [2022-04-08 10:05:52,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:05:52,569 INFO L478 AbstractCegarLoop]: Abstraction has 267 states and 363 transitions. [2022-04-08 10:05:52,569 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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-08 10:05:52,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 267 states and 363 transitions. [2022-04-08 10:05:53,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 363 edges. 363 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:53,728 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 363 transitions. [2022-04-08 10:05:53,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 10:05:53,728 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:05:53,728 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:05:53,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-04-08 10:05:53,928 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-04-08 10:05:53,929 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:05:53,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:05:53,929 INFO L85 PathProgramCache]: Analyzing trace with hash -475206312, now seen corresponding path program 21 times [2022-04-08 10:05:53,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:53,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [963388996] [2022-04-08 10:05:53,931 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:05:53,931 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:05:53,931 INFO L85 PathProgramCache]: Analyzing trace with hash -475206312, now seen corresponding path program 22 times [2022-04-08 10:05:53,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:05:53,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787204741] [2022-04-08 10:05:53,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:05:53,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:05:53,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:54,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:05:54,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:54,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {57857#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {57840#true} is VALID [2022-04-08 10:05:54,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {57840#true} assume true; {57840#true} is VALID [2022-04-08 10:05:54,094 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57840#true} {57840#true} #72#return; {57840#true} is VALID [2022-04-08 10:05:54,095 INFO L272 TraceCheckUtils]: 0: Hoare triple {57840#true} call ULTIMATE.init(); {57857#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:05:54,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {57857#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {57840#true} is VALID [2022-04-08 10:05:54,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {57840#true} assume true; {57840#true} is VALID [2022-04-08 10:05:54,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57840#true} {57840#true} #72#return; {57840#true} is VALID [2022-04-08 10:05:54,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {57840#true} call #t~ret13 := main(); {57840#true} is VALID [2022-04-08 10:05:54,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {57840#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {57840#true} is VALID [2022-04-08 10:05:54,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {57840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57845#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:05:54,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {57845#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57846#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-08 10:05:54,098 INFO L290 TraceCheckUtils]: 8: Hoare triple {57846#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57847#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:05:54,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {57847#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57848#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:05:54,100 INFO L290 TraceCheckUtils]: 10: Hoare triple {57848#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57849#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:05:54,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {57849#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57850#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:05:54,102 INFO L290 TraceCheckUtils]: 12: Hoare triple {57850#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {57850#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:05:54,103 INFO L290 TraceCheckUtils]: 13: Hoare triple {57850#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} ~z~0 := ~y~0; {57850#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:05:54,103 INFO L290 TraceCheckUtils]: 14: Hoare triple {57850#(<= (* 4294967296 (div (+ main_~x~0 6) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57851#(<= (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-08 10:05:54,104 INFO L290 TraceCheckUtils]: 15: Hoare triple {57851#(<= (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57852#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 2) main_~x~0)} is VALID [2022-04-08 10:05:54,105 INFO L290 TraceCheckUtils]: 16: Hoare triple {57852#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 2) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57853#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 3) main_~x~0)} is VALID [2022-04-08 10:05:54,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {57853#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 3) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57854#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-08 10:05:54,106 INFO L290 TraceCheckUtils]: 18: Hoare triple {57854#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 4) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57855#(<= (+ 5 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:05:54,106 INFO L290 TraceCheckUtils]: 19: Hoare triple {57855#(<= (+ 5 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57856#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:05:54,107 INFO L290 TraceCheckUtils]: 20: Hoare triple {57856#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {57856#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:05:54,107 INFO L290 TraceCheckUtils]: 21: Hoare triple {57856#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57856#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:05:54,108 INFO L290 TraceCheckUtils]: 22: Hoare triple {57856#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57856#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:05:54,108 INFO L290 TraceCheckUtils]: 23: Hoare triple {57856#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57856#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:05:54,108 INFO L290 TraceCheckUtils]: 24: Hoare triple {57856#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57856#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:05:54,109 INFO L290 TraceCheckUtils]: 25: Hoare triple {57856#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57856#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:05:54,109 INFO L290 TraceCheckUtils]: 26: Hoare triple {57856#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57856#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:05:54,109 INFO L290 TraceCheckUtils]: 27: Hoare triple {57856#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {57856#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:05:54,110 INFO L290 TraceCheckUtils]: 28: Hoare triple {57856#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {57841#false} is VALID [2022-04-08 10:05:54,110 INFO L272 TraceCheckUtils]: 29: Hoare triple {57841#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {57841#false} is VALID [2022-04-08 10:05:54,110 INFO L290 TraceCheckUtils]: 30: Hoare triple {57841#false} ~cond := #in~cond; {57841#false} is VALID [2022-04-08 10:05:54,110 INFO L290 TraceCheckUtils]: 31: Hoare triple {57841#false} assume 0 == ~cond; {57841#false} is VALID [2022-04-08 10:05:54,110 INFO L290 TraceCheckUtils]: 32: Hoare triple {57841#false} assume !false; {57841#false} is VALID [2022-04-08 10:05:54,110 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-08 10:05:54,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:05:54,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787204741] [2022-04-08 10:05:54,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787204741] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:05:54,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148326094] [2022-04-08 10:05:54,110 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:05:54,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:05:54,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:05:54,111 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:05:54,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-04-08 10:05:54,159 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:05:54,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:05:54,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 10:05:54,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:05:54,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:05:54,465 INFO L272 TraceCheckUtils]: 0: Hoare triple {57840#true} call ULTIMATE.init(); {57840#true} is VALID [2022-04-08 10:05:54,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {57840#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {57840#true} is VALID [2022-04-08 10:05:54,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {57840#true} assume true; {57840#true} is VALID [2022-04-08 10:05:54,465 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57840#true} {57840#true} #72#return; {57840#true} is VALID [2022-04-08 10:05:54,465 INFO L272 TraceCheckUtils]: 4: Hoare triple {57840#true} call #t~ret13 := main(); {57840#true} is VALID [2022-04-08 10:05:54,465 INFO L290 TraceCheckUtils]: 5: Hoare triple {57840#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {57840#true} is VALID [2022-04-08 10:05:54,466 INFO L290 TraceCheckUtils]: 6: Hoare triple {57840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57845#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:05:54,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {57845#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57882#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:05:54,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {57882#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57886#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:54,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {57886#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57890#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:05:54,469 INFO L290 TraceCheckUtils]: 10: Hoare triple {57890#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57894#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:54,469 INFO L290 TraceCheckUtils]: 11: Hoare triple {57894#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57898#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-08 10:05:54,470 INFO L290 TraceCheckUtils]: 12: Hoare triple {57898#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !(~x~0 % 4294967296 > 0); {57898#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-08 10:05:54,470 INFO L290 TraceCheckUtils]: 13: Hoare triple {57898#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} ~z~0 := ~y~0; {57898#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-08 10:05:54,471 INFO L290 TraceCheckUtils]: 14: Hoare triple {57898#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57894#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:54,471 INFO L290 TraceCheckUtils]: 15: Hoare triple {57894#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57890#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:05:54,472 INFO L290 TraceCheckUtils]: 16: Hoare triple {57890#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57886#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:54,472 INFO L290 TraceCheckUtils]: 17: Hoare triple {57886#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57882#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:05:54,473 INFO L290 TraceCheckUtils]: 18: Hoare triple {57882#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57845#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:05:54,474 INFO L290 TraceCheckUtils]: 19: Hoare triple {57845#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:54,474 INFO L290 TraceCheckUtils]: 20: Hoare triple {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:54,474 INFO L290 TraceCheckUtils]: 21: Hoare triple {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:54,475 INFO L290 TraceCheckUtils]: 22: Hoare triple {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:54,475 INFO L290 TraceCheckUtils]: 23: Hoare triple {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:54,475 INFO L290 TraceCheckUtils]: 24: Hoare triple {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:54,475 INFO L290 TraceCheckUtils]: 25: Hoare triple {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:54,476 INFO L290 TraceCheckUtils]: 26: Hoare triple {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:54,476 INFO L290 TraceCheckUtils]: 27: Hoare triple {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:54,476 INFO L290 TraceCheckUtils]: 28: Hoare triple {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {57841#false} is VALID [2022-04-08 10:05:54,477 INFO L272 TraceCheckUtils]: 29: Hoare triple {57841#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {57841#false} is VALID [2022-04-08 10:05:54,477 INFO L290 TraceCheckUtils]: 30: Hoare triple {57841#false} ~cond := #in~cond; {57841#false} is VALID [2022-04-08 10:05:54,477 INFO L290 TraceCheckUtils]: 31: Hoare triple {57841#false} assume 0 == ~cond; {57841#false} is VALID [2022-04-08 10:05:54,477 INFO L290 TraceCheckUtils]: 32: Hoare triple {57841#false} assume !false; {57841#false} is VALID [2022-04-08 10:05:54,477 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-08 10:05:54,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:05:54,613 INFO L290 TraceCheckUtils]: 32: Hoare triple {57841#false} assume !false; {57841#false} is VALID [2022-04-08 10:05:54,613 INFO L290 TraceCheckUtils]: 31: Hoare triple {57841#false} assume 0 == ~cond; {57841#false} is VALID [2022-04-08 10:05:54,613 INFO L290 TraceCheckUtils]: 30: Hoare triple {57841#false} ~cond := #in~cond; {57841#false} is VALID [2022-04-08 10:05:54,613 INFO L272 TraceCheckUtils]: 29: Hoare triple {57841#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {57841#false} is VALID [2022-04-08 10:05:54,614 INFO L290 TraceCheckUtils]: 28: Hoare triple {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {57841#false} is VALID [2022-04-08 10:05:54,614 INFO L290 TraceCheckUtils]: 27: Hoare triple {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:54,615 INFO L290 TraceCheckUtils]: 26: Hoare triple {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:54,615 INFO L290 TraceCheckUtils]: 25: Hoare triple {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:54,615 INFO L290 TraceCheckUtils]: 24: Hoare triple {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:54,615 INFO L290 TraceCheckUtils]: 23: Hoare triple {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:54,616 INFO L290 TraceCheckUtils]: 22: Hoare triple {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:54,616 INFO L290 TraceCheckUtils]: 21: Hoare triple {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:54,616 INFO L290 TraceCheckUtils]: 20: Hoare triple {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:54,617 INFO L290 TraceCheckUtils]: 19: Hoare triple {57845#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57923#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:54,618 INFO L290 TraceCheckUtils]: 18: Hoare triple {57882#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57845#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:05:54,618 INFO L290 TraceCheckUtils]: 17: Hoare triple {57886#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57882#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:05:54,619 INFO L290 TraceCheckUtils]: 16: Hoare triple {57890#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57886#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:54,620 INFO L290 TraceCheckUtils]: 15: Hoare triple {57894#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57890#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:05:54,620 INFO L290 TraceCheckUtils]: 14: Hoare triple {57898#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57894#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:54,621 INFO L290 TraceCheckUtils]: 13: Hoare triple {57898#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} ~z~0 := ~y~0; {57898#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-08 10:05:54,621 INFO L290 TraceCheckUtils]: 12: Hoare triple {57898#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !(~x~0 % 4294967296 > 0); {57898#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-08 10:05:54,622 INFO L290 TraceCheckUtils]: 11: Hoare triple {57894#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57898#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-08 10:05:54,622 INFO L290 TraceCheckUtils]: 10: Hoare triple {57890#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57894#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:54,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {57886#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57890#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:05:54,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {57882#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57886#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:05:54,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {57845#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57882#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:05:54,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {57840#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {57845#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:05:54,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {57840#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {57840#true} is VALID [2022-04-08 10:05:54,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {57840#true} call #t~ret13 := main(); {57840#true} is VALID [2022-04-08 10:05:54,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57840#true} {57840#true} #72#return; {57840#true} is VALID [2022-04-08 10:05:54,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {57840#true} assume true; {57840#true} is VALID [2022-04-08 10:05:54,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {57840#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {57840#true} is VALID [2022-04-08 10:05:54,625 INFO L272 TraceCheckUtils]: 0: Hoare triple {57840#true} call ULTIMATE.init(); {57840#true} is VALID [2022-04-08 10:05:54,625 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-08 10:05:54,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148326094] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:05:54,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:05:54,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 21 [2022-04-08 10:05:54,626 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:05:54,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [963388996] [2022-04-08 10:05:54,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [963388996] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:05:54,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:05:54,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 10:05:54,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973109060] [2022-04-08 10:05:54,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:05:54,626 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 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 33 [2022-04-08 10:05:54,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:05:54,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 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-08 10:05:54,650 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-08 10:05:54,651 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 10:05:54,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:05:54,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 10:05:54,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2022-04-08 10:05:54,651 INFO L87 Difference]: Start difference. First operand 267 states and 363 transitions. Second operand has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 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-08 10:05:56,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:56,881 INFO L93 Difference]: Finished difference Result 316 states and 437 transitions. [2022-04-08 10:05:56,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 10:05:56,882 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 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 33 [2022-04-08 10:05:56,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:05:56,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 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-08 10:05:56,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 82 transitions. [2022-04-08 10:05:56,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 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-08 10:05:56,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 82 transitions. [2022-04-08 10:05:56,884 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 82 transitions. [2022-04-08 10:05:56,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:05:56,942 INFO L225 Difference]: With dead ends: 316 [2022-04-08 10:05:56,942 INFO L226 Difference]: Without dead ends: 311 [2022-04-08 10:05:56,942 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=239, Invalid=817, Unknown=0, NotChecked=0, Total=1056 [2022-04-08 10:05:56,942 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 67 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:05:56,943 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 65 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:05:56,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-04-08 10:05:57,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 300. [2022-04-08 10:05:57,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:05:57,956 INFO L82 GeneralOperation]: Start isEquivalent. First operand 311 states. Second operand has 300 states, 295 states have (on average 1.376271186440678) internal successors, (406), 295 states have internal predecessors, (406), 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-08 10:05:57,956 INFO L74 IsIncluded]: Start isIncluded. First operand 311 states. Second operand has 300 states, 295 states have (on average 1.376271186440678) internal successors, (406), 295 states have internal predecessors, (406), 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-08 10:05:57,956 INFO L87 Difference]: Start difference. First operand 311 states. Second operand has 300 states, 295 states have (on average 1.376271186440678) internal successors, (406), 295 states have internal predecessors, (406), 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-08 10:05:57,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:57,960 INFO L93 Difference]: Finished difference Result 311 states and 427 transitions. [2022-04-08 10:05:57,960 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 427 transitions. [2022-04-08 10:05:57,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:57,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:57,960 INFO L74 IsIncluded]: Start isIncluded. First operand has 300 states, 295 states have (on average 1.376271186440678) internal successors, (406), 295 states have internal predecessors, (406), 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 311 states. [2022-04-08 10:05:57,960 INFO L87 Difference]: Start difference. First operand has 300 states, 295 states have (on average 1.376271186440678) internal successors, (406), 295 states have internal predecessors, (406), 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 311 states. [2022-04-08 10:05:57,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:05:57,963 INFO L93 Difference]: Finished difference Result 311 states and 427 transitions. [2022-04-08 10:05:57,963 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 427 transitions. [2022-04-08 10:05:57,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:05:57,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:05:57,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:05:57,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:05:57,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 295 states have (on average 1.376271186440678) internal successors, (406), 295 states have internal predecessors, (406), 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-08 10:05:57,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 410 transitions. [2022-04-08 10:05:57,968 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 410 transitions. Word has length 33 [2022-04-08 10:05:57,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:05:57,968 INFO L478 AbstractCegarLoop]: Abstraction has 300 states and 410 transitions. [2022-04-08 10:05:57,968 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 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-08 10:05:57,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 300 states and 410 transitions. [2022-04-08 10:06:00,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 410 edges. 410 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:00,102 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 410 transitions. [2022-04-08 10:06:00,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 10:06:00,102 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:00,102 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:00,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-04-08 10:06:00,318 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:00,318 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:00,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:00,318 INFO L85 PathProgramCache]: Analyzing trace with hash -891263002, now seen corresponding path program 41 times [2022-04-08 10:06:00,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:00,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [573994359] [2022-04-08 10:06:00,321 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:00,321 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:00,321 INFO L85 PathProgramCache]: Analyzing trace with hash -891263002, now seen corresponding path program 42 times [2022-04-08 10:06:00,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:00,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62974072] [2022-04-08 10:06:00,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:00,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:00,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:00,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:00,482 INFO L290 TraceCheckUtils]: 0: Hoare triple {59955#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {59939#true} is VALID [2022-04-08 10:06:00,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {59939#true} assume true; {59939#true} is VALID [2022-04-08 10:06:00,483 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {59939#true} {59939#true} #72#return; {59939#true} is VALID [2022-04-08 10:06:00,483 INFO L272 TraceCheckUtils]: 0: Hoare triple {59939#true} call ULTIMATE.init(); {59955#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:00,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {59955#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {59939#true} is VALID [2022-04-08 10:06:00,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {59939#true} assume true; {59939#true} is VALID [2022-04-08 10:06:00,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59939#true} {59939#true} #72#return; {59939#true} is VALID [2022-04-08 10:06:00,483 INFO L272 TraceCheckUtils]: 4: Hoare triple {59939#true} call #t~ret13 := main(); {59939#true} is VALID [2022-04-08 10:06:00,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {59939#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {59944#(= main_~y~0 0)} is VALID [2022-04-08 10:06:00,484 INFO L290 TraceCheckUtils]: 6: Hoare triple {59944#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59945#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:00,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {59945#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59946#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:00,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {59946#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59947#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:00,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {59947#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59948#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:00,486 INFO L290 TraceCheckUtils]: 10: Hoare triple {59948#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59949#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:00,486 INFO L290 TraceCheckUtils]: 11: Hoare triple {59949#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59950#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:00,487 INFO L290 TraceCheckUtils]: 12: Hoare triple {59950#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59951#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:00,487 INFO L290 TraceCheckUtils]: 13: Hoare triple {59951#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {59951#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:00,487 INFO L290 TraceCheckUtils]: 14: Hoare triple {59951#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {59952#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:06:00,488 INFO L290 TraceCheckUtils]: 15: Hoare triple {59952#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59953#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:06:00,488 INFO L290 TraceCheckUtils]: 16: Hoare triple {59953#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59954#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:06:00,489 INFO L290 TraceCheckUtils]: 17: Hoare triple {59954#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {59940#false} is VALID [2022-04-08 10:06:00,489 INFO L290 TraceCheckUtils]: 18: Hoare triple {59940#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59940#false} is VALID [2022-04-08 10:06:00,489 INFO L290 TraceCheckUtils]: 19: Hoare triple {59940#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59940#false} is VALID [2022-04-08 10:06:00,489 INFO L290 TraceCheckUtils]: 20: Hoare triple {59940#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59940#false} is VALID [2022-04-08 10:06:00,489 INFO L290 TraceCheckUtils]: 21: Hoare triple {59940#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59940#false} is VALID [2022-04-08 10:06:00,489 INFO L290 TraceCheckUtils]: 22: Hoare triple {59940#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59940#false} is VALID [2022-04-08 10:06:00,489 INFO L290 TraceCheckUtils]: 23: Hoare triple {59940#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59940#false} is VALID [2022-04-08 10:06:00,489 INFO L290 TraceCheckUtils]: 24: Hoare triple {59940#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59940#false} is VALID [2022-04-08 10:06:00,489 INFO L290 TraceCheckUtils]: 25: Hoare triple {59940#false} assume !(~y~0 % 4294967296 > 0); {59940#false} is VALID [2022-04-08 10:06:00,489 INFO L290 TraceCheckUtils]: 26: Hoare triple {59940#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {59940#false} is VALID [2022-04-08 10:06:00,489 INFO L290 TraceCheckUtils]: 27: Hoare triple {59940#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {59940#false} is VALID [2022-04-08 10:06:00,489 INFO L290 TraceCheckUtils]: 28: Hoare triple {59940#false} assume !(~x~0 % 4294967296 > 0); {59940#false} is VALID [2022-04-08 10:06:00,489 INFO L272 TraceCheckUtils]: 29: Hoare triple {59940#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {59940#false} is VALID [2022-04-08 10:06:00,489 INFO L290 TraceCheckUtils]: 30: Hoare triple {59940#false} ~cond := #in~cond; {59940#false} is VALID [2022-04-08 10:06:00,489 INFO L290 TraceCheckUtils]: 31: Hoare triple {59940#false} assume 0 == ~cond; {59940#false} is VALID [2022-04-08 10:06:00,490 INFO L290 TraceCheckUtils]: 32: Hoare triple {59940#false} assume !false; {59940#false} is VALID [2022-04-08 10:06:00,490 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-04-08 10:06:00,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:00,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62974072] [2022-04-08 10:06:00,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62974072] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:00,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859812877] [2022-04-08 10:06:00,490 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:06:00,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:00,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:00,492 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:06:00,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-04-08 10:06:00,585 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 10:06:00,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:00,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 10:06:00,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:00,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:00,813 INFO L272 TraceCheckUtils]: 0: Hoare triple {59939#true} call ULTIMATE.init(); {59939#true} is VALID [2022-04-08 10:06:00,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {59939#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {59939#true} is VALID [2022-04-08 10:06:00,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {59939#true} assume true; {59939#true} is VALID [2022-04-08 10:06:00,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59939#true} {59939#true} #72#return; {59939#true} is VALID [2022-04-08 10:06:00,813 INFO L272 TraceCheckUtils]: 4: Hoare triple {59939#true} call #t~ret13 := main(); {59939#true} is VALID [2022-04-08 10:06:00,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {59939#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {59944#(= main_~y~0 0)} is VALID [2022-04-08 10:06:00,814 INFO L290 TraceCheckUtils]: 6: Hoare triple {59944#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59945#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:00,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {59945#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59946#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:00,815 INFO L290 TraceCheckUtils]: 8: Hoare triple {59946#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59947#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:00,816 INFO L290 TraceCheckUtils]: 9: Hoare triple {59947#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59948#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:00,816 INFO L290 TraceCheckUtils]: 10: Hoare triple {59948#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59949#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:00,817 INFO L290 TraceCheckUtils]: 11: Hoare triple {59949#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59950#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:00,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {59950#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {59951#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:00,817 INFO L290 TraceCheckUtils]: 13: Hoare triple {59951#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {59951#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:00,818 INFO L290 TraceCheckUtils]: 14: Hoare triple {59951#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {59952#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:06:00,818 INFO L290 TraceCheckUtils]: 15: Hoare triple {59952#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59953#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:06:00,819 INFO L290 TraceCheckUtils]: 16: Hoare triple {59953#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {60007#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:06:00,819 INFO L290 TraceCheckUtils]: 17: Hoare triple {60007#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {59940#false} is VALID [2022-04-08 10:06:00,819 INFO L290 TraceCheckUtils]: 18: Hoare triple {59940#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59940#false} is VALID [2022-04-08 10:06:00,819 INFO L290 TraceCheckUtils]: 19: Hoare triple {59940#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59940#false} is VALID [2022-04-08 10:06:00,819 INFO L290 TraceCheckUtils]: 20: Hoare triple {59940#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59940#false} is VALID [2022-04-08 10:06:00,819 INFO L290 TraceCheckUtils]: 21: Hoare triple {59940#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59940#false} is VALID [2022-04-08 10:06:00,819 INFO L290 TraceCheckUtils]: 22: Hoare triple {59940#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59940#false} is VALID [2022-04-08 10:06:00,820 INFO L290 TraceCheckUtils]: 23: Hoare triple {59940#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59940#false} is VALID [2022-04-08 10:06:00,820 INFO L290 TraceCheckUtils]: 24: Hoare triple {59940#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59940#false} is VALID [2022-04-08 10:06:00,820 INFO L290 TraceCheckUtils]: 25: Hoare triple {59940#false} assume !(~y~0 % 4294967296 > 0); {59940#false} is VALID [2022-04-08 10:06:00,820 INFO L290 TraceCheckUtils]: 26: Hoare triple {59940#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {59940#false} is VALID [2022-04-08 10:06:00,820 INFO L290 TraceCheckUtils]: 27: Hoare triple {59940#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {59940#false} is VALID [2022-04-08 10:06:00,820 INFO L290 TraceCheckUtils]: 28: Hoare triple {59940#false} assume !(~x~0 % 4294967296 > 0); {59940#false} is VALID [2022-04-08 10:06:00,820 INFO L272 TraceCheckUtils]: 29: Hoare triple {59940#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {59940#false} is VALID [2022-04-08 10:06:00,820 INFO L290 TraceCheckUtils]: 30: Hoare triple {59940#false} ~cond := #in~cond; {59940#false} is VALID [2022-04-08 10:06:00,820 INFO L290 TraceCheckUtils]: 31: Hoare triple {59940#false} assume 0 == ~cond; {59940#false} is VALID [2022-04-08 10:06:00,820 INFO L290 TraceCheckUtils]: 32: Hoare triple {59940#false} assume !false; {59940#false} is VALID [2022-04-08 10:06:00,820 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-04-08 10:06:00,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:01,032 INFO L290 TraceCheckUtils]: 32: Hoare triple {59940#false} assume !false; {59940#false} is VALID [2022-04-08 10:06:01,032 INFO L290 TraceCheckUtils]: 31: Hoare triple {59940#false} assume 0 == ~cond; {59940#false} is VALID [2022-04-08 10:06:01,032 INFO L290 TraceCheckUtils]: 30: Hoare triple {59940#false} ~cond := #in~cond; {59940#false} is VALID [2022-04-08 10:06:01,032 INFO L272 TraceCheckUtils]: 29: Hoare triple {59940#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {59940#false} is VALID [2022-04-08 10:06:01,032 INFO L290 TraceCheckUtils]: 28: Hoare triple {59940#false} assume !(~x~0 % 4294967296 > 0); {59940#false} is VALID [2022-04-08 10:06:01,033 INFO L290 TraceCheckUtils]: 27: Hoare triple {59940#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {59940#false} is VALID [2022-04-08 10:06:01,033 INFO L290 TraceCheckUtils]: 26: Hoare triple {59940#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {59940#false} is VALID [2022-04-08 10:06:01,033 INFO L290 TraceCheckUtils]: 25: Hoare triple {59940#false} assume !(~y~0 % 4294967296 > 0); {59940#false} is VALID [2022-04-08 10:06:01,033 INFO L290 TraceCheckUtils]: 24: Hoare triple {59940#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59940#false} is VALID [2022-04-08 10:06:01,033 INFO L290 TraceCheckUtils]: 23: Hoare triple {59940#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59940#false} is VALID [2022-04-08 10:06:01,033 INFO L290 TraceCheckUtils]: 22: Hoare triple {59940#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59940#false} is VALID [2022-04-08 10:06:01,033 INFO L290 TraceCheckUtils]: 21: Hoare triple {59940#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59940#false} is VALID [2022-04-08 10:06:01,033 INFO L290 TraceCheckUtils]: 20: Hoare triple {59940#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59940#false} is VALID [2022-04-08 10:06:01,033 INFO L290 TraceCheckUtils]: 19: Hoare triple {59940#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59940#false} is VALID [2022-04-08 10:06:01,033 INFO L290 TraceCheckUtils]: 18: Hoare triple {59940#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59940#false} is VALID [2022-04-08 10:06:01,033 INFO L290 TraceCheckUtils]: 17: Hoare triple {60101#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {59940#false} is VALID [2022-04-08 10:06:01,034 INFO L290 TraceCheckUtils]: 16: Hoare triple {60105#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {60101#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:06:01,034 INFO L290 TraceCheckUtils]: 15: Hoare triple {60109#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {60105#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:01,035 INFO L290 TraceCheckUtils]: 14: Hoare triple {60113#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {60109#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:06:01,035 INFO L290 TraceCheckUtils]: 13: Hoare triple {60113#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {60113#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:06:01,035 INFO L290 TraceCheckUtils]: 12: Hoare triple {60120#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60113#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:06:01,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {60124#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60120#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:01,036 INFO L290 TraceCheckUtils]: 10: Hoare triple {60128#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60124#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:01,037 INFO L290 TraceCheckUtils]: 9: Hoare triple {60132#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60128#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:06:01,037 INFO L290 TraceCheckUtils]: 8: Hoare triple {60136#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60132#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:06:01,038 INFO L290 TraceCheckUtils]: 7: Hoare triple {60140#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60136#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:06:01,038 INFO L290 TraceCheckUtils]: 6: Hoare triple {60144#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {60140#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:06:01,039 INFO L290 TraceCheckUtils]: 5: Hoare triple {59939#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {60144#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:01,039 INFO L272 TraceCheckUtils]: 4: Hoare triple {59939#true} call #t~ret13 := main(); {59939#true} is VALID [2022-04-08 10:06:01,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59939#true} {59939#true} #72#return; {59939#true} is VALID [2022-04-08 10:06:01,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {59939#true} assume true; {59939#true} is VALID [2022-04-08 10:06:01,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {59939#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {59939#true} is VALID [2022-04-08 10:06:01,039 INFO L272 TraceCheckUtils]: 0: Hoare triple {59939#true} call ULTIMATE.init(); {59939#true} is VALID [2022-04-08 10:06:01,039 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-04-08 10:06:01,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859812877] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:01,039 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:01,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-08 10:06:01,040 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:01,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [573994359] [2022-04-08 10:06:01,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [573994359] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:01,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:01,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 10:06:01,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003081550] [2022-04-08 10:06:01,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:01,041 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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 33 [2022-04-08 10:06:01,041 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:01,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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-08 10:06:01,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:01,052 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 10:06:01,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:01,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 10:06:01,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2022-04-08 10:06:01,053 INFO L87 Difference]: Start difference. First operand 300 states and 410 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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-08 10:06:03,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:03,877 INFO L93 Difference]: Finished difference Result 392 states and 509 transitions. [2022-04-08 10:06:03,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 10:06:03,877 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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 33 [2022-04-08 10:06:03,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:03,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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-08 10:06:03,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 86 transitions. [2022-04-08 10:06:03,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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-08 10:06:03,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 86 transitions. [2022-04-08 10:06:03,879 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 86 transitions. [2022-04-08 10:06:03,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:03,954 INFO L225 Difference]: With dead ends: 392 [2022-04-08 10:06:03,954 INFO L226 Difference]: Without dead ends: 376 [2022-04-08 10:06:03,954 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=326, Invalid=1234, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 10:06:03,955 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 42 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:03,955 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 82 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:06:03,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-04-08 10:06:05,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 300. [2022-04-08 10:06:05,459 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:05,459 INFO L82 GeneralOperation]: Start isEquivalent. First operand 376 states. Second operand has 300 states, 295 states have (on average 1.3728813559322033) internal successors, (405), 295 states have internal predecessors, (405), 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-08 10:06:05,460 INFO L74 IsIncluded]: Start isIncluded. First operand 376 states. Second operand has 300 states, 295 states have (on average 1.3728813559322033) internal successors, (405), 295 states have internal predecessors, (405), 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-08 10:06:05,460 INFO L87 Difference]: Start difference. First operand 376 states. Second operand has 300 states, 295 states have (on average 1.3728813559322033) internal successors, (405), 295 states have internal predecessors, (405), 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-08 10:06:05,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:05,464 INFO L93 Difference]: Finished difference Result 376 states and 493 transitions. [2022-04-08 10:06:05,464 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 493 transitions. [2022-04-08 10:06:05,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:05,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:05,465 INFO L74 IsIncluded]: Start isIncluded. First operand has 300 states, 295 states have (on average 1.3728813559322033) internal successors, (405), 295 states have internal predecessors, (405), 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 376 states. [2022-04-08 10:06:05,465 INFO L87 Difference]: Start difference. First operand has 300 states, 295 states have (on average 1.3728813559322033) internal successors, (405), 295 states have internal predecessors, (405), 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 376 states. [2022-04-08 10:06:05,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:05,469 INFO L93 Difference]: Finished difference Result 376 states and 493 transitions. [2022-04-08 10:06:05,469 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 493 transitions. [2022-04-08 10:06:05,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:05,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:05,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:05,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:05,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 295 states have (on average 1.3728813559322033) internal successors, (405), 295 states have internal predecessors, (405), 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-08 10:06:05,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 409 transitions. [2022-04-08 10:06:05,473 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 409 transitions. Word has length 33 [2022-04-08 10:06:05,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:05,474 INFO L478 AbstractCegarLoop]: Abstraction has 300 states and 409 transitions. [2022-04-08 10:06:05,474 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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-08 10:06:05,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 300 states and 409 transitions. [2022-04-08 10:06:07,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 409 edges. 409 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:07,377 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 409 transitions. [2022-04-08 10:06:07,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 10:06:07,377 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:07,377 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:07,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-04-08 10:06:07,593 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2022-04-08 10:06:07,593 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:07,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:07,593 INFO L85 PathProgramCache]: Analyzing trace with hash -15323528, now seen corresponding path program 43 times [2022-04-08 10:06:07,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:07,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2015208872] [2022-04-08 10:06:07,596 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:07,596 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:07,596 INFO L85 PathProgramCache]: Analyzing trace with hash -15323528, now seen corresponding path program 44 times [2022-04-08 10:06:07,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:07,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709064059] [2022-04-08 10:06:07,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:07,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:07,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:07,753 INFO L290 TraceCheckUtils]: 0: Hoare triple {62345#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {62329#true} is VALID [2022-04-08 10:06:07,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {62329#true} assume true; {62329#true} is VALID [2022-04-08 10:06:07,753 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {62329#true} {62329#true} #72#return; {62329#true} is VALID [2022-04-08 10:06:07,754 INFO L272 TraceCheckUtils]: 0: Hoare triple {62329#true} call ULTIMATE.init(); {62345#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:07,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {62345#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {62329#true} is VALID [2022-04-08 10:06:07,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {62329#true} assume true; {62329#true} is VALID [2022-04-08 10:06:07,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62329#true} {62329#true} #72#return; {62329#true} is VALID [2022-04-08 10:06:07,754 INFO L272 TraceCheckUtils]: 4: Hoare triple {62329#true} call #t~ret13 := main(); {62329#true} is VALID [2022-04-08 10:06:07,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {62329#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {62334#(= main_~y~0 0)} is VALID [2022-04-08 10:06:07,754 INFO L290 TraceCheckUtils]: 6: Hoare triple {62334#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62335#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:07,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {62335#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62336#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:07,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {62336#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62337#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:07,756 INFO L290 TraceCheckUtils]: 9: Hoare triple {62337#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62338#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:07,756 INFO L290 TraceCheckUtils]: 10: Hoare triple {62338#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62339#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:07,757 INFO L290 TraceCheckUtils]: 11: Hoare triple {62339#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62340#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:07,757 INFO L290 TraceCheckUtils]: 12: Hoare triple {62340#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62341#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:07,758 INFO L290 TraceCheckUtils]: 13: Hoare triple {62341#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62342#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:07,758 INFO L290 TraceCheckUtils]: 14: Hoare triple {62342#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {62342#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:07,759 INFO L290 TraceCheckUtils]: 15: Hoare triple {62342#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {62343#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:06:07,759 INFO L290 TraceCheckUtils]: 16: Hoare triple {62343#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {62344#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:06:07,760 INFO L290 TraceCheckUtils]: 17: Hoare triple {62344#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {62330#false} is VALID [2022-04-08 10:06:07,760 INFO L290 TraceCheckUtils]: 18: Hoare triple {62330#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {62330#false} is VALID [2022-04-08 10:06:07,760 INFO L290 TraceCheckUtils]: 19: Hoare triple {62330#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {62330#false} is VALID [2022-04-08 10:06:07,760 INFO L290 TraceCheckUtils]: 20: Hoare triple {62330#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {62330#false} is VALID [2022-04-08 10:06:07,760 INFO L290 TraceCheckUtils]: 21: Hoare triple {62330#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {62330#false} is VALID [2022-04-08 10:06:07,760 INFO L290 TraceCheckUtils]: 22: Hoare triple {62330#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {62330#false} is VALID [2022-04-08 10:06:07,760 INFO L290 TraceCheckUtils]: 23: Hoare triple {62330#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {62330#false} is VALID [2022-04-08 10:06:07,760 INFO L290 TraceCheckUtils]: 24: Hoare triple {62330#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {62330#false} is VALID [2022-04-08 10:06:07,760 INFO L290 TraceCheckUtils]: 25: Hoare triple {62330#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {62330#false} is VALID [2022-04-08 10:06:07,760 INFO L290 TraceCheckUtils]: 26: Hoare triple {62330#false} assume !(~y~0 % 4294967296 > 0); {62330#false} is VALID [2022-04-08 10:06:07,760 INFO L290 TraceCheckUtils]: 27: Hoare triple {62330#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {62330#false} is VALID [2022-04-08 10:06:07,760 INFO L290 TraceCheckUtils]: 28: Hoare triple {62330#false} assume !(~x~0 % 4294967296 > 0); {62330#false} is VALID [2022-04-08 10:06:07,760 INFO L272 TraceCheckUtils]: 29: Hoare triple {62330#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {62330#false} is VALID [2022-04-08 10:06:07,760 INFO L290 TraceCheckUtils]: 30: Hoare triple {62330#false} ~cond := #in~cond; {62330#false} is VALID [2022-04-08 10:06:07,760 INFO L290 TraceCheckUtils]: 31: Hoare triple {62330#false} assume 0 == ~cond; {62330#false} is VALID [2022-04-08 10:06:07,760 INFO L290 TraceCheckUtils]: 32: Hoare triple {62330#false} assume !false; {62330#false} is VALID [2022-04-08 10:06:07,760 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-08 10:06:07,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:07,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709064059] [2022-04-08 10:06:07,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709064059] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:07,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271582123] [2022-04-08 10:06:07,761 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:06:07,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:07,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:07,762 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:06:07,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-04-08 10:06:07,800 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:06:07,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:07,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 10:06:07,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:07,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:08,034 INFO L272 TraceCheckUtils]: 0: Hoare triple {62329#true} call ULTIMATE.init(); {62329#true} is VALID [2022-04-08 10:06:08,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {62329#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {62329#true} is VALID [2022-04-08 10:06:08,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {62329#true} assume true; {62329#true} is VALID [2022-04-08 10:06:08,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62329#true} {62329#true} #72#return; {62329#true} is VALID [2022-04-08 10:06:08,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {62329#true} call #t~ret13 := main(); {62329#true} is VALID [2022-04-08 10:06:08,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {62329#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {62334#(= main_~y~0 0)} is VALID [2022-04-08 10:06:08,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {62334#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62335#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:08,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {62335#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62336#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:08,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {62336#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62337#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:08,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {62337#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62338#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:08,037 INFO L290 TraceCheckUtils]: 10: Hoare triple {62338#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62339#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:08,037 INFO L290 TraceCheckUtils]: 11: Hoare triple {62339#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62340#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:08,038 INFO L290 TraceCheckUtils]: 12: Hoare triple {62340#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62341#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:08,038 INFO L290 TraceCheckUtils]: 13: Hoare triple {62341#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62342#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:08,038 INFO L290 TraceCheckUtils]: 14: Hoare triple {62342#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {62342#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:08,039 INFO L290 TraceCheckUtils]: 15: Hoare triple {62342#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {62343#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:06:08,039 INFO L290 TraceCheckUtils]: 16: Hoare triple {62343#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {62397#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:06:08,040 INFO L290 TraceCheckUtils]: 17: Hoare triple {62397#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {62330#false} is VALID [2022-04-08 10:06:08,040 INFO L290 TraceCheckUtils]: 18: Hoare triple {62330#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {62330#false} is VALID [2022-04-08 10:06:08,040 INFO L290 TraceCheckUtils]: 19: Hoare triple {62330#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {62330#false} is VALID [2022-04-08 10:06:08,040 INFO L290 TraceCheckUtils]: 20: Hoare triple {62330#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {62330#false} is VALID [2022-04-08 10:06:08,040 INFO L290 TraceCheckUtils]: 21: Hoare triple {62330#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {62330#false} is VALID [2022-04-08 10:06:08,040 INFO L290 TraceCheckUtils]: 22: Hoare triple {62330#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {62330#false} is VALID [2022-04-08 10:06:08,040 INFO L290 TraceCheckUtils]: 23: Hoare triple {62330#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {62330#false} is VALID [2022-04-08 10:06:08,040 INFO L290 TraceCheckUtils]: 24: Hoare triple {62330#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {62330#false} is VALID [2022-04-08 10:06:08,040 INFO L290 TraceCheckUtils]: 25: Hoare triple {62330#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {62330#false} is VALID [2022-04-08 10:06:08,040 INFO L290 TraceCheckUtils]: 26: Hoare triple {62330#false} assume !(~y~0 % 4294967296 > 0); {62330#false} is VALID [2022-04-08 10:06:08,040 INFO L290 TraceCheckUtils]: 27: Hoare triple {62330#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {62330#false} is VALID [2022-04-08 10:06:08,040 INFO L290 TraceCheckUtils]: 28: Hoare triple {62330#false} assume !(~x~0 % 4294967296 > 0); {62330#false} is VALID [2022-04-08 10:06:08,040 INFO L272 TraceCheckUtils]: 29: Hoare triple {62330#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {62330#false} is VALID [2022-04-08 10:06:08,040 INFO L290 TraceCheckUtils]: 30: Hoare triple {62330#false} ~cond := #in~cond; {62330#false} is VALID [2022-04-08 10:06:08,040 INFO L290 TraceCheckUtils]: 31: Hoare triple {62330#false} assume 0 == ~cond; {62330#false} is VALID [2022-04-08 10:06:08,040 INFO L290 TraceCheckUtils]: 32: Hoare triple {62330#false} assume !false; {62330#false} is VALID [2022-04-08 10:06:08,041 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-08 10:06:08,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:08,312 INFO L290 TraceCheckUtils]: 32: Hoare triple {62330#false} assume !false; {62330#false} is VALID [2022-04-08 10:06:08,312 INFO L290 TraceCheckUtils]: 31: Hoare triple {62330#false} assume 0 == ~cond; {62330#false} is VALID [2022-04-08 10:06:08,312 INFO L290 TraceCheckUtils]: 30: Hoare triple {62330#false} ~cond := #in~cond; {62330#false} is VALID [2022-04-08 10:06:08,312 INFO L272 TraceCheckUtils]: 29: Hoare triple {62330#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {62330#false} is VALID [2022-04-08 10:06:08,312 INFO L290 TraceCheckUtils]: 28: Hoare triple {62330#false} assume !(~x~0 % 4294967296 > 0); {62330#false} is VALID [2022-04-08 10:06:08,312 INFO L290 TraceCheckUtils]: 27: Hoare triple {62330#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {62330#false} is VALID [2022-04-08 10:06:08,312 INFO L290 TraceCheckUtils]: 26: Hoare triple {62330#false} assume !(~y~0 % 4294967296 > 0); {62330#false} is VALID [2022-04-08 10:06:08,313 INFO L290 TraceCheckUtils]: 25: Hoare triple {62330#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {62330#false} is VALID [2022-04-08 10:06:08,313 INFO L290 TraceCheckUtils]: 24: Hoare triple {62330#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {62330#false} is VALID [2022-04-08 10:06:08,313 INFO L290 TraceCheckUtils]: 23: Hoare triple {62330#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {62330#false} is VALID [2022-04-08 10:06:08,313 INFO L290 TraceCheckUtils]: 22: Hoare triple {62330#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {62330#false} is VALID [2022-04-08 10:06:08,313 INFO L290 TraceCheckUtils]: 21: Hoare triple {62330#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {62330#false} is VALID [2022-04-08 10:06:08,313 INFO L290 TraceCheckUtils]: 20: Hoare triple {62330#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {62330#false} is VALID [2022-04-08 10:06:08,313 INFO L290 TraceCheckUtils]: 19: Hoare triple {62330#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {62330#false} is VALID [2022-04-08 10:06:08,313 INFO L290 TraceCheckUtils]: 18: Hoare triple {62330#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {62330#false} is VALID [2022-04-08 10:06:08,313 INFO L290 TraceCheckUtils]: 17: Hoare triple {62491#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {62330#false} is VALID [2022-04-08 10:06:08,314 INFO L290 TraceCheckUtils]: 16: Hoare triple {62495#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {62491#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:06:08,314 INFO L290 TraceCheckUtils]: 15: Hoare triple {62499#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {62495#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:08,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {62499#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {62499#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:08,315 INFO L290 TraceCheckUtils]: 13: Hoare triple {62506#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62499#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:08,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {62510#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62506#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:08,317 INFO L290 TraceCheckUtils]: 11: Hoare triple {62514#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62510#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:06:08,317 INFO L290 TraceCheckUtils]: 10: Hoare triple {62518#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62514#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:06:08,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {62522#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62518#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:06:08,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {62526#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62522#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:06:08,319 INFO L290 TraceCheckUtils]: 7: Hoare triple {62530#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62526#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:08,320 INFO L290 TraceCheckUtils]: 6: Hoare triple {62534#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {62530#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:06:08,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {62329#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {62534#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:08,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {62329#true} call #t~ret13 := main(); {62329#true} is VALID [2022-04-08 10:06:08,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62329#true} {62329#true} #72#return; {62329#true} is VALID [2022-04-08 10:06:08,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {62329#true} assume true; {62329#true} is VALID [2022-04-08 10:06:08,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {62329#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {62329#true} is VALID [2022-04-08 10:06:08,320 INFO L272 TraceCheckUtils]: 0: Hoare triple {62329#true} call ULTIMATE.init(); {62329#true} is VALID [2022-04-08 10:06:08,320 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-08 10:06:08,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271582123] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:08,321 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:08,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-08 10:06:08,321 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:08,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2015208872] [2022-04-08 10:06:08,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2015208872] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:08,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:08,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 10:06:08,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571705898] [2022-04-08 10:06:08,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:08,321 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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 33 [2022-04-08 10:06:08,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:08,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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-08 10:06:08,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:08,337 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 10:06:08,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:08,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 10:06:08,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2022-04-08 10:06:08,338 INFO L87 Difference]: Start difference. First operand 300 states and 409 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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-08 10:06:11,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:11,524 INFO L93 Difference]: Finished difference Result 411 states and 528 transitions. [2022-04-08 10:06:11,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-08 10:06:11,524 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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 33 [2022-04-08 10:06:11,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:11,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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-08 10:06:11,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 92 transitions. [2022-04-08 10:06:11,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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-08 10:06:11,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 92 transitions. [2022-04-08 10:06:11,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 92 transitions. [2022-04-08 10:06:11,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:11,578 INFO L225 Difference]: With dead ends: 411 [2022-04-08 10:06:11,578 INFO L226 Difference]: Without dead ends: 395 [2022-04-08 10:06:11,578 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=304, Invalid=1102, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 10:06:11,591 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 54 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:11,591 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 91 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:06:11,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-04-08 10:06:12,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 300. [2022-04-08 10:06:12,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:12,643 INFO L82 GeneralOperation]: Start isEquivalent. First operand 395 states. Second operand has 300 states, 295 states have (on average 1.3694915254237288) internal successors, (404), 295 states have internal predecessors, (404), 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-08 10:06:12,643 INFO L74 IsIncluded]: Start isIncluded. First operand 395 states. Second operand has 300 states, 295 states have (on average 1.3694915254237288) internal successors, (404), 295 states have internal predecessors, (404), 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-08 10:06:12,643 INFO L87 Difference]: Start difference. First operand 395 states. Second operand has 300 states, 295 states have (on average 1.3694915254237288) internal successors, (404), 295 states have internal predecessors, (404), 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-08 10:06:12,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:12,648 INFO L93 Difference]: Finished difference Result 395 states and 512 transitions. [2022-04-08 10:06:12,648 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 512 transitions. [2022-04-08 10:06:12,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:12,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:12,649 INFO L74 IsIncluded]: Start isIncluded. First operand has 300 states, 295 states have (on average 1.3694915254237288) internal successors, (404), 295 states have internal predecessors, (404), 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 395 states. [2022-04-08 10:06:12,649 INFO L87 Difference]: Start difference. First operand has 300 states, 295 states have (on average 1.3694915254237288) internal successors, (404), 295 states have internal predecessors, (404), 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 395 states. [2022-04-08 10:06:12,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:12,654 INFO L93 Difference]: Finished difference Result 395 states and 512 transitions. [2022-04-08 10:06:12,654 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 512 transitions. [2022-04-08 10:06:12,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:12,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:12,655 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:12,655 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:12,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 295 states have (on average 1.3694915254237288) internal successors, (404), 295 states have internal predecessors, (404), 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-08 10:06:12,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 408 transitions. [2022-04-08 10:06:12,659 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 408 transitions. Word has length 33 [2022-04-08 10:06:12,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:12,659 INFO L478 AbstractCegarLoop]: Abstraction has 300 states and 408 transitions. [2022-04-08 10:06:12,659 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 states have internal predecessors, (22), 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-08 10:06:12,659 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 300 states and 408 transitions. [2022-04-08 10:06:14,394 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 408 edges. 408 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:14,394 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 408 transitions. [2022-04-08 10:06:14,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 10:06:14,394 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:14,394 INFO L499 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:14,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-04-08 10:06:14,595 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2022-04-08 10:06:14,595 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:14,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:14,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1426067336, now seen corresponding path program 35 times [2022-04-08 10:06:14,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:14,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1415061091] [2022-04-08 10:06:14,597 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:14,598 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:14,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1426067336, now seen corresponding path program 36 times [2022-04-08 10:06:14,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:14,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822709242] [2022-04-08 10:06:14,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:14,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:14,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:14,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:14,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:14,996 INFO L290 TraceCheckUtils]: 0: Hoare triple {64816#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {64791#true} is VALID [2022-04-08 10:06:14,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {64791#true} assume true; {64791#true} is VALID [2022-04-08 10:06:14,996 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {64791#true} {64791#true} #72#return; {64791#true} is VALID [2022-04-08 10:06:14,996 INFO L272 TraceCheckUtils]: 0: Hoare triple {64791#true} call ULTIMATE.init(); {64816#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:14,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {64816#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {64791#true} is VALID [2022-04-08 10:06:14,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {64791#true} assume true; {64791#true} is VALID [2022-04-08 10:06:14,996 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64791#true} {64791#true} #72#return; {64791#true} is VALID [2022-04-08 10:06:14,997 INFO L272 TraceCheckUtils]: 4: Hoare triple {64791#true} call #t~ret13 := main(); {64791#true} is VALID [2022-04-08 10:06:14,997 INFO L290 TraceCheckUtils]: 5: Hoare triple {64791#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {64796#(= main_~y~0 0)} is VALID [2022-04-08 10:06:14,997 INFO L290 TraceCheckUtils]: 6: Hoare triple {64796#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64797#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:14,998 INFO L290 TraceCheckUtils]: 7: Hoare triple {64797#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64798#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:14,998 INFO L290 TraceCheckUtils]: 8: Hoare triple {64798#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64799#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:14,999 INFO L290 TraceCheckUtils]: 9: Hoare triple {64799#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64800#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:14,999 INFO L290 TraceCheckUtils]: 10: Hoare triple {64800#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64801#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:15,000 INFO L290 TraceCheckUtils]: 11: Hoare triple {64801#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64802#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:15,000 INFO L290 TraceCheckUtils]: 12: Hoare triple {64802#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64803#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:15,001 INFO L290 TraceCheckUtils]: 13: Hoare triple {64803#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64804#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:15,001 INFO L290 TraceCheckUtils]: 14: Hoare triple {64804#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64805#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:15,002 INFO L290 TraceCheckUtils]: 15: Hoare triple {64805#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64806#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:06:15,002 INFO L290 TraceCheckUtils]: 16: Hoare triple {64806#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64807#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:06:15,002 INFO L290 TraceCheckUtils]: 17: Hoare triple {64807#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64808#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:06:15,003 INFO L290 TraceCheckUtils]: 18: Hoare triple {64808#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64809#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:06:15,003 INFO L290 TraceCheckUtils]: 19: Hoare triple {64809#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64810#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:06:15,004 INFO L290 TraceCheckUtils]: 20: Hoare triple {64810#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64811#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:06:15,004 INFO L290 TraceCheckUtils]: 21: Hoare triple {64811#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64812#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:06:15,005 INFO L290 TraceCheckUtils]: 22: Hoare triple {64812#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64813#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:06:15,005 INFO L290 TraceCheckUtils]: 23: Hoare triple {64813#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64814#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:06:15,006 INFO L290 TraceCheckUtils]: 24: Hoare triple {64814#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !(~x~0 % 4294967296 > 0); {64814#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:06:15,006 INFO L290 TraceCheckUtils]: 25: Hoare triple {64814#(and (<= 18 main_~y~0) (<= main_~y~0 18))} ~z~0 := ~y~0; {64815#(and (<= (div main_~z~0 4294967296) 0) (<= 18 main_~z~0))} is VALID [2022-04-08 10:06:15,006 INFO L290 TraceCheckUtils]: 26: Hoare triple {64815#(and (<= (div main_~z~0 4294967296) 0) (<= 18 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {64792#false} is VALID [2022-04-08 10:06:15,007 INFO L290 TraceCheckUtils]: 27: Hoare triple {64792#false} assume !(~y~0 % 4294967296 > 0); {64792#false} is VALID [2022-04-08 10:06:15,007 INFO L290 TraceCheckUtils]: 28: Hoare triple {64792#false} assume !(~x~0 % 4294967296 > 0); {64792#false} is VALID [2022-04-08 10:06:15,007 INFO L272 TraceCheckUtils]: 29: Hoare triple {64792#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {64792#false} is VALID [2022-04-08 10:06:15,007 INFO L290 TraceCheckUtils]: 30: Hoare triple {64792#false} ~cond := #in~cond; {64792#false} is VALID [2022-04-08 10:06:15,007 INFO L290 TraceCheckUtils]: 31: Hoare triple {64792#false} assume 0 == ~cond; {64792#false} is VALID [2022-04-08 10:06:15,007 INFO L290 TraceCheckUtils]: 32: Hoare triple {64792#false} assume !false; {64792#false} is VALID [2022-04-08 10:06:15,007 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:06:15,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:15,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822709242] [2022-04-08 10:06:15,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822709242] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:15,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096850431] [2022-04-08 10:06:15,007 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:06:15,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:15,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:15,008 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:06:15,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-04-08 10:06:15,218 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-08 10:06:15,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:15,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-08 10:06:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:15,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:15,553 INFO L272 TraceCheckUtils]: 0: Hoare triple {64791#true} call ULTIMATE.init(); {64791#true} is VALID [2022-04-08 10:06:15,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {64791#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {64791#true} is VALID [2022-04-08 10:06:15,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {64791#true} assume true; {64791#true} is VALID [2022-04-08 10:06:15,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64791#true} {64791#true} #72#return; {64791#true} is VALID [2022-04-08 10:06:15,554 INFO L272 TraceCheckUtils]: 4: Hoare triple {64791#true} call #t~ret13 := main(); {64791#true} is VALID [2022-04-08 10:06:15,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {64791#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {64796#(= main_~y~0 0)} is VALID [2022-04-08 10:06:15,554 INFO L290 TraceCheckUtils]: 6: Hoare triple {64796#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64797#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:15,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {64797#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64798#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:15,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {64798#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64799#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:15,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {64799#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64800#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:15,556 INFO L290 TraceCheckUtils]: 10: Hoare triple {64800#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64801#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:15,557 INFO L290 TraceCheckUtils]: 11: Hoare triple {64801#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64802#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:15,557 INFO L290 TraceCheckUtils]: 12: Hoare triple {64802#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64803#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:15,558 INFO L290 TraceCheckUtils]: 13: Hoare triple {64803#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64804#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:15,558 INFO L290 TraceCheckUtils]: 14: Hoare triple {64804#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64805#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:15,559 INFO L290 TraceCheckUtils]: 15: Hoare triple {64805#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64806#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:06:15,559 INFO L290 TraceCheckUtils]: 16: Hoare triple {64806#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64807#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:06:15,560 INFO L290 TraceCheckUtils]: 17: Hoare triple {64807#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64808#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:06:15,560 INFO L290 TraceCheckUtils]: 18: Hoare triple {64808#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64809#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:06:15,561 INFO L290 TraceCheckUtils]: 19: Hoare triple {64809#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64810#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:06:15,561 INFO L290 TraceCheckUtils]: 20: Hoare triple {64810#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64811#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:06:15,562 INFO L290 TraceCheckUtils]: 21: Hoare triple {64811#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64812#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:06:15,562 INFO L290 TraceCheckUtils]: 22: Hoare triple {64812#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64813#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:06:15,563 INFO L290 TraceCheckUtils]: 23: Hoare triple {64813#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64814#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:06:15,563 INFO L290 TraceCheckUtils]: 24: Hoare triple {64814#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !(~x~0 % 4294967296 > 0); {64814#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:06:15,563 INFO L290 TraceCheckUtils]: 25: Hoare triple {64814#(and (<= 18 main_~y~0) (<= main_~y~0 18))} ~z~0 := ~y~0; {64895#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-08 10:06:15,564 INFO L290 TraceCheckUtils]: 26: Hoare triple {64895#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !(~z~0 % 4294967296 > 0); {64792#false} is VALID [2022-04-08 10:06:15,564 INFO L290 TraceCheckUtils]: 27: Hoare triple {64792#false} assume !(~y~0 % 4294967296 > 0); {64792#false} is VALID [2022-04-08 10:06:15,564 INFO L290 TraceCheckUtils]: 28: Hoare triple {64792#false} assume !(~x~0 % 4294967296 > 0); {64792#false} is VALID [2022-04-08 10:06:15,564 INFO L272 TraceCheckUtils]: 29: Hoare triple {64792#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {64792#false} is VALID [2022-04-08 10:06:15,564 INFO L290 TraceCheckUtils]: 30: Hoare triple {64792#false} ~cond := #in~cond; {64792#false} is VALID [2022-04-08 10:06:15,564 INFO L290 TraceCheckUtils]: 31: Hoare triple {64792#false} assume 0 == ~cond; {64792#false} is VALID [2022-04-08 10:06:15,564 INFO L290 TraceCheckUtils]: 32: Hoare triple {64792#false} assume !false; {64792#false} is VALID [2022-04-08 10:06:15,564 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:06:15,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:16,211 INFO L290 TraceCheckUtils]: 32: Hoare triple {64792#false} assume !false; {64792#false} is VALID [2022-04-08 10:06:16,211 INFO L290 TraceCheckUtils]: 31: Hoare triple {64792#false} assume 0 == ~cond; {64792#false} is VALID [2022-04-08 10:06:16,211 INFO L290 TraceCheckUtils]: 30: Hoare triple {64792#false} ~cond := #in~cond; {64792#false} is VALID [2022-04-08 10:06:16,211 INFO L272 TraceCheckUtils]: 29: Hoare triple {64792#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {64792#false} is VALID [2022-04-08 10:06:16,211 INFO L290 TraceCheckUtils]: 28: Hoare triple {64792#false} assume !(~x~0 % 4294967296 > 0); {64792#false} is VALID [2022-04-08 10:06:16,212 INFO L290 TraceCheckUtils]: 27: Hoare triple {64792#false} assume !(~y~0 % 4294967296 > 0); {64792#false} is VALID [2022-04-08 10:06:16,212 INFO L290 TraceCheckUtils]: 26: Hoare triple {64935#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {64792#false} is VALID [2022-04-08 10:06:16,212 INFO L290 TraceCheckUtils]: 25: Hoare triple {64939#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {64935#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:06:16,212 INFO L290 TraceCheckUtils]: 24: Hoare triple {64939#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {64939#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:16,213 INFO L290 TraceCheckUtils]: 23: Hoare triple {64946#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64939#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:16,214 INFO L290 TraceCheckUtils]: 22: Hoare triple {64950#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64946#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:06:16,214 INFO L290 TraceCheckUtils]: 21: Hoare triple {64954#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64950#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:06:16,215 INFO L290 TraceCheckUtils]: 20: Hoare triple {64958#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64954#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:06:16,215 INFO L290 TraceCheckUtils]: 19: Hoare triple {64962#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64958#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:06:16,216 INFO L290 TraceCheckUtils]: 18: Hoare triple {64966#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64962#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:16,217 INFO L290 TraceCheckUtils]: 17: Hoare triple {64970#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64966#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:06:16,217 INFO L290 TraceCheckUtils]: 16: Hoare triple {64974#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64970#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:16,218 INFO L290 TraceCheckUtils]: 15: Hoare triple {64978#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64974#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:06:16,218 INFO L290 TraceCheckUtils]: 14: Hoare triple {64982#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64978#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:06:16,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {64986#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64982#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:06:16,220 INFO L290 TraceCheckUtils]: 12: Hoare triple {64990#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64986#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:06:16,220 INFO L290 TraceCheckUtils]: 11: Hoare triple {64994#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64990#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:06:16,221 INFO L290 TraceCheckUtils]: 10: Hoare triple {64998#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64994#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:06:16,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {65002#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {64998#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:06:16,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {65006#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65002#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:06:16,222 INFO L290 TraceCheckUtils]: 7: Hoare triple {65010#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65006#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:06:16,223 INFO L290 TraceCheckUtils]: 6: Hoare triple {65014#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {65010#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:06:16,223 INFO L290 TraceCheckUtils]: 5: Hoare triple {64791#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {65014#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-08 10:06:16,223 INFO L272 TraceCheckUtils]: 4: Hoare triple {64791#true} call #t~ret13 := main(); {64791#true} is VALID [2022-04-08 10:06:16,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64791#true} {64791#true} #72#return; {64791#true} is VALID [2022-04-08 10:06:16,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {64791#true} assume true; {64791#true} is VALID [2022-04-08 10:06:16,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {64791#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {64791#true} is VALID [2022-04-08 10:06:16,224 INFO L272 TraceCheckUtils]: 0: Hoare triple {64791#true} call ULTIMATE.init(); {64791#true} is VALID [2022-04-08 10:06:16,224 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:06:16,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096850431] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:16,224 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:16,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-08 10:06:16,224 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:16,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1415061091] [2022-04-08 10:06:16,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1415061091] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:16,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:16,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-08 10:06:16,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687851359] [2022-04-08 10:06:16,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:16,225 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 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 33 [2022-04-08 10:06:16,225 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:16,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 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-08 10:06:16,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:16,244 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-08 10:06:16,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:16,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-08 10:06:16,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=448, Invalid=1444, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 10:06:16,245 INFO L87 Difference]: Start difference. First operand 300 states and 408 transitions. Second operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 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-08 10:06:23,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:23,392 INFO L93 Difference]: Finished difference Result 531 states and 808 transitions. [2022-04-08 10:06:23,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-08 10:06:23,392 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 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 33 [2022-04-08 10:06:23,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:23,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 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-08 10:06:23,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 199 transitions. [2022-04-08 10:06:23,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 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-08 10:06:23,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 199 transitions. [2022-04-08 10:06:23,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 199 transitions. [2022-04-08 10:06:23,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:23,504 INFO L225 Difference]: With dead ends: 531 [2022-04-08 10:06:23,504 INFO L226 Difference]: Without dead ends: 506 [2022-04-08 10:06:23,504 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=910, Invalid=3122, Unknown=0, NotChecked=0, Total=4032 [2022-04-08 10:06:23,504 INFO L913 BasicCegarLoop]: 88 mSDtfsCounter, 146 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 3043 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 3146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 3043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:23,504 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 190 Invalid, 3146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 3043 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-08 10:06:23,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2022-04-08 10:06:24,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 317. [2022-04-08 10:06:24,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:24,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 506 states. Second operand has 317 states, 312 states have (on average 1.375) internal successors, (429), 312 states have internal predecessors, (429), 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-08 10:06:24,325 INFO L74 IsIncluded]: Start isIncluded. First operand 506 states. Second operand has 317 states, 312 states have (on average 1.375) internal successors, (429), 312 states have internal predecessors, (429), 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-08 10:06:24,325 INFO L87 Difference]: Start difference. First operand 506 states. Second operand has 317 states, 312 states have (on average 1.375) internal successors, (429), 312 states have internal predecessors, (429), 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-08 10:06:24,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:24,333 INFO L93 Difference]: Finished difference Result 506 states and 641 transitions. [2022-04-08 10:06:24,333 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 641 transitions. [2022-04-08 10:06:24,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:24,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:24,333 INFO L74 IsIncluded]: Start isIncluded. First operand has 317 states, 312 states have (on average 1.375) internal successors, (429), 312 states have internal predecessors, (429), 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 506 states. [2022-04-08 10:06:24,333 INFO L87 Difference]: Start difference. First operand has 317 states, 312 states have (on average 1.375) internal successors, (429), 312 states have internal predecessors, (429), 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 506 states. [2022-04-08 10:06:24,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:24,341 INFO L93 Difference]: Finished difference Result 506 states and 641 transitions. [2022-04-08 10:06:24,341 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 641 transitions. [2022-04-08 10:06:24,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:24,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:24,342 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:24,342 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:24,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 312 states have (on average 1.375) internal successors, (429), 312 states have internal predecessors, (429), 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-08 10:06:24,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 433 transitions. [2022-04-08 10:06:24,346 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 433 transitions. Word has length 33 [2022-04-08 10:06:24,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:24,346 INFO L478 AbstractCegarLoop]: Abstraction has 317 states and 433 transitions. [2022-04-08 10:06:24,347 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 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-08 10:06:24,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 317 states and 433 transitions. [2022-04-08 10:06:27,205 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 433 edges. 433 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:27,205 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 433 transitions. [2022-04-08 10:06:27,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 10:06:27,206 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:27,206 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:27,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-04-08 10:06:27,406 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:27,406 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:27,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:27,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1901015744, now seen corresponding path program 23 times [2022-04-08 10:06:27,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:27,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [200822039] [2022-04-08 10:06:27,409 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:27,409 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:27,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1901015744, now seen corresponding path program 24 times [2022-04-08 10:06:27,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:27,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986774964] [2022-04-08 10:06:27,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:27,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:27,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:27,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:27,607 INFO L290 TraceCheckUtils]: 0: Hoare triple {67802#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {67783#true} is VALID [2022-04-08 10:06:27,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {67783#true} assume true; {67783#true} is VALID [2022-04-08 10:06:27,608 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67783#true} {67783#true} #72#return; {67783#true} is VALID [2022-04-08 10:06:27,608 INFO L272 TraceCheckUtils]: 0: Hoare triple {67783#true} call ULTIMATE.init(); {67802#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:27,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {67802#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {67783#true} is VALID [2022-04-08 10:06:27,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {67783#true} assume true; {67783#true} is VALID [2022-04-08 10:06:27,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67783#true} {67783#true} #72#return; {67783#true} is VALID [2022-04-08 10:06:27,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {67783#true} call #t~ret13 := main(); {67783#true} is VALID [2022-04-08 10:06:27,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {67783#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {67788#(= main_~y~0 0)} is VALID [2022-04-08 10:06:27,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {67788#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67789#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:27,609 INFO L290 TraceCheckUtils]: 7: Hoare triple {67789#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67790#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:27,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {67790#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67791#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:27,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {67791#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67792#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:27,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {67792#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67793#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:27,611 INFO L290 TraceCheckUtils]: 11: Hoare triple {67793#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67794#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:27,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {67794#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {67794#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:27,612 INFO L290 TraceCheckUtils]: 13: Hoare triple {67794#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {67795#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:06:27,612 INFO L290 TraceCheckUtils]: 14: Hoare triple {67795#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67796#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:06:27,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {67796#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67797#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:06:27,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {67797#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67798#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:06:27,614 INFO L290 TraceCheckUtils]: 17: Hoare triple {67798#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67799#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:06:27,614 INFO L290 TraceCheckUtils]: 18: Hoare triple {67799#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67800#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:06:27,614 INFO L290 TraceCheckUtils]: 19: Hoare triple {67800#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67801#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:06:27,615 INFO L290 TraceCheckUtils]: 20: Hoare triple {67801#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67784#false} is VALID [2022-04-08 10:06:27,615 INFO L290 TraceCheckUtils]: 21: Hoare triple {67784#false} assume !(~z~0 % 4294967296 > 0); {67784#false} is VALID [2022-04-08 10:06:27,615 INFO L290 TraceCheckUtils]: 22: Hoare triple {67784#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67784#false} is VALID [2022-04-08 10:06:27,615 INFO L290 TraceCheckUtils]: 23: Hoare triple {67784#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67784#false} is VALID [2022-04-08 10:06:27,615 INFO L290 TraceCheckUtils]: 24: Hoare triple {67784#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67784#false} is VALID [2022-04-08 10:06:27,615 INFO L290 TraceCheckUtils]: 25: Hoare triple {67784#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67784#false} is VALID [2022-04-08 10:06:27,615 INFO L290 TraceCheckUtils]: 26: Hoare triple {67784#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67784#false} is VALID [2022-04-08 10:06:27,615 INFO L290 TraceCheckUtils]: 27: Hoare triple {67784#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67784#false} is VALID [2022-04-08 10:06:27,615 INFO L290 TraceCheckUtils]: 28: Hoare triple {67784#false} assume !(~y~0 % 4294967296 > 0); {67784#false} is VALID [2022-04-08 10:06:27,615 INFO L290 TraceCheckUtils]: 29: Hoare triple {67784#false} assume !(~x~0 % 4294967296 > 0); {67784#false} is VALID [2022-04-08 10:06:27,615 INFO L272 TraceCheckUtils]: 30: Hoare triple {67784#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {67784#false} is VALID [2022-04-08 10:06:27,615 INFO L290 TraceCheckUtils]: 31: Hoare triple {67784#false} ~cond := #in~cond; {67784#false} is VALID [2022-04-08 10:06:27,615 INFO L290 TraceCheckUtils]: 32: Hoare triple {67784#false} assume 0 == ~cond; {67784#false} is VALID [2022-04-08 10:06:27,616 INFO L290 TraceCheckUtils]: 33: Hoare triple {67784#false} assume !false; {67784#false} is VALID [2022-04-08 10:06:27,616 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-08 10:06:27,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:27,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986774964] [2022-04-08 10:06:27,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986774964] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:27,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237470519] [2022-04-08 10:06:27,616 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:06:27,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:27,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:27,617 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:06:27,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-04-08 10:06:27,673 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 10:06:27,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:27,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-08 10:06:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:27,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:27,916 INFO L272 TraceCheckUtils]: 0: Hoare triple {67783#true} call ULTIMATE.init(); {67783#true} is VALID [2022-04-08 10:06:27,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {67783#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {67783#true} is VALID [2022-04-08 10:06:27,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {67783#true} assume true; {67783#true} is VALID [2022-04-08 10:06:27,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67783#true} {67783#true} #72#return; {67783#true} is VALID [2022-04-08 10:06:27,916 INFO L272 TraceCheckUtils]: 4: Hoare triple {67783#true} call #t~ret13 := main(); {67783#true} is VALID [2022-04-08 10:06:27,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {67783#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {67788#(= main_~y~0 0)} is VALID [2022-04-08 10:06:27,917 INFO L290 TraceCheckUtils]: 6: Hoare triple {67788#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67789#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:27,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {67789#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67790#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:27,918 INFO L290 TraceCheckUtils]: 8: Hoare triple {67790#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67791#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:27,918 INFO L290 TraceCheckUtils]: 9: Hoare triple {67791#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67792#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:27,918 INFO L290 TraceCheckUtils]: 10: Hoare triple {67792#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67793#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:27,919 INFO L290 TraceCheckUtils]: 11: Hoare triple {67793#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67794#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:27,919 INFO L290 TraceCheckUtils]: 12: Hoare triple {67794#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {67794#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:27,919 INFO L290 TraceCheckUtils]: 13: Hoare triple {67794#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {67845#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:27,920 INFO L290 TraceCheckUtils]: 14: Hoare triple {67845#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67849#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:06:27,920 INFO L290 TraceCheckUtils]: 15: Hoare triple {67849#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67853#(and (<= main_~y~0 6) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:27,921 INFO L290 TraceCheckUtils]: 16: Hoare triple {67853#(and (<= main_~y~0 6) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67857#(and (<= main_~y~0 6) (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:27,921 INFO L290 TraceCheckUtils]: 17: Hoare triple {67857#(and (<= main_~y~0 6) (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67861#(and (= (+ main_~z~0 3) (+ (- 1) main_~y~0)) (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:27,922 INFO L290 TraceCheckUtils]: 18: Hoare triple {67861#(and (= (+ main_~z~0 3) (+ (- 1) main_~y~0)) (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67865#(and (<= main_~y~0 6) (= (+ (- 1) main_~y~0) (+ main_~z~0 4)) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:27,922 INFO L290 TraceCheckUtils]: 19: Hoare triple {67865#(and (<= main_~y~0 6) (= (+ (- 1) main_~y~0) (+ main_~z~0 4)) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67869#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:27,923 INFO L290 TraceCheckUtils]: 20: Hoare triple {67869#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67784#false} is VALID [2022-04-08 10:06:27,923 INFO L290 TraceCheckUtils]: 21: Hoare triple {67784#false} assume !(~z~0 % 4294967296 > 0); {67784#false} is VALID [2022-04-08 10:06:27,923 INFO L290 TraceCheckUtils]: 22: Hoare triple {67784#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67784#false} is VALID [2022-04-08 10:06:27,923 INFO L290 TraceCheckUtils]: 23: Hoare triple {67784#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67784#false} is VALID [2022-04-08 10:06:27,923 INFO L290 TraceCheckUtils]: 24: Hoare triple {67784#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67784#false} is VALID [2022-04-08 10:06:27,923 INFO L290 TraceCheckUtils]: 25: Hoare triple {67784#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67784#false} is VALID [2022-04-08 10:06:27,923 INFO L290 TraceCheckUtils]: 26: Hoare triple {67784#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67784#false} is VALID [2022-04-08 10:06:27,923 INFO L290 TraceCheckUtils]: 27: Hoare triple {67784#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67784#false} is VALID [2022-04-08 10:06:27,923 INFO L290 TraceCheckUtils]: 28: Hoare triple {67784#false} assume !(~y~0 % 4294967296 > 0); {67784#false} is VALID [2022-04-08 10:06:27,923 INFO L290 TraceCheckUtils]: 29: Hoare triple {67784#false} assume !(~x~0 % 4294967296 > 0); {67784#false} is VALID [2022-04-08 10:06:27,923 INFO L272 TraceCheckUtils]: 30: Hoare triple {67784#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {67784#false} is VALID [2022-04-08 10:06:27,924 INFO L290 TraceCheckUtils]: 31: Hoare triple {67784#false} ~cond := #in~cond; {67784#false} is VALID [2022-04-08 10:06:27,924 INFO L290 TraceCheckUtils]: 32: Hoare triple {67784#false} assume 0 == ~cond; {67784#false} is VALID [2022-04-08 10:06:27,924 INFO L290 TraceCheckUtils]: 33: Hoare triple {67784#false} assume !false; {67784#false} is VALID [2022-04-08 10:06:27,924 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-08 10:06:27,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:28,354 INFO L290 TraceCheckUtils]: 33: Hoare triple {67784#false} assume !false; {67784#false} is VALID [2022-04-08 10:06:28,355 INFO L290 TraceCheckUtils]: 32: Hoare triple {67784#false} assume 0 == ~cond; {67784#false} is VALID [2022-04-08 10:06:28,355 INFO L290 TraceCheckUtils]: 31: Hoare triple {67784#false} ~cond := #in~cond; {67784#false} is VALID [2022-04-08 10:06:28,355 INFO L272 TraceCheckUtils]: 30: Hoare triple {67784#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {67784#false} is VALID [2022-04-08 10:06:28,355 INFO L290 TraceCheckUtils]: 29: Hoare triple {67784#false} assume !(~x~0 % 4294967296 > 0); {67784#false} is VALID [2022-04-08 10:06:28,355 INFO L290 TraceCheckUtils]: 28: Hoare triple {67927#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {67784#false} is VALID [2022-04-08 10:06:28,356 INFO L290 TraceCheckUtils]: 27: Hoare triple {67931#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67927#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:28,357 INFO L290 TraceCheckUtils]: 26: Hoare triple {67935#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67931#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:06:28,358 INFO L290 TraceCheckUtils]: 25: Hoare triple {67939#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67935#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:06:28,358 INFO L290 TraceCheckUtils]: 24: Hoare triple {67943#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67939#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:06:28,359 INFO L290 TraceCheckUtils]: 23: Hoare triple {67947#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67943#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:28,359 INFO L290 TraceCheckUtils]: 22: Hoare triple {67951#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {67947#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:28,360 INFO L290 TraceCheckUtils]: 21: Hoare triple {67951#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {67951#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:28,360 INFO L290 TraceCheckUtils]: 20: Hoare triple {67958#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67951#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:28,361 INFO L290 TraceCheckUtils]: 19: Hoare triple {67962#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67958#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:06:28,362 INFO L290 TraceCheckUtils]: 18: Hoare triple {67966#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67962#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:06:28,363 INFO L290 TraceCheckUtils]: 17: Hoare triple {67970#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67966#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:06:28,364 INFO L290 TraceCheckUtils]: 16: Hoare triple {67974#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67970#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:06:28,364 INFO L290 TraceCheckUtils]: 15: Hoare triple {67978#(or (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67974#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:06:28,365 INFO L290 TraceCheckUtils]: 14: Hoare triple {67982#(or (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67978#(or (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-08 10:06:28,365 INFO L290 TraceCheckUtils]: 13: Hoare triple {67783#true} ~z~0 := ~y~0; {67982#(or (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-08 10:06:28,365 INFO L290 TraceCheckUtils]: 12: Hoare triple {67783#true} assume !(~x~0 % 4294967296 > 0); {67783#true} is VALID [2022-04-08 10:06:28,365 INFO L290 TraceCheckUtils]: 11: Hoare triple {67783#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67783#true} is VALID [2022-04-08 10:06:28,366 INFO L290 TraceCheckUtils]: 10: Hoare triple {67783#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67783#true} is VALID [2022-04-08 10:06:28,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {67783#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67783#true} is VALID [2022-04-08 10:06:28,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {67783#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67783#true} is VALID [2022-04-08 10:06:28,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {67783#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67783#true} is VALID [2022-04-08 10:06:28,366 INFO L290 TraceCheckUtils]: 6: Hoare triple {67783#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {67783#true} is VALID [2022-04-08 10:06:28,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {67783#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {67783#true} is VALID [2022-04-08 10:06:28,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {67783#true} call #t~ret13 := main(); {67783#true} is VALID [2022-04-08 10:06:28,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67783#true} {67783#true} #72#return; {67783#true} is VALID [2022-04-08 10:06:28,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {67783#true} assume true; {67783#true} is VALID [2022-04-08 10:06:28,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {67783#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {67783#true} is VALID [2022-04-08 10:06:28,366 INFO L272 TraceCheckUtils]: 0: Hoare triple {67783#true} call ULTIMATE.init(); {67783#true} is VALID [2022-04-08 10:06:28,366 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-08 10:06:28,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237470519] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:28,366 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:28,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 38 [2022-04-08 10:06:28,366 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:28,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [200822039] [2022-04-08 10:06:28,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [200822039] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:28,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:28,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 10:06:28,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723272597] [2022-04-08 10:06:28,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:28,367 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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 34 [2022-04-08 10:06:28,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:28,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-08 10:06:28,385 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-08 10:06:28,385 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 10:06:28,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:28,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 10:06:28,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1172, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 10:06:28,386 INFO L87 Difference]: Start difference. First operand 317 states and 433 transitions. Second operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-08 10:06:32,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:32,310 INFO L93 Difference]: Finished difference Result 388 states and 509 transitions. [2022-04-08 10:06:32,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-08 10:06:32,310 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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 34 [2022-04-08 10:06:32,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:32,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-08 10:06:32,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 95 transitions. [2022-04-08 10:06:32,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-08 10:06:32,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 95 transitions. [2022-04-08 10:06:32,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 95 transitions. [2022-04-08 10:06:32,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:32,370 INFO L225 Difference]: With dead ends: 388 [2022-04-08 10:06:32,370 INFO L226 Difference]: Without dead ends: 350 [2022-04-08 10:06:32,371 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=924, Invalid=5082, Unknown=0, NotChecked=0, Total=6006 [2022-04-08 10:06:32,371 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 40 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:32,371 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 91 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 10:06:32,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2022-04-08 10:06:33,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 316. [2022-04-08 10:06:33,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:33,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 350 states. Second operand has 316 states, 311 states have (on average 1.3633440514469453) internal successors, (424), 311 states have internal predecessors, (424), 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-08 10:06:33,225 INFO L74 IsIncluded]: Start isIncluded. First operand 350 states. Second operand has 316 states, 311 states have (on average 1.3633440514469453) internal successors, (424), 311 states have internal predecessors, (424), 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-08 10:06:33,226 INFO L87 Difference]: Start difference. First operand 350 states. Second operand has 316 states, 311 states have (on average 1.3633440514469453) internal successors, (424), 311 states have internal predecessors, (424), 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-08 10:06:33,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:33,230 INFO L93 Difference]: Finished difference Result 350 states and 467 transitions. [2022-04-08 10:06:33,230 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 467 transitions. [2022-04-08 10:06:33,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:33,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:33,230 INFO L74 IsIncluded]: Start isIncluded. First operand has 316 states, 311 states have (on average 1.3633440514469453) internal successors, (424), 311 states have internal predecessors, (424), 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 350 states. [2022-04-08 10:06:33,230 INFO L87 Difference]: Start difference. First operand has 316 states, 311 states have (on average 1.3633440514469453) internal successors, (424), 311 states have internal predecessors, (424), 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 350 states. [2022-04-08 10:06:33,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:33,234 INFO L93 Difference]: Finished difference Result 350 states and 467 transitions. [2022-04-08 10:06:33,234 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 467 transitions. [2022-04-08 10:06:33,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:33,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:33,234 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:33,234 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:33,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 311 states have (on average 1.3633440514469453) internal successors, (424), 311 states have internal predecessors, (424), 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-08 10:06:33,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 428 transitions. [2022-04-08 10:06:33,239 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 428 transitions. Word has length 34 [2022-04-08 10:06:33,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:33,239 INFO L478 AbstractCegarLoop]: Abstraction has 316 states and 428 transitions. [2022-04-08 10:06:33,239 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-08 10:06:33,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 316 states and 428 transitions. [2022-04-08 10:06:34,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 428 edges. 428 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:34,632 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 428 transitions. [2022-04-08 10:06:34,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 10:06:34,632 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:34,632 INFO L499 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:34,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-04-08 10:06:34,847 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-04-08 10:06:34,847 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:34,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:34,848 INFO L85 PathProgramCache]: Analyzing trace with hash -221709503, now seen corresponding path program 37 times [2022-04-08 10:06:34,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:34,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1101614099] [2022-04-08 10:06:34,849 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:34,849 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:34,849 INFO L85 PathProgramCache]: Analyzing trace with hash -221709503, now seen corresponding path program 38 times [2022-04-08 10:06:34,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:34,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595339376] [2022-04-08 10:06:34,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:34,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:34,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:35,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:35,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:35,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {70241#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {70215#true} is VALID [2022-04-08 10:06:35,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {70215#true} assume true; {70215#true} is VALID [2022-04-08 10:06:35,195 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70215#true} {70215#true} #72#return; {70215#true} is VALID [2022-04-08 10:06:35,195 INFO L272 TraceCheckUtils]: 0: Hoare triple {70215#true} call ULTIMATE.init(); {70241#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:35,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {70241#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {70215#true} is VALID [2022-04-08 10:06:35,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {70215#true} assume true; {70215#true} is VALID [2022-04-08 10:06:35,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70215#true} {70215#true} #72#return; {70215#true} is VALID [2022-04-08 10:06:35,196 INFO L272 TraceCheckUtils]: 4: Hoare triple {70215#true} call #t~ret13 := main(); {70215#true} is VALID [2022-04-08 10:06:35,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {70215#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {70220#(= main_~y~0 0)} is VALID [2022-04-08 10:06:35,196 INFO L290 TraceCheckUtils]: 6: Hoare triple {70220#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70221#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:35,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {70221#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70222#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:35,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {70222#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70223#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:35,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {70223#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70224#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:35,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {70224#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70225#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:35,199 INFO L290 TraceCheckUtils]: 11: Hoare triple {70225#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70226#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:35,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {70226#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70227#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:35,200 INFO L290 TraceCheckUtils]: 13: Hoare triple {70227#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70228#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:35,200 INFO L290 TraceCheckUtils]: 14: Hoare triple {70228#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70229#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:35,201 INFO L290 TraceCheckUtils]: 15: Hoare triple {70229#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70230#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:06:35,201 INFO L290 TraceCheckUtils]: 16: Hoare triple {70230#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70231#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:06:35,202 INFO L290 TraceCheckUtils]: 17: Hoare triple {70231#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70232#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:06:35,202 INFO L290 TraceCheckUtils]: 18: Hoare triple {70232#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70233#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:06:35,203 INFO L290 TraceCheckUtils]: 19: Hoare triple {70233#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70234#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:06:35,203 INFO L290 TraceCheckUtils]: 20: Hoare triple {70234#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70235#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:06:35,204 INFO L290 TraceCheckUtils]: 21: Hoare triple {70235#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70236#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:06:35,204 INFO L290 TraceCheckUtils]: 22: Hoare triple {70236#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70237#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:06:35,205 INFO L290 TraceCheckUtils]: 23: Hoare triple {70237#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70238#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:06:35,205 INFO L290 TraceCheckUtils]: 24: Hoare triple {70238#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70239#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:06:35,205 INFO L290 TraceCheckUtils]: 25: Hoare triple {70239#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !(~x~0 % 4294967296 > 0); {70239#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:06:35,206 INFO L290 TraceCheckUtils]: 26: Hoare triple {70239#(and (<= 19 main_~y~0) (<= main_~y~0 19))} ~z~0 := ~y~0; {70240#(and (<= 19 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:06:35,206 INFO L290 TraceCheckUtils]: 27: Hoare triple {70240#(and (<= 19 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {70216#false} is VALID [2022-04-08 10:06:35,206 INFO L290 TraceCheckUtils]: 28: Hoare triple {70216#false} assume !(~y~0 % 4294967296 > 0); {70216#false} is VALID [2022-04-08 10:06:35,206 INFO L290 TraceCheckUtils]: 29: Hoare triple {70216#false} assume !(~x~0 % 4294967296 > 0); {70216#false} is VALID [2022-04-08 10:06:35,206 INFO L272 TraceCheckUtils]: 30: Hoare triple {70216#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {70216#false} is VALID [2022-04-08 10:06:35,207 INFO L290 TraceCheckUtils]: 31: Hoare triple {70216#false} ~cond := #in~cond; {70216#false} is VALID [2022-04-08 10:06:35,207 INFO L290 TraceCheckUtils]: 32: Hoare triple {70216#false} assume 0 == ~cond; {70216#false} is VALID [2022-04-08 10:06:35,207 INFO L290 TraceCheckUtils]: 33: Hoare triple {70216#false} assume !false; {70216#false} is VALID [2022-04-08 10:06:35,207 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:06:35,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:35,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595339376] [2022-04-08 10:06:35,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595339376] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:35,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414951277] [2022-04-08 10:06:35,207 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:06:35,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:35,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:35,208 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:06:35,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-04-08 10:06:35,256 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:06:35,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:35,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-08 10:06:35,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:35,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:35,596 INFO L272 TraceCheckUtils]: 0: Hoare triple {70215#true} call ULTIMATE.init(); {70215#true} is VALID [2022-04-08 10:06:35,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {70215#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {70215#true} is VALID [2022-04-08 10:06:35,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {70215#true} assume true; {70215#true} is VALID [2022-04-08 10:06:35,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70215#true} {70215#true} #72#return; {70215#true} is VALID [2022-04-08 10:06:35,597 INFO L272 TraceCheckUtils]: 4: Hoare triple {70215#true} call #t~ret13 := main(); {70215#true} is VALID [2022-04-08 10:06:35,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {70215#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {70220#(= main_~y~0 0)} is VALID [2022-04-08 10:06:35,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {70220#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70221#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:35,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {70221#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70222#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:35,599 INFO L290 TraceCheckUtils]: 8: Hoare triple {70222#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70223#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:06:35,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {70223#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70224#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:06:35,600 INFO L290 TraceCheckUtils]: 10: Hoare triple {70224#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70225#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:35,600 INFO L290 TraceCheckUtils]: 11: Hoare triple {70225#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70226#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:06:35,601 INFO L290 TraceCheckUtils]: 12: Hoare triple {70226#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70227#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:06:35,601 INFO L290 TraceCheckUtils]: 13: Hoare triple {70227#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70228#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:06:35,601 INFO L290 TraceCheckUtils]: 14: Hoare triple {70228#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70229#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:06:35,602 INFO L290 TraceCheckUtils]: 15: Hoare triple {70229#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70230#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:06:35,602 INFO L290 TraceCheckUtils]: 16: Hoare triple {70230#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70231#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:06:35,603 INFO L290 TraceCheckUtils]: 17: Hoare triple {70231#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70232#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:06:35,603 INFO L290 TraceCheckUtils]: 18: Hoare triple {70232#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70233#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:06:35,604 INFO L290 TraceCheckUtils]: 19: Hoare triple {70233#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70234#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:06:35,604 INFO L290 TraceCheckUtils]: 20: Hoare triple {70234#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70235#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:06:35,605 INFO L290 TraceCheckUtils]: 21: Hoare triple {70235#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70236#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:06:35,605 INFO L290 TraceCheckUtils]: 22: Hoare triple {70236#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70237#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:06:35,606 INFO L290 TraceCheckUtils]: 23: Hoare triple {70237#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70238#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:06:35,606 INFO L290 TraceCheckUtils]: 24: Hoare triple {70238#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70239#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:06:35,607 INFO L290 TraceCheckUtils]: 25: Hoare triple {70239#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !(~x~0 % 4294967296 > 0); {70239#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:06:35,607 INFO L290 TraceCheckUtils]: 26: Hoare triple {70239#(and (<= 19 main_~y~0) (<= main_~y~0 19))} ~z~0 := ~y~0; {70323#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-08 10:06:35,607 INFO L290 TraceCheckUtils]: 27: Hoare triple {70323#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !(~z~0 % 4294967296 > 0); {70216#false} is VALID [2022-04-08 10:06:35,608 INFO L290 TraceCheckUtils]: 28: Hoare triple {70216#false} assume !(~y~0 % 4294967296 > 0); {70216#false} is VALID [2022-04-08 10:06:35,608 INFO L290 TraceCheckUtils]: 29: Hoare triple {70216#false} assume !(~x~0 % 4294967296 > 0); {70216#false} is VALID [2022-04-08 10:06:35,608 INFO L272 TraceCheckUtils]: 30: Hoare triple {70216#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {70216#false} is VALID [2022-04-08 10:06:35,608 INFO L290 TraceCheckUtils]: 31: Hoare triple {70216#false} ~cond := #in~cond; {70216#false} is VALID [2022-04-08 10:06:35,608 INFO L290 TraceCheckUtils]: 32: Hoare triple {70216#false} assume 0 == ~cond; {70216#false} is VALID [2022-04-08 10:06:35,608 INFO L290 TraceCheckUtils]: 33: Hoare triple {70216#false} assume !false; {70216#false} is VALID [2022-04-08 10:06:35,608 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:06:35,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:36,293 INFO L290 TraceCheckUtils]: 33: Hoare triple {70216#false} assume !false; {70216#false} is VALID [2022-04-08 10:06:36,293 INFO L290 TraceCheckUtils]: 32: Hoare triple {70216#false} assume 0 == ~cond; {70216#false} is VALID [2022-04-08 10:06:36,293 INFO L290 TraceCheckUtils]: 31: Hoare triple {70216#false} ~cond := #in~cond; {70216#false} is VALID [2022-04-08 10:06:36,293 INFO L272 TraceCheckUtils]: 30: Hoare triple {70216#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {70216#false} is VALID [2022-04-08 10:06:36,294 INFO L290 TraceCheckUtils]: 29: Hoare triple {70216#false} assume !(~x~0 % 4294967296 > 0); {70216#false} is VALID [2022-04-08 10:06:36,294 INFO L290 TraceCheckUtils]: 28: Hoare triple {70216#false} assume !(~y~0 % 4294967296 > 0); {70216#false} is VALID [2022-04-08 10:06:36,294 INFO L290 TraceCheckUtils]: 27: Hoare triple {70363#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {70216#false} is VALID [2022-04-08 10:06:36,294 INFO L290 TraceCheckUtils]: 26: Hoare triple {70367#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {70363#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:06:36,294 INFO L290 TraceCheckUtils]: 25: Hoare triple {70367#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {70367#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:36,295 INFO L290 TraceCheckUtils]: 24: Hoare triple {70374#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70367#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:06:36,295 INFO L290 TraceCheckUtils]: 23: Hoare triple {70378#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70374#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:06:36,296 INFO L290 TraceCheckUtils]: 22: Hoare triple {70382#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70378#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:06:36,297 INFO L290 TraceCheckUtils]: 21: Hoare triple {70386#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70382#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:06:36,297 INFO L290 TraceCheckUtils]: 20: Hoare triple {70390#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70386#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:06:36,298 INFO L290 TraceCheckUtils]: 19: Hoare triple {70394#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70390#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:36,298 INFO L290 TraceCheckUtils]: 18: Hoare triple {70398#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70394#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:06:36,299 INFO L290 TraceCheckUtils]: 17: Hoare triple {70402#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70398#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:36,299 INFO L290 TraceCheckUtils]: 16: Hoare triple {70406#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70402#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:06:36,300 INFO L290 TraceCheckUtils]: 15: Hoare triple {70410#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70406#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:06:36,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {70414#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70410#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:06:36,301 INFO L290 TraceCheckUtils]: 13: Hoare triple {70418#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70414#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:06:36,301 INFO L290 TraceCheckUtils]: 12: Hoare triple {70422#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70418#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:06:36,302 INFO L290 TraceCheckUtils]: 11: Hoare triple {70426#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70422#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:06:36,302 INFO L290 TraceCheckUtils]: 10: Hoare triple {70430#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70426#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:06:36,303 INFO L290 TraceCheckUtils]: 9: Hoare triple {70434#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70430#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:06:36,303 INFO L290 TraceCheckUtils]: 8: Hoare triple {70438#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70434#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:06:36,304 INFO L290 TraceCheckUtils]: 7: Hoare triple {70442#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70438#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:06:36,304 INFO L290 TraceCheckUtils]: 6: Hoare triple {70446#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {70442#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-08 10:06:36,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {70215#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {70446#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-08 10:06:36,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {70215#true} call #t~ret13 := main(); {70215#true} is VALID [2022-04-08 10:06:36,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70215#true} {70215#true} #72#return; {70215#true} is VALID [2022-04-08 10:06:36,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {70215#true} assume true; {70215#true} is VALID [2022-04-08 10:06:36,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {70215#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {70215#true} is VALID [2022-04-08 10:06:36,305 INFO L272 TraceCheckUtils]: 0: Hoare triple {70215#true} call ULTIMATE.init(); {70215#true} is VALID [2022-04-08 10:06:36,305 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:06:36,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414951277] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:36,305 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:36,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-08 10:06:36,305 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:36,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1101614099] [2022-04-08 10:06:36,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1101614099] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:36,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:36,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-08 10:06:36,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887006019] [2022-04-08 10:06:36,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:36,306 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 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 34 [2022-04-08 10:06:36,306 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:36,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 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-08 10:06:36,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:36,322 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-08 10:06:36,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:36,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-08 10:06:36,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=491, Invalid=1579, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 10:06:36,323 INFO L87 Difference]: Start difference. First operand 316 states and 428 transitions. Second operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 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-08 10:06:42,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:42,409 INFO L93 Difference]: Finished difference Result 556 states and 845 transitions. [2022-04-08 10:06:42,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-08 10:06:42,409 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 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 34 [2022-04-08 10:06:42,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:42,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 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-08 10:06:42,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 209 transitions. [2022-04-08 10:06:42,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 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-08 10:06:42,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 209 transitions. [2022-04-08 10:06:42,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 209 transitions. [2022-04-08 10:06:42,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 209 edges. 209 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:42,528 INFO L225 Difference]: With dead ends: 556 [2022-04-08 10:06:42,528 INFO L226 Difference]: Without dead ends: 531 [2022-04-08 10:06:42,529 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=997, Invalid=3425, Unknown=0, NotChecked=0, Total=4422 [2022-04-08 10:06:42,529 INFO L913 BasicCegarLoop]: 93 mSDtfsCounter, 158 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 3382 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 3494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 3382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:06:42,530 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 200 Invalid, 3494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 3382 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-08 10:06:42,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2022-04-08 10:06:43,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 333. [2022-04-08 10:06:43,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:06:43,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 531 states. Second operand has 333 states, 328 states have (on average 1.3689024390243902) internal successors, (449), 328 states have internal predecessors, (449), 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-08 10:06:43,396 INFO L74 IsIncluded]: Start isIncluded. First operand 531 states. Second operand has 333 states, 328 states have (on average 1.3689024390243902) internal successors, (449), 328 states have internal predecessors, (449), 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-08 10:06:43,396 INFO L87 Difference]: Start difference. First operand 531 states. Second operand has 333 states, 328 states have (on average 1.3689024390243902) internal successors, (449), 328 states have internal predecessors, (449), 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-08 10:06:43,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:43,405 INFO L93 Difference]: Finished difference Result 531 states and 671 transitions. [2022-04-08 10:06:43,405 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 671 transitions. [2022-04-08 10:06:43,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:43,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:43,405 INFO L74 IsIncluded]: Start isIncluded. First operand has 333 states, 328 states have (on average 1.3689024390243902) internal successors, (449), 328 states have internal predecessors, (449), 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 531 states. [2022-04-08 10:06:43,405 INFO L87 Difference]: Start difference. First operand has 333 states, 328 states have (on average 1.3689024390243902) internal successors, (449), 328 states have internal predecessors, (449), 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 531 states. [2022-04-08 10:06:43,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:43,414 INFO L93 Difference]: Finished difference Result 531 states and 671 transitions. [2022-04-08 10:06:43,414 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 671 transitions. [2022-04-08 10:06:43,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:06:43,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:06:43,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:06:43,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:06:43,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 328 states have (on average 1.3689024390243902) internal successors, (449), 328 states have internal predecessors, (449), 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-08 10:06:43,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 453 transitions. [2022-04-08 10:06:43,419 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 453 transitions. Word has length 34 [2022-04-08 10:06:43,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:06:43,419 INFO L478 AbstractCegarLoop]: Abstraction has 333 states and 453 transitions. [2022-04-08 10:06:43,419 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 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-08 10:06:43,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 333 states and 453 transitions. [2022-04-08 10:06:44,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 453 edges. 453 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:44,815 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 453 transitions. [2022-04-08 10:06:44,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 10:06:44,815 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:06:44,815 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:06:44,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-04-08 10:06:45,016 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-04-08 10:06:45,016 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:06:45,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:06:45,016 INFO L85 PathProgramCache]: Analyzing trace with hash 144704712, now seen corresponding path program 45 times [2022-04-08 10:06:45,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:45,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [394089815] [2022-04-08 10:06:45,018 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:06:45,018 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:06:45,018 INFO L85 PathProgramCache]: Analyzing trace with hash 144704712, now seen corresponding path program 46 times [2022-04-08 10:06:45,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:06:45,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582904640] [2022-04-08 10:06:45,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:06:45,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:06:45,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:45,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:06:45,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:45,505 INFO L290 TraceCheckUtils]: 0: Hoare triple {73370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {73349#true} is VALID [2022-04-08 10:06:45,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {73349#true} assume true; {73349#true} is VALID [2022-04-08 10:06:45,505 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {73349#true} {73349#true} #72#return; {73349#true} is VALID [2022-04-08 10:06:45,506 INFO L272 TraceCheckUtils]: 0: Hoare triple {73349#true} call ULTIMATE.init(); {73370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:06:45,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {73370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {73349#true} is VALID [2022-04-08 10:06:45,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {73349#true} assume true; {73349#true} is VALID [2022-04-08 10:06:45,506 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73349#true} {73349#true} #72#return; {73349#true} is VALID [2022-04-08 10:06:45,506 INFO L272 TraceCheckUtils]: 4: Hoare triple {73349#true} call #t~ret13 := main(); {73349#true} is VALID [2022-04-08 10:06:45,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {73349#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {73354#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-08 10:06:45,507 INFO L290 TraceCheckUtils]: 6: Hoare triple {73354#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73355#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:45,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {73355#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73356#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-08 10:06:45,536 INFO L290 TraceCheckUtils]: 8: Hoare triple {73356#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73357#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:06:47,544 WARN L290 TraceCheckUtils]: 9: Hoare triple {73357#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73358#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= (+ main_~x~0 4) main_~n~0))} is UNKNOWN [2022-04-08 10:06:47,545 INFO L290 TraceCheckUtils]: 10: Hoare triple {73358#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= (+ main_~x~0 4) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73359#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0)) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:47,546 INFO L290 TraceCheckUtils]: 11: Hoare triple {73359#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0)) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {73360#(and (<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:47,546 INFO L290 TraceCheckUtils]: 12: Hoare triple {73360#(and (<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~y~0 5))} ~z~0 := ~y~0; {73360#(and (<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:47,547 INFO L290 TraceCheckUtils]: 13: Hoare triple {73360#(and (<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {73361#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:47,548 INFO L290 TraceCheckUtils]: 14: Hoare triple {73361#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {73361#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:47,548 INFO L290 TraceCheckUtils]: 15: Hoare triple {73361#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {73361#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:47,548 INFO L290 TraceCheckUtils]: 16: Hoare triple {73361#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {73361#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:47,549 INFO L290 TraceCheckUtils]: 17: Hoare triple {73361#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {73361#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:47,549 INFO L290 TraceCheckUtils]: 18: Hoare triple {73361#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} assume !(~z~0 % 4294967296 > 0); {73361#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:47,550 INFO L290 TraceCheckUtils]: 19: Hoare triple {73361#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73362#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 1)) (<= main_~y~0 4))} is VALID [2022-04-08 10:06:47,550 INFO L290 TraceCheckUtils]: 20: Hoare triple {73362#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 1)) (<= main_~y~0 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73363#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 2)) (<= main_~y~0 3))} is VALID [2022-04-08 10:06:47,551 INFO L290 TraceCheckUtils]: 21: Hoare triple {73363#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 2)) (<= main_~y~0 3))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73364#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 3)) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:47,552 INFO L290 TraceCheckUtils]: 22: Hoare triple {73364#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 3)) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73365#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 4)) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:47,552 INFO L290 TraceCheckUtils]: 23: Hoare triple {73365#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 4)) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73366#(and (<= main_~y~0 0) (<= main_~n~0 (+ 5 (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)))} is VALID [2022-04-08 10:06:47,553 INFO L290 TraceCheckUtils]: 24: Hoare triple {73366#(and (<= main_~y~0 0) (<= main_~n~0 (+ 5 (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)))} assume !(~y~0 % 4294967296 > 0); {73366#(and (<= main_~y~0 0) (<= main_~n~0 (+ 5 (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)))} is VALID [2022-04-08 10:06:47,553 INFO L290 TraceCheckUtils]: 25: Hoare triple {73366#(and (<= main_~y~0 0) (<= main_~n~0 (+ 5 (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {73365#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 4)) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:47,554 INFO L290 TraceCheckUtils]: 26: Hoare triple {73365#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 4)) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {73364#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 3)) (<= main_~y~0 2))} is VALID [2022-04-08 10:06:47,554 INFO L290 TraceCheckUtils]: 27: Hoare triple {73364#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 3)) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {73363#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 2)) (<= main_~y~0 3))} is VALID [2022-04-08 10:06:47,555 INFO L290 TraceCheckUtils]: 28: Hoare triple {73363#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 2)) (<= main_~y~0 3))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {73362#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 1)) (<= main_~y~0 4))} is VALID [2022-04-08 10:06:47,557 INFO L290 TraceCheckUtils]: 29: Hoare triple {73362#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0 1)) (<= main_~y~0 4))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {73367#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:06:47,557 INFO L290 TraceCheckUtils]: 30: Hoare triple {73367#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {73367#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:06:47,558 INFO L272 TraceCheckUtils]: 31: Hoare triple {73367#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {73368#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:06:47,558 INFO L290 TraceCheckUtils]: 32: Hoare triple {73368#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {73369#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:06:47,558 INFO L290 TraceCheckUtils]: 33: Hoare triple {73369#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {73350#false} is VALID [2022-04-08 10:06:47,558 INFO L290 TraceCheckUtils]: 34: Hoare triple {73350#false} assume !false; {73350#false} is VALID [2022-04-08 10:06:47,559 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-08 10:06:47,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:06:47,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582904640] [2022-04-08 10:06:47,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582904640] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:06:47,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902310953] [2022-04-08 10:06:47,559 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:06:47,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:06:47,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:06:47,560 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:06:47,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-04-08 10:06:47,873 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:06:47,873 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:06:47,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 73 conjunts are in the unsatisfiable core [2022-04-08 10:06:47,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:06:47,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:06:51,771 INFO L272 TraceCheckUtils]: 0: Hoare triple {73349#true} call ULTIMATE.init(); {73349#true} is VALID [2022-04-08 10:06:51,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {73349#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {73349#true} is VALID [2022-04-08 10:06:51,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {73349#true} assume true; {73349#true} is VALID [2022-04-08 10:06:51,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73349#true} {73349#true} #72#return; {73349#true} is VALID [2022-04-08 10:06:51,771 INFO L272 TraceCheckUtils]: 4: Hoare triple {73349#true} call #t~ret13 := main(); {73349#true} is VALID [2022-04-08 10:06:51,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {73349#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {73354#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-08 10:06:51,773 INFO L290 TraceCheckUtils]: 6: Hoare triple {73354#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73355#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:51,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {73355#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73356#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-08 10:06:51,814 INFO L290 TraceCheckUtils]: 8: Hoare triple {73356#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73357#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:06:51,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {73357#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73358#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-08 10:06:51,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {73358#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= (+ main_~x~0 4) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73404#(and (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ 5 main_~x~0) main_~n~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:51,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {73404#(and (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ 5 main_~x~0) main_~n~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {73408#(and (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ 5 main_~x~0) main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:51,833 INFO L290 TraceCheckUtils]: 12: Hoare triple {73408#(and (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ 5 main_~x~0) main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (<= main_~y~0 5))} ~z~0 := ~y~0; {73408#(and (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ 5 main_~x~0) main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:51,836 INFO L290 TraceCheckUtils]: 13: Hoare triple {73408#(and (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ 5 main_~x~0) main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {73415#(and (<= main_~x~0 (+ 4294967291 (* (div (+ (- 1) main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= (+ main_~x~0 4) main_~n~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:51,838 INFO L290 TraceCheckUtils]: 14: Hoare triple {73415#(and (<= main_~x~0 (+ 4294967291 (* (div (+ (- 1) main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= (+ main_~x~0 4) main_~n~0) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {73419#(and (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ (- 2) main_~y~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:51,844 INFO L290 TraceCheckUtils]: 15: Hoare triple {73419#(and (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ (- 2) main_~y~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {73423#(and (<= (+ main_~x~0 2) main_~n~0) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= main_~y~0 5) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (- 3) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-08 10:06:51,846 INFO L290 TraceCheckUtils]: 16: Hoare triple {73423#(and (<= (+ main_~x~0 2) main_~n~0) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= main_~y~0 5) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (- 3) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {73427#(and (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~y~0 main_~x~0 (- 4) (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) 4294967294)) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:51,849 INFO L290 TraceCheckUtils]: 17: Hoare triple {73427#(and (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~y~0 main_~x~0 (- 4) (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) 4294967294)) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {73431#(and (not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~y~0 main_~x~0 (- 5) (* (- 1) main_~n~0) (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)) 4294967296)) 4294967295)) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:51,849 INFO L290 TraceCheckUtils]: 18: Hoare triple {73431#(and (not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~y~0 main_~x~0 (- 5) (* (- 1) main_~n~0) (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)) 4294967296)) 4294967295)) (<= main_~y~0 5))} assume !(~z~0 % 4294967296 > 0); {73431#(and (not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~y~0 main_~x~0 (- 5) (* (- 1) main_~n~0) (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)) 4294967296)) 4294967295)) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:51,851 INFO L290 TraceCheckUtils]: 19: Hoare triple {73431#(and (not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~y~0 main_~x~0 (- 5) (* (- 1) main_~n~0) (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)) 4294967296)) 4294967295)) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73438#(and (not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296))) (<= main_~y~0 4) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~y~0 main_~x~0 (- 4) (* (- 1) main_~n~0) (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:06:51,853 INFO L290 TraceCheckUtils]: 20: Hoare triple {73438#(and (not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296))) (<= main_~y~0 4) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~y~0 main_~x~0 (- 4) (* (- 1) main_~n~0) (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73442#(and (not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296))) (<= main_~y~0 3) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~y~0 main_~x~0 (- 3) (* (- 1) main_~n~0) (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:06:51,854 INFO L290 TraceCheckUtils]: 21: Hoare triple {73442#(and (not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296))) (<= main_~y~0 3) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~y~0 main_~x~0 (- 3) (* (- 1) main_~n~0) (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73446#(and (not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296))) (<= main_~y~0 2) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ 4294967295 (* 4294967296 (div (+ (- 2) main_~y~0 main_~x~0 (* (- 1) main_~n~0) (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)) 4294967296)))))} is VALID [2022-04-08 10:06:51,856 INFO L290 TraceCheckUtils]: 22: Hoare triple {73446#(and (not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296))) (<= main_~y~0 2) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ 4294967295 (* 4294967296 (div (+ (- 2) main_~y~0 main_~x~0 (* (- 1) main_~n~0) (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)) 4294967296)))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73450#(and (not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296))) (<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~y~0 main_~x~0 (* (- 1) main_~n~0) (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)) 4294967296) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:51,857 INFO L290 TraceCheckUtils]: 23: Hoare triple {73450#(and (not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296))) (<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~y~0 main_~x~0 (* (- 1) main_~n~0) (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)) 4294967296) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73454#(and (not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296))) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~y~0 main_~x~0 (* (- 1) main_~n~0) (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)) 4294967296) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~y~0 0))} is VALID [2022-04-08 10:06:51,858 INFO L290 TraceCheckUtils]: 24: Hoare triple {73454#(and (not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296))) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~y~0 main_~x~0 (* (- 1) main_~n~0) (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)) 4294967296) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~y~0 0))} assume !(~y~0 % 4294967296 > 0); {73454#(and (not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296))) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~y~0 main_~x~0 (* (- 1) main_~n~0) (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)) 4294967296) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~y~0 0))} is VALID [2022-04-08 10:06:51,860 INFO L290 TraceCheckUtils]: 25: Hoare triple {73454#(and (not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296))) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~y~0 main_~x~0 (* (- 1) main_~n~0) (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)) 4294967296) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {73461#(and (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) 4294967294)) (<= main_~y~0 1))} is VALID [2022-04-08 10:06:51,865 INFO L290 TraceCheckUtils]: 26: Hoare triple {73461#(and (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) 4294967294)) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {73465#(and (<= (+ main_~x~0 2) main_~n~0) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-08 10:06:51,877 INFO L290 TraceCheckUtils]: 27: Hoare triple {73465#(and (<= (+ main_~x~0 2) main_~n~0) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {73469#(and (<= main_~y~0 3) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:06:51,881 INFO L290 TraceCheckUtils]: 28: Hoare triple {73469#(and (<= main_~y~0 3) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {73473#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-08 10:06:51,884 INFO L290 TraceCheckUtils]: 29: Hoare triple {73473#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= (+ main_~x~0 4) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {73408#(and (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ 5 main_~x~0) main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:51,885 INFO L290 TraceCheckUtils]: 30: Hoare triple {73408#(and (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ 5 main_~x~0) main_~n~0) (not (< 0 (mod main_~x~0 4294967296))) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {73361#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-08 10:06:51,887 INFO L272 TraceCheckUtils]: 31: Hoare triple {73361#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296) main_~y~0)) (<= main_~y~0 5))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {73483#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:06:51,887 INFO L290 TraceCheckUtils]: 32: Hoare triple {73483#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {73487#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:06:51,887 INFO L290 TraceCheckUtils]: 33: Hoare triple {73487#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {73350#false} is VALID [2022-04-08 10:06:51,887 INFO L290 TraceCheckUtils]: 34: Hoare triple {73350#false} assume !false; {73350#false} is VALID [2022-04-08 10:06:51,888 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:06:51,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:06:55,235 INFO L290 TraceCheckUtils]: 34: Hoare triple {73350#false} assume !false; {73350#false} is VALID [2022-04-08 10:06:55,236 INFO L290 TraceCheckUtils]: 33: Hoare triple {73487#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {73350#false} is VALID [2022-04-08 10:06:55,236 INFO L290 TraceCheckUtils]: 32: Hoare triple {73483#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {73487#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:06:55,237 INFO L272 TraceCheckUtils]: 31: Hoare triple {73367#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {73483#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:06:55,237 INFO L290 TraceCheckUtils]: 30: Hoare triple {73506#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} assume !(~x~0 % 4294967296 > 0); {73367#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:06:55,239 INFO L290 TraceCheckUtils]: 29: Hoare triple {73510#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {73506#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-08 10:06:55,241 INFO L290 TraceCheckUtils]: 28: Hoare triple {73514#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {73510#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-08 10:06:55,242 INFO L290 TraceCheckUtils]: 27: Hoare triple {73518#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {73514#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:06:55,243 INFO L290 TraceCheckUtils]: 26: Hoare triple {73522#(or (and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {73518#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:06:55,244 INFO L290 TraceCheckUtils]: 25: Hoare triple {73526#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {73522#(or (and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:06:55,245 INFO L290 TraceCheckUtils]: 24: Hoare triple {73526#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)))))} assume !(~y~0 % 4294967296 > 0); {73526#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-08 10:06:55,246 INFO L290 TraceCheckUtils]: 23: Hoare triple {73533#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73526#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-08 10:06:55,246 INFO L290 TraceCheckUtils]: 22: Hoare triple {73537#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73533#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))))))} is VALID [2022-04-08 10:06:55,247 INFO L290 TraceCheckUtils]: 21: Hoare triple {73541#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73537#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:06:55,248 INFO L290 TraceCheckUtils]: 20: Hoare triple {73545#(or (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73541#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:06:55,249 INFO L290 TraceCheckUtils]: 19: Hoare triple {73549#(or (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73545#(or (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:06:55,250 INFO L290 TraceCheckUtils]: 18: Hoare triple {73549#(or (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {73549#(or (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:06:55,251 INFO L290 TraceCheckUtils]: 17: Hoare triple {73556#(or (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {73549#(or (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:06:55,251 INFO L290 TraceCheckUtils]: 16: Hoare triple {73560#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {73556#(or (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:06:55,252 INFO L290 TraceCheckUtils]: 15: Hoare triple {73564#(or (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {73560#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-08 10:06:55,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {73568#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {73564#(or (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:06:55,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {73506#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {73568#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-08 10:06:55,255 INFO L290 TraceCheckUtils]: 12: Hoare triple {73506#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} ~z~0 := ~y~0; {73506#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-08 10:06:55,255 INFO L290 TraceCheckUtils]: 11: Hoare triple {73506#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} assume !(~x~0 % 4294967296 > 0); {73506#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-08 10:06:55,256 INFO L290 TraceCheckUtils]: 10: Hoare triple {73510#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73506#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-08 10:06:55,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {73514#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73510#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-08 10:06:55,258 INFO L290 TraceCheckUtils]: 8: Hoare triple {73518#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73514#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:06:55,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {73522#(or (and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73518#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:06:55,261 INFO L290 TraceCheckUtils]: 6: Hoare triple {73526#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {73522#(or (and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:06:55,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {73349#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {73526#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-08 10:06:55,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {73349#true} call #t~ret13 := main(); {73349#true} is VALID [2022-04-08 10:06:55,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73349#true} {73349#true} #72#return; {73349#true} is VALID [2022-04-08 10:06:55,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {73349#true} assume true; {73349#true} is VALID [2022-04-08 10:06:55,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {73349#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {73349#true} is VALID [2022-04-08 10:06:55,262 INFO L272 TraceCheckUtils]: 0: Hoare triple {73349#true} call ULTIMATE.init(); {73349#true} is VALID [2022-04-08 10:06:55,262 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:06:55,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902310953] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:06:55,267 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:06:55,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 26, 20] total 52 [2022-04-08 10:06:55,268 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:06:55,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [394089815] [2022-04-08 10:06:55,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [394089815] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:06:55,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:06:55,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 10:06:55,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290328666] [2022-04-08 10:06:55,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:06:55,268 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 17 states have internal predecessors, (28), 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 35 [2022-04-08 10:06:55,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:06:55,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 17 states have internal predecessors, (28), 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-08 10:06:55,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:06:55,363 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 10:06:55,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:06:55,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 10:06:55,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=2255, Unknown=0, NotChecked=0, Total=2652 [2022-04-08 10:06:55,364 INFO L87 Difference]: Start difference. First operand 333 states and 453 transitions. Second operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 17 states have internal predecessors, (28), 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-08 10:06:58,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:06:58,674 INFO L93 Difference]: Finished difference Result 350 states and 470 transitions. [2022-04-08 10:06:58,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 10:06:58,674 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 17 states have internal predecessors, (28), 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 35 [2022-04-08 10:06:58,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:06:58,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 17 states have internal predecessors, (28), 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-08 10:06:58,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 48 transitions. [2022-04-08 10:06:58,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 17 states have internal predecessors, (28), 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-08 10:06:58,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 48 transitions. [2022-04-08 10:06:58,675 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 48 transitions. [2022-04-08 10:07:00,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:00,541 INFO L225 Difference]: With dead ends: 350 [2022-04-08 10:07:00,541 INFO L226 Difference]: Without dead ends: 345 [2022-04-08 10:07:00,541 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 35 SyntacticMatches, 8 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1129 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=547, Invalid=4009, Unknown=0, NotChecked=0, Total=4556 [2022-04-08 10:07:00,541 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 26 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:00,542 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 88 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:07:00,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-04-08 10:07:02,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 333. [2022-04-08 10:07:02,192 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:02,192 INFO L82 GeneralOperation]: Start isEquivalent. First operand 345 states. Second operand has 333 states, 328 states have (on average 1.3689024390243902) internal successors, (449), 328 states have internal predecessors, (449), 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-08 10:07:02,193 INFO L74 IsIncluded]: Start isIncluded. First operand 345 states. Second operand has 333 states, 328 states have (on average 1.3689024390243902) internal successors, (449), 328 states have internal predecessors, (449), 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-08 10:07:02,193 INFO L87 Difference]: Start difference. First operand 345 states. Second operand has 333 states, 328 states have (on average 1.3689024390243902) internal successors, (449), 328 states have internal predecessors, (449), 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-08 10:07:02,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:02,197 INFO L93 Difference]: Finished difference Result 345 states and 465 transitions. [2022-04-08 10:07:02,197 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 465 transitions. [2022-04-08 10:07:02,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:02,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:02,197 INFO L74 IsIncluded]: Start isIncluded. First operand has 333 states, 328 states have (on average 1.3689024390243902) internal successors, (449), 328 states have internal predecessors, (449), 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 345 states. [2022-04-08 10:07:02,197 INFO L87 Difference]: Start difference. First operand has 333 states, 328 states have (on average 1.3689024390243902) internal successors, (449), 328 states have internal predecessors, (449), 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 345 states. [2022-04-08 10:07:02,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:02,201 INFO L93 Difference]: Finished difference Result 345 states and 465 transitions. [2022-04-08 10:07:02,201 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 465 transitions. [2022-04-08 10:07:02,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:02,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:02,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:02,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:02,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 328 states have (on average 1.3689024390243902) internal successors, (449), 328 states have internal predecessors, (449), 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-08 10:07:02,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 453 transitions. [2022-04-08 10:07:02,206 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 453 transitions. Word has length 35 [2022-04-08 10:07:02,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:02,206 INFO L478 AbstractCegarLoop]: Abstraction has 333 states and 453 transitions. [2022-04-08 10:07:02,206 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 17 states have internal predecessors, (28), 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-08 10:07:02,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 333 states and 453 transitions. [2022-04-08 10:07:04,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 453 edges. 453 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:04,313 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 453 transitions. [2022-04-08 10:07:04,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 10:07:04,313 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:04,313 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:04,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-04-08 10:07:04,514 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:04,514 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:04,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:04,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1479667000, now seen corresponding path program 47 times [2022-04-08 10:07:04,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:04,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1402713311] [2022-04-08 10:07:04,516 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:04,516 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:04,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1479667000, now seen corresponding path program 48 times [2022-04-08 10:07:04,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:04,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760625037] [2022-04-08 10:07:04,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:04,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:04,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:04,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:04,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:04,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {75718#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {75701#true} is VALID [2022-04-08 10:07:04,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {75701#true} assume true; {75701#true} is VALID [2022-04-08 10:07:04,690 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {75701#true} {75701#true} #72#return; {75701#true} is VALID [2022-04-08 10:07:04,690 INFO L272 TraceCheckUtils]: 0: Hoare triple {75701#true} call ULTIMATE.init(); {75718#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:04,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {75718#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {75701#true} is VALID [2022-04-08 10:07:04,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {75701#true} assume true; {75701#true} is VALID [2022-04-08 10:07:04,690 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75701#true} {75701#true} #72#return; {75701#true} is VALID [2022-04-08 10:07:04,690 INFO L272 TraceCheckUtils]: 4: Hoare triple {75701#true} call #t~ret13 := main(); {75701#true} is VALID [2022-04-08 10:07:04,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {75701#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {75706#(= main_~y~0 0)} is VALID [2022-04-08 10:07:04,691 INFO L290 TraceCheckUtils]: 6: Hoare triple {75706#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75707#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:04,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {75707#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75708#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:04,692 INFO L290 TraceCheckUtils]: 8: Hoare triple {75708#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75709#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:04,693 INFO L290 TraceCheckUtils]: 9: Hoare triple {75709#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75710#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:04,693 INFO L290 TraceCheckUtils]: 10: Hoare triple {75710#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75711#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:04,694 INFO L290 TraceCheckUtils]: 11: Hoare triple {75711#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75712#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:04,694 INFO L290 TraceCheckUtils]: 12: Hoare triple {75712#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75713#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:04,695 INFO L290 TraceCheckUtils]: 13: Hoare triple {75713#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {75713#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:04,695 INFO L290 TraceCheckUtils]: 14: Hoare triple {75713#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {75714#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:07:04,695 INFO L290 TraceCheckUtils]: 15: Hoare triple {75714#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {75715#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:07:04,696 INFO L290 TraceCheckUtils]: 16: Hoare triple {75715#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {75716#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:07:04,696 INFO L290 TraceCheckUtils]: 17: Hoare triple {75716#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {75717#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:07:04,697 INFO L290 TraceCheckUtils]: 18: Hoare triple {75717#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {75702#false} is VALID [2022-04-08 10:07:04,697 INFO L290 TraceCheckUtils]: 19: Hoare triple {75702#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75702#false} is VALID [2022-04-08 10:07:04,697 INFO L290 TraceCheckUtils]: 20: Hoare triple {75702#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75702#false} is VALID [2022-04-08 10:07:04,697 INFO L290 TraceCheckUtils]: 21: Hoare triple {75702#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75702#false} is VALID [2022-04-08 10:07:04,697 INFO L290 TraceCheckUtils]: 22: Hoare triple {75702#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75702#false} is VALID [2022-04-08 10:07:04,697 INFO L290 TraceCheckUtils]: 23: Hoare triple {75702#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75702#false} is VALID [2022-04-08 10:07:04,697 INFO L290 TraceCheckUtils]: 24: Hoare triple {75702#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75702#false} is VALID [2022-04-08 10:07:04,697 INFO L290 TraceCheckUtils]: 25: Hoare triple {75702#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75702#false} is VALID [2022-04-08 10:07:04,697 INFO L290 TraceCheckUtils]: 26: Hoare triple {75702#false} assume !(~y~0 % 4294967296 > 0); {75702#false} is VALID [2022-04-08 10:07:04,697 INFO L290 TraceCheckUtils]: 27: Hoare triple {75702#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {75702#false} is VALID [2022-04-08 10:07:04,697 INFO L290 TraceCheckUtils]: 28: Hoare triple {75702#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {75702#false} is VALID [2022-04-08 10:07:04,697 INFO L290 TraceCheckUtils]: 29: Hoare triple {75702#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {75702#false} is VALID [2022-04-08 10:07:04,697 INFO L290 TraceCheckUtils]: 30: Hoare triple {75702#false} assume !(~x~0 % 4294967296 > 0); {75702#false} is VALID [2022-04-08 10:07:04,698 INFO L272 TraceCheckUtils]: 31: Hoare triple {75702#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {75702#false} is VALID [2022-04-08 10:07:04,698 INFO L290 TraceCheckUtils]: 32: Hoare triple {75702#false} ~cond := #in~cond; {75702#false} is VALID [2022-04-08 10:07:04,698 INFO L290 TraceCheckUtils]: 33: Hoare triple {75702#false} assume 0 == ~cond; {75702#false} is VALID [2022-04-08 10:07:04,698 INFO L290 TraceCheckUtils]: 34: Hoare triple {75702#false} assume !false; {75702#false} is VALID [2022-04-08 10:07:04,698 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-04-08 10:07:04,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:04,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760625037] [2022-04-08 10:07:04,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760625037] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:04,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733051014] [2022-04-08 10:07:04,698 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:07:04,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:04,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:04,699 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:07:04,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-04-08 10:07:04,770 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 10:07:04,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:04,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 10:07:04,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:04,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:05,016 INFO L272 TraceCheckUtils]: 0: Hoare triple {75701#true} call ULTIMATE.init(); {75701#true} is VALID [2022-04-08 10:07:05,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {75701#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {75701#true} is VALID [2022-04-08 10:07:05,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {75701#true} assume true; {75701#true} is VALID [2022-04-08 10:07:05,016 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75701#true} {75701#true} #72#return; {75701#true} is VALID [2022-04-08 10:07:05,016 INFO L272 TraceCheckUtils]: 4: Hoare triple {75701#true} call #t~ret13 := main(); {75701#true} is VALID [2022-04-08 10:07:05,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {75701#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {75706#(= main_~y~0 0)} is VALID [2022-04-08 10:07:05,017 INFO L290 TraceCheckUtils]: 6: Hoare triple {75706#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75707#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:05,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {75707#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75708#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:05,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {75708#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75709#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:05,019 INFO L290 TraceCheckUtils]: 9: Hoare triple {75709#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75710#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:05,019 INFO L290 TraceCheckUtils]: 10: Hoare triple {75710#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75711#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:05,020 INFO L290 TraceCheckUtils]: 11: Hoare triple {75711#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75712#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:05,020 INFO L290 TraceCheckUtils]: 12: Hoare triple {75712#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75713#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:05,020 INFO L290 TraceCheckUtils]: 13: Hoare triple {75713#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {75713#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:05,021 INFO L290 TraceCheckUtils]: 14: Hoare triple {75713#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {75714#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:07:05,021 INFO L290 TraceCheckUtils]: 15: Hoare triple {75714#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {75715#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:07:05,022 INFO L290 TraceCheckUtils]: 16: Hoare triple {75715#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {75716#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:07:05,022 INFO L290 TraceCheckUtils]: 17: Hoare triple {75716#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {75773#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:07:05,023 INFO L290 TraceCheckUtils]: 18: Hoare triple {75773#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {75702#false} is VALID [2022-04-08 10:07:05,023 INFO L290 TraceCheckUtils]: 19: Hoare triple {75702#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75702#false} is VALID [2022-04-08 10:07:05,023 INFO L290 TraceCheckUtils]: 20: Hoare triple {75702#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75702#false} is VALID [2022-04-08 10:07:05,023 INFO L290 TraceCheckUtils]: 21: Hoare triple {75702#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75702#false} is VALID [2022-04-08 10:07:05,023 INFO L290 TraceCheckUtils]: 22: Hoare triple {75702#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75702#false} is VALID [2022-04-08 10:07:05,023 INFO L290 TraceCheckUtils]: 23: Hoare triple {75702#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75702#false} is VALID [2022-04-08 10:07:05,023 INFO L290 TraceCheckUtils]: 24: Hoare triple {75702#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75702#false} is VALID [2022-04-08 10:07:05,023 INFO L290 TraceCheckUtils]: 25: Hoare triple {75702#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75702#false} is VALID [2022-04-08 10:07:05,023 INFO L290 TraceCheckUtils]: 26: Hoare triple {75702#false} assume !(~y~0 % 4294967296 > 0); {75702#false} is VALID [2022-04-08 10:07:05,023 INFO L290 TraceCheckUtils]: 27: Hoare triple {75702#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {75702#false} is VALID [2022-04-08 10:07:05,023 INFO L290 TraceCheckUtils]: 28: Hoare triple {75702#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {75702#false} is VALID [2022-04-08 10:07:05,023 INFO L290 TraceCheckUtils]: 29: Hoare triple {75702#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {75702#false} is VALID [2022-04-08 10:07:05,023 INFO L290 TraceCheckUtils]: 30: Hoare triple {75702#false} assume !(~x~0 % 4294967296 > 0); {75702#false} is VALID [2022-04-08 10:07:05,023 INFO L272 TraceCheckUtils]: 31: Hoare triple {75702#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {75702#false} is VALID [2022-04-08 10:07:05,023 INFO L290 TraceCheckUtils]: 32: Hoare triple {75702#false} ~cond := #in~cond; {75702#false} is VALID [2022-04-08 10:07:05,023 INFO L290 TraceCheckUtils]: 33: Hoare triple {75702#false} assume 0 == ~cond; {75702#false} is VALID [2022-04-08 10:07:05,023 INFO L290 TraceCheckUtils]: 34: Hoare triple {75702#false} assume !false; {75702#false} is VALID [2022-04-08 10:07:05,024 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-04-08 10:07:05,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:05,316 INFO L290 TraceCheckUtils]: 34: Hoare triple {75702#false} assume !false; {75702#false} is VALID [2022-04-08 10:07:05,316 INFO L290 TraceCheckUtils]: 33: Hoare triple {75702#false} assume 0 == ~cond; {75702#false} is VALID [2022-04-08 10:07:05,316 INFO L290 TraceCheckUtils]: 32: Hoare triple {75702#false} ~cond := #in~cond; {75702#false} is VALID [2022-04-08 10:07:05,316 INFO L272 TraceCheckUtils]: 31: Hoare triple {75702#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {75702#false} is VALID [2022-04-08 10:07:05,316 INFO L290 TraceCheckUtils]: 30: Hoare triple {75702#false} assume !(~x~0 % 4294967296 > 0); {75702#false} is VALID [2022-04-08 10:07:05,316 INFO L290 TraceCheckUtils]: 29: Hoare triple {75702#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {75702#false} is VALID [2022-04-08 10:07:05,316 INFO L290 TraceCheckUtils]: 28: Hoare triple {75702#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {75702#false} is VALID [2022-04-08 10:07:05,317 INFO L290 TraceCheckUtils]: 27: Hoare triple {75702#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {75702#false} is VALID [2022-04-08 10:07:05,317 INFO L290 TraceCheckUtils]: 26: Hoare triple {75702#false} assume !(~y~0 % 4294967296 > 0); {75702#false} is VALID [2022-04-08 10:07:05,317 INFO L290 TraceCheckUtils]: 25: Hoare triple {75702#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75702#false} is VALID [2022-04-08 10:07:05,317 INFO L290 TraceCheckUtils]: 24: Hoare triple {75702#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75702#false} is VALID [2022-04-08 10:07:05,317 INFO L290 TraceCheckUtils]: 23: Hoare triple {75702#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75702#false} is VALID [2022-04-08 10:07:05,317 INFO L290 TraceCheckUtils]: 22: Hoare triple {75702#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75702#false} is VALID [2022-04-08 10:07:05,317 INFO L290 TraceCheckUtils]: 21: Hoare triple {75702#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75702#false} is VALID [2022-04-08 10:07:05,317 INFO L290 TraceCheckUtils]: 20: Hoare triple {75702#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75702#false} is VALID [2022-04-08 10:07:05,317 INFO L290 TraceCheckUtils]: 19: Hoare triple {75702#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {75702#false} is VALID [2022-04-08 10:07:05,317 INFO L290 TraceCheckUtils]: 18: Hoare triple {75873#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {75702#false} is VALID [2022-04-08 10:07:05,318 INFO L290 TraceCheckUtils]: 17: Hoare triple {75877#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {75873#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:07:05,319 INFO L290 TraceCheckUtils]: 16: Hoare triple {75881#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {75877#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:05,319 INFO L290 TraceCheckUtils]: 15: Hoare triple {75885#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {75881#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:07:05,320 INFO L290 TraceCheckUtils]: 14: Hoare triple {75889#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {75885#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:07:05,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {75889#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {75889#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:07:05,321 INFO L290 TraceCheckUtils]: 12: Hoare triple {75896#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75889#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:07:05,321 INFO L290 TraceCheckUtils]: 11: Hoare triple {75900#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75896#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:07:05,322 INFO L290 TraceCheckUtils]: 10: Hoare triple {75904#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75900#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:05,323 INFO L290 TraceCheckUtils]: 9: Hoare triple {75908#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75904#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:05,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {75912#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75908#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:07:05,324 INFO L290 TraceCheckUtils]: 7: Hoare triple {75916#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75912#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:07:05,325 INFO L290 TraceCheckUtils]: 6: Hoare triple {75920#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {75916#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:07:05,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {75701#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {75920#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:07:05,325 INFO L272 TraceCheckUtils]: 4: Hoare triple {75701#true} call #t~ret13 := main(); {75701#true} is VALID [2022-04-08 10:07:05,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75701#true} {75701#true} #72#return; {75701#true} is VALID [2022-04-08 10:07:05,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {75701#true} assume true; {75701#true} is VALID [2022-04-08 10:07:05,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {75701#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {75701#true} is VALID [2022-04-08 10:07:05,325 INFO L272 TraceCheckUtils]: 0: Hoare triple {75701#true} call ULTIMATE.init(); {75701#true} is VALID [2022-04-08 10:07:05,325 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-04-08 10:07:05,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733051014] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:05,325 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:05,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-08 10:07:05,326 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:05,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1402713311] [2022-04-08 10:07:05,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1402713311] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:05,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:05,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 10:07:05,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205635157] [2022-04-08 10:07:05,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:05,326 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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 35 [2022-04-08 10:07:05,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:05,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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-08 10:07:05,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:05,343 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 10:07:05,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:05,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 10:07:05,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=619, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:07:05,344 INFO L87 Difference]: Start difference. First operand 333 states and 453 transitions. Second operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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-08 10:07:08,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:08,989 INFO L93 Difference]: Finished difference Result 414 states and 541 transitions. [2022-04-08 10:07:08,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 10:07:08,990 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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 35 [2022-04-08 10:07:08,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:08,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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-08 10:07:08,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 89 transitions. [2022-04-08 10:07:08,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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-08 10:07:08,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 89 transitions. [2022-04-08 10:07:08,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 89 transitions. [2022-04-08 10:07:09,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:09,066 INFO L225 Difference]: With dead ends: 414 [2022-04-08 10:07:09,066 INFO L226 Difference]: Without dead ends: 397 [2022-04-08 10:07:09,066 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=403, Invalid=1577, Unknown=0, NotChecked=0, Total=1980 [2022-04-08 10:07:09,066 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 42 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:09,066 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 90 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:07:09,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-04-08 10:07:10,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 333. [2022-04-08 10:07:10,755 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:10,755 INFO L82 GeneralOperation]: Start isEquivalent. First operand 397 states. Second operand has 333 states, 328 states have (on average 1.3658536585365855) internal successors, (448), 328 states have internal predecessors, (448), 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-08 10:07:10,755 INFO L74 IsIncluded]: Start isIncluded. First operand 397 states. Second operand has 333 states, 328 states have (on average 1.3658536585365855) internal successors, (448), 328 states have internal predecessors, (448), 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-08 10:07:10,755 INFO L87 Difference]: Start difference. First operand 397 states. Second operand has 333 states, 328 states have (on average 1.3658536585365855) internal successors, (448), 328 states have internal predecessors, (448), 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-08 10:07:10,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:10,761 INFO L93 Difference]: Finished difference Result 397 states and 524 transitions. [2022-04-08 10:07:10,761 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 524 transitions. [2022-04-08 10:07:10,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:10,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:10,761 INFO L74 IsIncluded]: Start isIncluded. First operand has 333 states, 328 states have (on average 1.3658536585365855) internal successors, (448), 328 states have internal predecessors, (448), 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 397 states. [2022-04-08 10:07:10,761 INFO L87 Difference]: Start difference. First operand has 333 states, 328 states have (on average 1.3658536585365855) internal successors, (448), 328 states have internal predecessors, (448), 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 397 states. [2022-04-08 10:07:10,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:10,767 INFO L93 Difference]: Finished difference Result 397 states and 524 transitions. [2022-04-08 10:07:10,767 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 524 transitions. [2022-04-08 10:07:10,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:10,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:10,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:10,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:10,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 328 states have (on average 1.3658536585365855) internal successors, (448), 328 states have internal predecessors, (448), 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-08 10:07:10,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 452 transitions. [2022-04-08 10:07:10,772 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 452 transitions. Word has length 35 [2022-04-08 10:07:10,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:10,772 INFO L478 AbstractCegarLoop]: Abstraction has 333 states and 452 transitions. [2022-04-08 10:07:10,772 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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-08 10:07:10,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 333 states and 452 transitions. [2022-04-08 10:07:12,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 452 edges. 452 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:12,689 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 452 transitions. [2022-04-08 10:07:12,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 10:07:12,689 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:12,690 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:12,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2022-04-08 10:07:12,903 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:12,903 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:12,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:12,904 INFO L85 PathProgramCache]: Analyzing trace with hash 648860760, now seen corresponding path program 49 times [2022-04-08 10:07:12,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:12,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1214638821] [2022-04-08 10:07:12,906 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:12,906 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:12,906 INFO L85 PathProgramCache]: Analyzing trace with hash 648860760, now seen corresponding path program 50 times [2022-04-08 10:07:12,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:12,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865746973] [2022-04-08 10:07:12,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:12,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:13,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:13,100 INFO L290 TraceCheckUtils]: 0: Hoare triple {78280#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {78263#true} is VALID [2022-04-08 10:07:13,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {78263#true} assume true; {78263#true} is VALID [2022-04-08 10:07:13,100 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {78263#true} {78263#true} #72#return; {78263#true} is VALID [2022-04-08 10:07:13,100 INFO L272 TraceCheckUtils]: 0: Hoare triple {78263#true} call ULTIMATE.init(); {78280#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:13,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {78280#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {78263#true} is VALID [2022-04-08 10:07:13,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {78263#true} assume true; {78263#true} is VALID [2022-04-08 10:07:13,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78263#true} {78263#true} #72#return; {78263#true} is VALID [2022-04-08 10:07:13,100 INFO L272 TraceCheckUtils]: 4: Hoare triple {78263#true} call #t~ret13 := main(); {78263#true} is VALID [2022-04-08 10:07:13,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {78263#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {78268#(= main_~y~0 0)} is VALID [2022-04-08 10:07:13,101 INFO L290 TraceCheckUtils]: 6: Hoare triple {78268#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78269#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:13,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {78269#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78270#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:13,102 INFO L290 TraceCheckUtils]: 8: Hoare triple {78270#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78271#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:13,102 INFO L290 TraceCheckUtils]: 9: Hoare triple {78271#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78272#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:13,103 INFO L290 TraceCheckUtils]: 10: Hoare triple {78272#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78273#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:13,103 INFO L290 TraceCheckUtils]: 11: Hoare triple {78273#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78274#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:13,104 INFO L290 TraceCheckUtils]: 12: Hoare triple {78274#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78275#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:13,104 INFO L290 TraceCheckUtils]: 13: Hoare triple {78275#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78276#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:13,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {78276#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {78276#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:13,105 INFO L290 TraceCheckUtils]: 15: Hoare triple {78276#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {78277#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:07:13,105 INFO L290 TraceCheckUtils]: 16: Hoare triple {78277#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78278#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:07:13,106 INFO L290 TraceCheckUtils]: 17: Hoare triple {78278#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78279#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-08 10:07:13,106 INFO L290 TraceCheckUtils]: 18: Hoare triple {78279#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {78264#false} is VALID [2022-04-08 10:07:13,106 INFO L290 TraceCheckUtils]: 19: Hoare triple {78264#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78264#false} is VALID [2022-04-08 10:07:13,106 INFO L290 TraceCheckUtils]: 20: Hoare triple {78264#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78264#false} is VALID [2022-04-08 10:07:13,106 INFO L290 TraceCheckUtils]: 21: Hoare triple {78264#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78264#false} is VALID [2022-04-08 10:07:13,106 INFO L290 TraceCheckUtils]: 22: Hoare triple {78264#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78264#false} is VALID [2022-04-08 10:07:13,106 INFO L290 TraceCheckUtils]: 23: Hoare triple {78264#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78264#false} is VALID [2022-04-08 10:07:13,106 INFO L290 TraceCheckUtils]: 24: Hoare triple {78264#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78264#false} is VALID [2022-04-08 10:07:13,106 INFO L290 TraceCheckUtils]: 25: Hoare triple {78264#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78264#false} is VALID [2022-04-08 10:07:13,106 INFO L290 TraceCheckUtils]: 26: Hoare triple {78264#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78264#false} is VALID [2022-04-08 10:07:13,106 INFO L290 TraceCheckUtils]: 27: Hoare triple {78264#false} assume !(~y~0 % 4294967296 > 0); {78264#false} is VALID [2022-04-08 10:07:13,106 INFO L290 TraceCheckUtils]: 28: Hoare triple {78264#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {78264#false} is VALID [2022-04-08 10:07:13,107 INFO L290 TraceCheckUtils]: 29: Hoare triple {78264#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {78264#false} is VALID [2022-04-08 10:07:13,107 INFO L290 TraceCheckUtils]: 30: Hoare triple {78264#false} assume !(~x~0 % 4294967296 > 0); {78264#false} is VALID [2022-04-08 10:07:13,107 INFO L272 TraceCheckUtils]: 31: Hoare triple {78264#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {78264#false} is VALID [2022-04-08 10:07:13,107 INFO L290 TraceCheckUtils]: 32: Hoare triple {78264#false} ~cond := #in~cond; {78264#false} is VALID [2022-04-08 10:07:13,107 INFO L290 TraceCheckUtils]: 33: Hoare triple {78264#false} assume 0 == ~cond; {78264#false} is VALID [2022-04-08 10:07:13,107 INFO L290 TraceCheckUtils]: 34: Hoare triple {78264#false} assume !false; {78264#false} is VALID [2022-04-08 10:07:13,107 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-08 10:07:13,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:13,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865746973] [2022-04-08 10:07:13,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865746973] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:13,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771558795] [2022-04-08 10:07:13,107 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:07:13,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:13,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:13,109 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:07:13,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-04-08 10:07:13,157 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:07:13,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:13,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 10:07:13,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:13,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:13,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {78263#true} call ULTIMATE.init(); {78263#true} is VALID [2022-04-08 10:07:13,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {78263#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {78263#true} is VALID [2022-04-08 10:07:13,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {78263#true} assume true; {78263#true} is VALID [2022-04-08 10:07:13,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78263#true} {78263#true} #72#return; {78263#true} is VALID [2022-04-08 10:07:13,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {78263#true} call #t~ret13 := main(); {78263#true} is VALID [2022-04-08 10:07:13,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {78263#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {78268#(= main_~y~0 0)} is VALID [2022-04-08 10:07:13,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {78268#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78269#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:13,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {78269#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78270#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:13,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {78270#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78271#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:13,400 INFO L290 TraceCheckUtils]: 9: Hoare triple {78271#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78272#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:13,400 INFO L290 TraceCheckUtils]: 10: Hoare triple {78272#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78273#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:13,401 INFO L290 TraceCheckUtils]: 11: Hoare triple {78273#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78274#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:13,401 INFO L290 TraceCheckUtils]: 12: Hoare triple {78274#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78275#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:13,402 INFO L290 TraceCheckUtils]: 13: Hoare triple {78275#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78276#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:13,402 INFO L290 TraceCheckUtils]: 14: Hoare triple {78276#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {78276#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:13,402 INFO L290 TraceCheckUtils]: 15: Hoare triple {78276#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {78277#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:07:13,403 INFO L290 TraceCheckUtils]: 16: Hoare triple {78277#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78278#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:07:13,403 INFO L290 TraceCheckUtils]: 17: Hoare triple {78278#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78335#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:07:13,404 INFO L290 TraceCheckUtils]: 18: Hoare triple {78335#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {78264#false} is VALID [2022-04-08 10:07:13,404 INFO L290 TraceCheckUtils]: 19: Hoare triple {78264#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78264#false} is VALID [2022-04-08 10:07:13,404 INFO L290 TraceCheckUtils]: 20: Hoare triple {78264#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78264#false} is VALID [2022-04-08 10:07:13,404 INFO L290 TraceCheckUtils]: 21: Hoare triple {78264#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78264#false} is VALID [2022-04-08 10:07:13,404 INFO L290 TraceCheckUtils]: 22: Hoare triple {78264#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78264#false} is VALID [2022-04-08 10:07:13,404 INFO L290 TraceCheckUtils]: 23: Hoare triple {78264#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78264#false} is VALID [2022-04-08 10:07:13,404 INFO L290 TraceCheckUtils]: 24: Hoare triple {78264#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78264#false} is VALID [2022-04-08 10:07:13,404 INFO L290 TraceCheckUtils]: 25: Hoare triple {78264#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78264#false} is VALID [2022-04-08 10:07:13,404 INFO L290 TraceCheckUtils]: 26: Hoare triple {78264#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78264#false} is VALID [2022-04-08 10:07:13,404 INFO L290 TraceCheckUtils]: 27: Hoare triple {78264#false} assume !(~y~0 % 4294967296 > 0); {78264#false} is VALID [2022-04-08 10:07:13,404 INFO L290 TraceCheckUtils]: 28: Hoare triple {78264#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {78264#false} is VALID [2022-04-08 10:07:13,404 INFO L290 TraceCheckUtils]: 29: Hoare triple {78264#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {78264#false} is VALID [2022-04-08 10:07:13,404 INFO L290 TraceCheckUtils]: 30: Hoare triple {78264#false} assume !(~x~0 % 4294967296 > 0); {78264#false} is VALID [2022-04-08 10:07:13,404 INFO L272 TraceCheckUtils]: 31: Hoare triple {78264#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {78264#false} is VALID [2022-04-08 10:07:13,404 INFO L290 TraceCheckUtils]: 32: Hoare triple {78264#false} ~cond := #in~cond; {78264#false} is VALID [2022-04-08 10:07:13,404 INFO L290 TraceCheckUtils]: 33: Hoare triple {78264#false} assume 0 == ~cond; {78264#false} is VALID [2022-04-08 10:07:13,404 INFO L290 TraceCheckUtils]: 34: Hoare triple {78264#false} assume !false; {78264#false} is VALID [2022-04-08 10:07:13,405 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-08 10:07:13,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:13,682 INFO L290 TraceCheckUtils]: 34: Hoare triple {78264#false} assume !false; {78264#false} is VALID [2022-04-08 10:07:13,682 INFO L290 TraceCheckUtils]: 33: Hoare triple {78264#false} assume 0 == ~cond; {78264#false} is VALID [2022-04-08 10:07:13,682 INFO L290 TraceCheckUtils]: 32: Hoare triple {78264#false} ~cond := #in~cond; {78264#false} is VALID [2022-04-08 10:07:13,682 INFO L272 TraceCheckUtils]: 31: Hoare triple {78264#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {78264#false} is VALID [2022-04-08 10:07:13,682 INFO L290 TraceCheckUtils]: 30: Hoare triple {78264#false} assume !(~x~0 % 4294967296 > 0); {78264#false} is VALID [2022-04-08 10:07:13,682 INFO L290 TraceCheckUtils]: 29: Hoare triple {78264#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {78264#false} is VALID [2022-04-08 10:07:13,682 INFO L290 TraceCheckUtils]: 28: Hoare triple {78264#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {78264#false} is VALID [2022-04-08 10:07:13,682 INFO L290 TraceCheckUtils]: 27: Hoare triple {78264#false} assume !(~y~0 % 4294967296 > 0); {78264#false} is VALID [2022-04-08 10:07:13,682 INFO L290 TraceCheckUtils]: 26: Hoare triple {78264#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78264#false} is VALID [2022-04-08 10:07:13,682 INFO L290 TraceCheckUtils]: 25: Hoare triple {78264#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78264#false} is VALID [2022-04-08 10:07:13,683 INFO L290 TraceCheckUtils]: 24: Hoare triple {78264#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78264#false} is VALID [2022-04-08 10:07:13,683 INFO L290 TraceCheckUtils]: 23: Hoare triple {78264#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78264#false} is VALID [2022-04-08 10:07:13,683 INFO L290 TraceCheckUtils]: 22: Hoare triple {78264#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78264#false} is VALID [2022-04-08 10:07:13,683 INFO L290 TraceCheckUtils]: 21: Hoare triple {78264#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78264#false} is VALID [2022-04-08 10:07:13,683 INFO L290 TraceCheckUtils]: 20: Hoare triple {78264#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78264#false} is VALID [2022-04-08 10:07:13,683 INFO L290 TraceCheckUtils]: 19: Hoare triple {78264#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78264#false} is VALID [2022-04-08 10:07:13,683 INFO L290 TraceCheckUtils]: 18: Hoare triple {78435#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {78264#false} is VALID [2022-04-08 10:07:13,684 INFO L290 TraceCheckUtils]: 17: Hoare triple {78439#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78435#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:07:13,684 INFO L290 TraceCheckUtils]: 16: Hoare triple {78443#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78439#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:13,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {78447#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {78443#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:07:13,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {78447#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {78447#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:07:13,685 INFO L290 TraceCheckUtils]: 13: Hoare triple {78454#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78447#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:07:13,686 INFO L290 TraceCheckUtils]: 12: Hoare triple {78458#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78454#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:13,687 INFO L290 TraceCheckUtils]: 11: Hoare triple {78462#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78458#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:13,687 INFO L290 TraceCheckUtils]: 10: Hoare triple {78466#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78462#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:07:13,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {78470#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78466#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:07:13,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {78474#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78470#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:07:13,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {78478#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78474#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:07:13,690 INFO L290 TraceCheckUtils]: 6: Hoare triple {78482#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {78478#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:13,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {78263#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {78482#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:07:13,690 INFO L272 TraceCheckUtils]: 4: Hoare triple {78263#true} call #t~ret13 := main(); {78263#true} is VALID [2022-04-08 10:07:13,690 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78263#true} {78263#true} #72#return; {78263#true} is VALID [2022-04-08 10:07:13,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {78263#true} assume true; {78263#true} is VALID [2022-04-08 10:07:13,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {78263#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {78263#true} is VALID [2022-04-08 10:07:13,690 INFO L272 TraceCheckUtils]: 0: Hoare triple {78263#true} call ULTIMATE.init(); {78263#true} is VALID [2022-04-08 10:07:13,690 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-08 10:07:13,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771558795] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:13,690 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:13,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-08 10:07:13,691 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:13,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1214638821] [2022-04-08 10:07:13,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1214638821] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:13,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:13,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 10:07:13,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192081269] [2022-04-08 10:07:13,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:13,691 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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 35 [2022-04-08 10:07:13,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:13,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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-08 10:07:13,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:13,708 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 10:07:13,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:13,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 10:07:13,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:07:13,708 INFO L87 Difference]: Start difference. First operand 333 states and 452 transitions. Second operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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-08 10:07:17,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:17,393 INFO L93 Difference]: Finished difference Result 433 states and 560 transitions. [2022-04-08 10:07:17,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 10:07:17,393 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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 35 [2022-04-08 10:07:17,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:17,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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-08 10:07:17,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 95 transitions. [2022-04-08 10:07:17,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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-08 10:07:17,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 95 transitions. [2022-04-08 10:07:17,408 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 95 transitions. [2022-04-08 10:07:17,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:17,464 INFO L225 Difference]: With dead ends: 433 [2022-04-08 10:07:17,464 INFO L226 Difference]: Without dead ends: 416 [2022-04-08 10:07:17,464 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=374, Invalid=1432, Unknown=0, NotChecked=0, Total=1806 [2022-04-08 10:07:17,465 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 51 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:17,465 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 90 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:07:17,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2022-04-08 10:07:18,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 333. [2022-04-08 10:07:18,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:18,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 416 states. Second operand has 333 states, 328 states have (on average 1.3628048780487805) internal successors, (447), 328 states have internal predecessors, (447), 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-08 10:07:18,383 INFO L74 IsIncluded]: Start isIncluded. First operand 416 states. Second operand has 333 states, 328 states have (on average 1.3628048780487805) internal successors, (447), 328 states have internal predecessors, (447), 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-08 10:07:18,383 INFO L87 Difference]: Start difference. First operand 416 states. Second operand has 333 states, 328 states have (on average 1.3628048780487805) internal successors, (447), 328 states have internal predecessors, (447), 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-08 10:07:18,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:18,389 INFO L93 Difference]: Finished difference Result 416 states and 543 transitions. [2022-04-08 10:07:18,389 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 543 transitions. [2022-04-08 10:07:18,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:18,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:18,390 INFO L74 IsIncluded]: Start isIncluded. First operand has 333 states, 328 states have (on average 1.3628048780487805) internal successors, (447), 328 states have internal predecessors, (447), 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 416 states. [2022-04-08 10:07:18,390 INFO L87 Difference]: Start difference. First operand has 333 states, 328 states have (on average 1.3628048780487805) internal successors, (447), 328 states have internal predecessors, (447), 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 416 states. [2022-04-08 10:07:18,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:18,396 INFO L93 Difference]: Finished difference Result 416 states and 543 transitions. [2022-04-08 10:07:18,396 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 543 transitions. [2022-04-08 10:07:18,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:18,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:18,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:18,397 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:18,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 328 states have (on average 1.3628048780487805) internal successors, (447), 328 states have internal predecessors, (447), 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-08 10:07:18,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 451 transitions. [2022-04-08 10:07:18,401 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 451 transitions. Word has length 35 [2022-04-08 10:07:18,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:18,402 INFO L478 AbstractCegarLoop]: Abstraction has 333 states and 451 transitions. [2022-04-08 10:07:18,402 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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-08 10:07:18,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 333 states and 451 transitions. [2022-04-08 10:07:21,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 451 edges. 451 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:21,121 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 451 transitions. [2022-04-08 10:07:21,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 10:07:21,122 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:21,122 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:21,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2022-04-08 10:07:21,338 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:21,338 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:21,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:21,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1222139704, now seen corresponding path program 51 times [2022-04-08 10:07:21,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:21,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [817842535] [2022-04-08 10:07:21,341 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:21,341 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:21,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1222139704, now seen corresponding path program 52 times [2022-04-08 10:07:21,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:21,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285268120] [2022-04-08 10:07:21,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:21,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:21,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:21,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:21,521 INFO L290 TraceCheckUtils]: 0: Hoare triple {80914#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {80897#true} is VALID [2022-04-08 10:07:21,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {80897#true} assume true; {80897#true} is VALID [2022-04-08 10:07:21,521 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {80897#true} {80897#true} #72#return; {80897#true} is VALID [2022-04-08 10:07:21,521 INFO L272 TraceCheckUtils]: 0: Hoare triple {80897#true} call ULTIMATE.init(); {80914#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:21,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {80914#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {80897#true} is VALID [2022-04-08 10:07:21,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {80897#true} assume true; {80897#true} is VALID [2022-04-08 10:07:21,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80897#true} {80897#true} #72#return; {80897#true} is VALID [2022-04-08 10:07:21,522 INFO L272 TraceCheckUtils]: 4: Hoare triple {80897#true} call #t~ret13 := main(); {80897#true} is VALID [2022-04-08 10:07:21,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {80897#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {80902#(= main_~y~0 0)} is VALID [2022-04-08 10:07:21,522 INFO L290 TraceCheckUtils]: 6: Hoare triple {80902#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80903#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:21,523 INFO L290 TraceCheckUtils]: 7: Hoare triple {80903#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80904#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:21,523 INFO L290 TraceCheckUtils]: 8: Hoare triple {80904#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80905#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:21,524 INFO L290 TraceCheckUtils]: 9: Hoare triple {80905#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80906#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:21,524 INFO L290 TraceCheckUtils]: 10: Hoare triple {80906#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80907#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:21,525 INFO L290 TraceCheckUtils]: 11: Hoare triple {80907#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80908#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:21,525 INFO L290 TraceCheckUtils]: 12: Hoare triple {80908#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80909#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:21,526 INFO L290 TraceCheckUtils]: 13: Hoare triple {80909#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80910#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:21,526 INFO L290 TraceCheckUtils]: 14: Hoare triple {80910#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80911#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:21,527 INFO L290 TraceCheckUtils]: 15: Hoare triple {80911#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {80911#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:21,527 INFO L290 TraceCheckUtils]: 16: Hoare triple {80911#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {80912#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:07:21,527 INFO L290 TraceCheckUtils]: 17: Hoare triple {80912#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {80913#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:07:21,528 INFO L290 TraceCheckUtils]: 18: Hoare triple {80913#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {80898#false} is VALID [2022-04-08 10:07:21,528 INFO L290 TraceCheckUtils]: 19: Hoare triple {80898#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80898#false} is VALID [2022-04-08 10:07:21,528 INFO L290 TraceCheckUtils]: 20: Hoare triple {80898#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80898#false} is VALID [2022-04-08 10:07:21,528 INFO L290 TraceCheckUtils]: 21: Hoare triple {80898#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80898#false} is VALID [2022-04-08 10:07:21,528 INFO L290 TraceCheckUtils]: 22: Hoare triple {80898#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80898#false} is VALID [2022-04-08 10:07:21,528 INFO L290 TraceCheckUtils]: 23: Hoare triple {80898#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80898#false} is VALID [2022-04-08 10:07:21,528 INFO L290 TraceCheckUtils]: 24: Hoare triple {80898#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80898#false} is VALID [2022-04-08 10:07:21,528 INFO L290 TraceCheckUtils]: 25: Hoare triple {80898#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80898#false} is VALID [2022-04-08 10:07:21,528 INFO L290 TraceCheckUtils]: 26: Hoare triple {80898#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80898#false} is VALID [2022-04-08 10:07:21,528 INFO L290 TraceCheckUtils]: 27: Hoare triple {80898#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80898#false} is VALID [2022-04-08 10:07:21,528 INFO L290 TraceCheckUtils]: 28: Hoare triple {80898#false} assume !(~y~0 % 4294967296 > 0); {80898#false} is VALID [2022-04-08 10:07:21,528 INFO L290 TraceCheckUtils]: 29: Hoare triple {80898#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {80898#false} is VALID [2022-04-08 10:07:21,528 INFO L290 TraceCheckUtils]: 30: Hoare triple {80898#false} assume !(~x~0 % 4294967296 > 0); {80898#false} is VALID [2022-04-08 10:07:21,528 INFO L272 TraceCheckUtils]: 31: Hoare triple {80898#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {80898#false} is VALID [2022-04-08 10:07:21,528 INFO L290 TraceCheckUtils]: 32: Hoare triple {80898#false} ~cond := #in~cond; {80898#false} is VALID [2022-04-08 10:07:21,529 INFO L290 TraceCheckUtils]: 33: Hoare triple {80898#false} assume 0 == ~cond; {80898#false} is VALID [2022-04-08 10:07:21,529 INFO L290 TraceCheckUtils]: 34: Hoare triple {80898#false} assume !false; {80898#false} is VALID [2022-04-08 10:07:21,529 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-08 10:07:21,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:21,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285268120] [2022-04-08 10:07:21,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285268120] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:21,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694903675] [2022-04-08 10:07:21,529 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:07:21,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:21,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:21,530 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:07:21,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-04-08 10:07:21,571 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:07:21,571 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:21,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 10:07:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:21,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:21,842 INFO L272 TraceCheckUtils]: 0: Hoare triple {80897#true} call ULTIMATE.init(); {80897#true} is VALID [2022-04-08 10:07:21,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {80897#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {80897#true} is VALID [2022-04-08 10:07:21,842 INFO L290 TraceCheckUtils]: 2: Hoare triple {80897#true} assume true; {80897#true} is VALID [2022-04-08 10:07:21,842 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80897#true} {80897#true} #72#return; {80897#true} is VALID [2022-04-08 10:07:21,842 INFO L272 TraceCheckUtils]: 4: Hoare triple {80897#true} call #t~ret13 := main(); {80897#true} is VALID [2022-04-08 10:07:21,843 INFO L290 TraceCheckUtils]: 5: Hoare triple {80897#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {80902#(= main_~y~0 0)} is VALID [2022-04-08 10:07:21,843 INFO L290 TraceCheckUtils]: 6: Hoare triple {80902#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80903#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:21,843 INFO L290 TraceCheckUtils]: 7: Hoare triple {80903#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80904#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:21,844 INFO L290 TraceCheckUtils]: 8: Hoare triple {80904#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80905#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:21,845 INFO L290 TraceCheckUtils]: 9: Hoare triple {80905#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80906#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:21,845 INFO L290 TraceCheckUtils]: 10: Hoare triple {80906#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80907#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:21,846 INFO L290 TraceCheckUtils]: 11: Hoare triple {80907#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80908#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:21,846 INFO L290 TraceCheckUtils]: 12: Hoare triple {80908#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80909#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:21,847 INFO L290 TraceCheckUtils]: 13: Hoare triple {80909#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80910#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:21,847 INFO L290 TraceCheckUtils]: 14: Hoare triple {80910#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {80911#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:21,847 INFO L290 TraceCheckUtils]: 15: Hoare triple {80911#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {80911#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:21,848 INFO L290 TraceCheckUtils]: 16: Hoare triple {80911#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {80912#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:07:21,848 INFO L290 TraceCheckUtils]: 17: Hoare triple {80912#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {80969#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:07:21,849 INFO L290 TraceCheckUtils]: 18: Hoare triple {80969#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {80898#false} is VALID [2022-04-08 10:07:21,849 INFO L290 TraceCheckUtils]: 19: Hoare triple {80898#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80898#false} is VALID [2022-04-08 10:07:21,849 INFO L290 TraceCheckUtils]: 20: Hoare triple {80898#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80898#false} is VALID [2022-04-08 10:07:21,849 INFO L290 TraceCheckUtils]: 21: Hoare triple {80898#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80898#false} is VALID [2022-04-08 10:07:21,849 INFO L290 TraceCheckUtils]: 22: Hoare triple {80898#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80898#false} is VALID [2022-04-08 10:07:21,849 INFO L290 TraceCheckUtils]: 23: Hoare triple {80898#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80898#false} is VALID [2022-04-08 10:07:21,849 INFO L290 TraceCheckUtils]: 24: Hoare triple {80898#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80898#false} is VALID [2022-04-08 10:07:21,849 INFO L290 TraceCheckUtils]: 25: Hoare triple {80898#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80898#false} is VALID [2022-04-08 10:07:21,849 INFO L290 TraceCheckUtils]: 26: Hoare triple {80898#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80898#false} is VALID [2022-04-08 10:07:21,849 INFO L290 TraceCheckUtils]: 27: Hoare triple {80898#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80898#false} is VALID [2022-04-08 10:07:21,849 INFO L290 TraceCheckUtils]: 28: Hoare triple {80898#false} assume !(~y~0 % 4294967296 > 0); {80898#false} is VALID [2022-04-08 10:07:21,849 INFO L290 TraceCheckUtils]: 29: Hoare triple {80898#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {80898#false} is VALID [2022-04-08 10:07:21,849 INFO L290 TraceCheckUtils]: 30: Hoare triple {80898#false} assume !(~x~0 % 4294967296 > 0); {80898#false} is VALID [2022-04-08 10:07:21,849 INFO L272 TraceCheckUtils]: 31: Hoare triple {80898#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {80898#false} is VALID [2022-04-08 10:07:21,849 INFO L290 TraceCheckUtils]: 32: Hoare triple {80898#false} ~cond := #in~cond; {80898#false} is VALID [2022-04-08 10:07:21,849 INFO L290 TraceCheckUtils]: 33: Hoare triple {80898#false} assume 0 == ~cond; {80898#false} is VALID [2022-04-08 10:07:21,850 INFO L290 TraceCheckUtils]: 34: Hoare triple {80898#false} assume !false; {80898#false} is VALID [2022-04-08 10:07:21,850 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-08 10:07:21,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:22,149 INFO L290 TraceCheckUtils]: 34: Hoare triple {80898#false} assume !false; {80898#false} is VALID [2022-04-08 10:07:22,150 INFO L290 TraceCheckUtils]: 33: Hoare triple {80898#false} assume 0 == ~cond; {80898#false} is VALID [2022-04-08 10:07:22,150 INFO L290 TraceCheckUtils]: 32: Hoare triple {80898#false} ~cond := #in~cond; {80898#false} is VALID [2022-04-08 10:07:22,150 INFO L272 TraceCheckUtils]: 31: Hoare triple {80898#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {80898#false} is VALID [2022-04-08 10:07:22,150 INFO L290 TraceCheckUtils]: 30: Hoare triple {80898#false} assume !(~x~0 % 4294967296 > 0); {80898#false} is VALID [2022-04-08 10:07:22,150 INFO L290 TraceCheckUtils]: 29: Hoare triple {80898#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {80898#false} is VALID [2022-04-08 10:07:22,150 INFO L290 TraceCheckUtils]: 28: Hoare triple {80898#false} assume !(~y~0 % 4294967296 > 0); {80898#false} is VALID [2022-04-08 10:07:22,150 INFO L290 TraceCheckUtils]: 27: Hoare triple {80898#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80898#false} is VALID [2022-04-08 10:07:22,150 INFO L290 TraceCheckUtils]: 26: Hoare triple {80898#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80898#false} is VALID [2022-04-08 10:07:22,150 INFO L290 TraceCheckUtils]: 25: Hoare triple {80898#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80898#false} is VALID [2022-04-08 10:07:22,150 INFO L290 TraceCheckUtils]: 24: Hoare triple {80898#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80898#false} is VALID [2022-04-08 10:07:22,150 INFO L290 TraceCheckUtils]: 23: Hoare triple {80898#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80898#false} is VALID [2022-04-08 10:07:22,150 INFO L290 TraceCheckUtils]: 22: Hoare triple {80898#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80898#false} is VALID [2022-04-08 10:07:22,150 INFO L290 TraceCheckUtils]: 21: Hoare triple {80898#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80898#false} is VALID [2022-04-08 10:07:22,150 INFO L290 TraceCheckUtils]: 20: Hoare triple {80898#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80898#false} is VALID [2022-04-08 10:07:22,150 INFO L290 TraceCheckUtils]: 19: Hoare triple {80898#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80898#false} is VALID [2022-04-08 10:07:22,151 INFO L290 TraceCheckUtils]: 18: Hoare triple {81069#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {80898#false} is VALID [2022-04-08 10:07:22,151 INFO L290 TraceCheckUtils]: 17: Hoare triple {81073#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81069#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:07:22,152 INFO L290 TraceCheckUtils]: 16: Hoare triple {81077#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {81073#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:22,152 INFO L290 TraceCheckUtils]: 15: Hoare triple {81077#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {81077#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:22,152 INFO L290 TraceCheckUtils]: 14: Hoare triple {81084#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81077#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:22,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {81088#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81084#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:22,154 INFO L290 TraceCheckUtils]: 12: Hoare triple {81092#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81088#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:07:22,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {81096#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81092#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:07:22,155 INFO L290 TraceCheckUtils]: 10: Hoare triple {81100#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81096#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:07:22,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {81104#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81100#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:07:22,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {81108#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81104#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:22,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {81112#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81108#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:07:22,157 INFO L290 TraceCheckUtils]: 6: Hoare triple {81116#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {81112#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:22,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {80897#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {81116#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:07:22,157 INFO L272 TraceCheckUtils]: 4: Hoare triple {80897#true} call #t~ret13 := main(); {80897#true} is VALID [2022-04-08 10:07:22,157 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80897#true} {80897#true} #72#return; {80897#true} is VALID [2022-04-08 10:07:22,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {80897#true} assume true; {80897#true} is VALID [2022-04-08 10:07:22,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {80897#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {80897#true} is VALID [2022-04-08 10:07:22,157 INFO L272 TraceCheckUtils]: 0: Hoare triple {80897#true} call ULTIMATE.init(); {80897#true} is VALID [2022-04-08 10:07:22,158 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-08 10:07:22,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694903675] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:22,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:22,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-08 10:07:22,158 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:22,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [817842535] [2022-04-08 10:07:22,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [817842535] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:22,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:22,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 10:07:22,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007855268] [2022-04-08 10:07:22,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:22,165 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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 35 [2022-04-08 10:07:22,165 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:22,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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-08 10:07:22,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:22,187 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 10:07:22,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:22,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 10:07:22,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2022-04-08 10:07:22,188 INFO L87 Difference]: Start difference. First operand 333 states and 451 transitions. Second operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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-08 10:07:25,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:25,477 INFO L93 Difference]: Finished difference Result 453 states and 580 transitions. [2022-04-08 10:07:25,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 10:07:25,477 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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 35 [2022-04-08 10:07:25,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:25,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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-08 10:07:25,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 101 transitions. [2022-04-08 10:07:25,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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-08 10:07:25,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 101 transitions. [2022-04-08 10:07:25,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 101 transitions. [2022-04-08 10:07:25,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:25,539 INFO L225 Difference]: With dead ends: 453 [2022-04-08 10:07:25,539 INFO L226 Difference]: Without dead ends: 436 [2022-04-08 10:07:25,539 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=353, Invalid=1287, Unknown=0, NotChecked=0, Total=1640 [2022-04-08 10:07:25,539 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 62 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:25,539 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 101 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:07:25,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2022-04-08 10:07:26,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 333. [2022-04-08 10:07:26,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:26,515 INFO L82 GeneralOperation]: Start isEquivalent. First operand 436 states. Second operand has 333 states, 328 states have (on average 1.3597560975609757) internal successors, (446), 328 states have internal predecessors, (446), 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-08 10:07:26,515 INFO L74 IsIncluded]: Start isIncluded. First operand 436 states. Second operand has 333 states, 328 states have (on average 1.3597560975609757) internal successors, (446), 328 states have internal predecessors, (446), 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-08 10:07:26,516 INFO L87 Difference]: Start difference. First operand 436 states. Second operand has 333 states, 328 states have (on average 1.3597560975609757) internal successors, (446), 328 states have internal predecessors, (446), 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-08 10:07:26,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:26,522 INFO L93 Difference]: Finished difference Result 436 states and 563 transitions. [2022-04-08 10:07:26,522 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 563 transitions. [2022-04-08 10:07:26,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:26,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:26,522 INFO L74 IsIncluded]: Start isIncluded. First operand has 333 states, 328 states have (on average 1.3597560975609757) internal successors, (446), 328 states have internal predecessors, (446), 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 436 states. [2022-04-08 10:07:26,523 INFO L87 Difference]: Start difference. First operand has 333 states, 328 states have (on average 1.3597560975609757) internal successors, (446), 328 states have internal predecessors, (446), 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 436 states. [2022-04-08 10:07:26,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:26,532 INFO L93 Difference]: Finished difference Result 436 states and 563 transitions. [2022-04-08 10:07:26,532 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 563 transitions. [2022-04-08 10:07:26,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:26,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:26,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:26,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:26,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 328 states have (on average 1.3597560975609757) internal successors, (446), 328 states have internal predecessors, (446), 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-08 10:07:26,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 450 transitions. [2022-04-08 10:07:26,537 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 450 transitions. Word has length 35 [2022-04-08 10:07:26,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:26,537 INFO L478 AbstractCegarLoop]: Abstraction has 333 states and 450 transitions. [2022-04-08 10:07:26,537 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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-08 10:07:26,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 333 states and 450 transitions. [2022-04-08 10:07:28,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 450 edges. 450 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:28,481 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 450 transitions. [2022-04-08 10:07:28,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 10:07:28,481 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:28,481 INFO L499 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:28,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-04-08 10:07:28,694 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-04-08 10:07:28,694 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:28,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:28,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1541322344, now seen corresponding path program 39 times [2022-04-08 10:07:28,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:28,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2105423620] [2022-04-08 10:07:28,696 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:28,696 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:28,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1541322344, now seen corresponding path program 40 times [2022-04-08 10:07:28,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:28,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261370310] [2022-04-08 10:07:28,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:28,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:28,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:29,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:29,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:29,100 INFO L290 TraceCheckUtils]: 0: Hoare triple {83634#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {83607#true} is VALID [2022-04-08 10:07:29,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {83607#true} assume true; {83607#true} is VALID [2022-04-08 10:07:29,100 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {83607#true} {83607#true} #72#return; {83607#true} is VALID [2022-04-08 10:07:29,100 INFO L272 TraceCheckUtils]: 0: Hoare triple {83607#true} call ULTIMATE.init(); {83634#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:29,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {83634#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {83607#true} is VALID [2022-04-08 10:07:29,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {83607#true} assume true; {83607#true} is VALID [2022-04-08 10:07:29,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83607#true} {83607#true} #72#return; {83607#true} is VALID [2022-04-08 10:07:29,100 INFO L272 TraceCheckUtils]: 4: Hoare triple {83607#true} call #t~ret13 := main(); {83607#true} is VALID [2022-04-08 10:07:29,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {83607#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {83612#(= main_~y~0 0)} is VALID [2022-04-08 10:07:29,101 INFO L290 TraceCheckUtils]: 6: Hoare triple {83612#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83613#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:29,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {83613#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83614#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:29,102 INFO L290 TraceCheckUtils]: 8: Hoare triple {83614#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83615#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:29,103 INFO L290 TraceCheckUtils]: 9: Hoare triple {83615#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83616#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:29,103 INFO L290 TraceCheckUtils]: 10: Hoare triple {83616#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83617#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:29,104 INFO L290 TraceCheckUtils]: 11: Hoare triple {83617#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83618#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:29,104 INFO L290 TraceCheckUtils]: 12: Hoare triple {83618#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83619#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:29,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {83619#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83620#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:29,105 INFO L290 TraceCheckUtils]: 14: Hoare triple {83620#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83621#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:29,106 INFO L290 TraceCheckUtils]: 15: Hoare triple {83621#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83622#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:29,106 INFO L290 TraceCheckUtils]: 16: Hoare triple {83622#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83623#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:29,107 INFO L290 TraceCheckUtils]: 17: Hoare triple {83623#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83624#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:07:29,107 INFO L290 TraceCheckUtils]: 18: Hoare triple {83624#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83625#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:07:29,108 INFO L290 TraceCheckUtils]: 19: Hoare triple {83625#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83626#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:07:29,108 INFO L290 TraceCheckUtils]: 20: Hoare triple {83626#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83627#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:07:29,109 INFO L290 TraceCheckUtils]: 21: Hoare triple {83627#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83628#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:07:29,109 INFO L290 TraceCheckUtils]: 22: Hoare triple {83628#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83629#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:07:29,110 INFO L290 TraceCheckUtils]: 23: Hoare triple {83629#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83630#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:07:29,110 INFO L290 TraceCheckUtils]: 24: Hoare triple {83630#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83631#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:07:29,111 INFO L290 TraceCheckUtils]: 25: Hoare triple {83631#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83632#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:07:29,111 INFO L290 TraceCheckUtils]: 26: Hoare triple {83632#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !(~x~0 % 4294967296 > 0); {83632#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:07:29,111 INFO L290 TraceCheckUtils]: 27: Hoare triple {83632#(and (<= 20 main_~y~0) (<= main_~y~0 20))} ~z~0 := ~y~0; {83633#(and (<= (div main_~z~0 4294967296) 0) (<= 20 main_~z~0))} is VALID [2022-04-08 10:07:29,112 INFO L290 TraceCheckUtils]: 28: Hoare triple {83633#(and (<= (div main_~z~0 4294967296) 0) (<= 20 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {83608#false} is VALID [2022-04-08 10:07:29,112 INFO L290 TraceCheckUtils]: 29: Hoare triple {83608#false} assume !(~y~0 % 4294967296 > 0); {83608#false} is VALID [2022-04-08 10:07:29,112 INFO L290 TraceCheckUtils]: 30: Hoare triple {83608#false} assume !(~x~0 % 4294967296 > 0); {83608#false} is VALID [2022-04-08 10:07:29,112 INFO L272 TraceCheckUtils]: 31: Hoare triple {83608#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {83608#false} is VALID [2022-04-08 10:07:29,112 INFO L290 TraceCheckUtils]: 32: Hoare triple {83608#false} ~cond := #in~cond; {83608#false} is VALID [2022-04-08 10:07:29,112 INFO L290 TraceCheckUtils]: 33: Hoare triple {83608#false} assume 0 == ~cond; {83608#false} is VALID [2022-04-08 10:07:29,112 INFO L290 TraceCheckUtils]: 34: Hoare triple {83608#false} assume !false; {83608#false} is VALID [2022-04-08 10:07:29,112 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:29,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:29,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261370310] [2022-04-08 10:07:29,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261370310] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:29,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390913275] [2022-04-08 10:07:29,112 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:07:29,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:29,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:29,113 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:07:29,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-04-08 10:07:29,154 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:07:29,154 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:29,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-08 10:07:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:29,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:29,515 INFO L272 TraceCheckUtils]: 0: Hoare triple {83607#true} call ULTIMATE.init(); {83607#true} is VALID [2022-04-08 10:07:29,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {83607#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {83607#true} is VALID [2022-04-08 10:07:29,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {83607#true} assume true; {83607#true} is VALID [2022-04-08 10:07:29,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83607#true} {83607#true} #72#return; {83607#true} is VALID [2022-04-08 10:07:29,516 INFO L272 TraceCheckUtils]: 4: Hoare triple {83607#true} call #t~ret13 := main(); {83607#true} is VALID [2022-04-08 10:07:29,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {83607#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {83612#(= main_~y~0 0)} is VALID [2022-04-08 10:07:29,516 INFO L290 TraceCheckUtils]: 6: Hoare triple {83612#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83613#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:29,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {83613#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83614#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:29,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {83614#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83615#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:29,518 INFO L290 TraceCheckUtils]: 9: Hoare triple {83615#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83616#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:29,518 INFO L290 TraceCheckUtils]: 10: Hoare triple {83616#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83617#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:29,519 INFO L290 TraceCheckUtils]: 11: Hoare triple {83617#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83618#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:29,519 INFO L290 TraceCheckUtils]: 12: Hoare triple {83618#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83619#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:29,520 INFO L290 TraceCheckUtils]: 13: Hoare triple {83619#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83620#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:29,520 INFO L290 TraceCheckUtils]: 14: Hoare triple {83620#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83621#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:29,521 INFO L290 TraceCheckUtils]: 15: Hoare triple {83621#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83622#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:29,521 INFO L290 TraceCheckUtils]: 16: Hoare triple {83622#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83623#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:29,522 INFO L290 TraceCheckUtils]: 17: Hoare triple {83623#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83624#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:07:29,522 INFO L290 TraceCheckUtils]: 18: Hoare triple {83624#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83625#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:07:29,523 INFO L290 TraceCheckUtils]: 19: Hoare triple {83625#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83626#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:07:29,523 INFO L290 TraceCheckUtils]: 20: Hoare triple {83626#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83627#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:07:29,524 INFO L290 TraceCheckUtils]: 21: Hoare triple {83627#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83628#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:07:29,524 INFO L290 TraceCheckUtils]: 22: Hoare triple {83628#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83629#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:07:29,525 INFO L290 TraceCheckUtils]: 23: Hoare triple {83629#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83630#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:07:29,525 INFO L290 TraceCheckUtils]: 24: Hoare triple {83630#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83631#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:07:29,526 INFO L290 TraceCheckUtils]: 25: Hoare triple {83631#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83632#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:07:29,526 INFO L290 TraceCheckUtils]: 26: Hoare triple {83632#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !(~x~0 % 4294967296 > 0); {83632#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:07:29,526 INFO L290 TraceCheckUtils]: 27: Hoare triple {83632#(and (<= 20 main_~y~0) (<= main_~y~0 20))} ~z~0 := ~y~0; {83719#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-08 10:07:29,527 INFO L290 TraceCheckUtils]: 28: Hoare triple {83719#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {83608#false} is VALID [2022-04-08 10:07:29,527 INFO L290 TraceCheckUtils]: 29: Hoare triple {83608#false} assume !(~y~0 % 4294967296 > 0); {83608#false} is VALID [2022-04-08 10:07:29,527 INFO L290 TraceCheckUtils]: 30: Hoare triple {83608#false} assume !(~x~0 % 4294967296 > 0); {83608#false} is VALID [2022-04-08 10:07:29,527 INFO L272 TraceCheckUtils]: 31: Hoare triple {83608#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {83608#false} is VALID [2022-04-08 10:07:29,527 INFO L290 TraceCheckUtils]: 32: Hoare triple {83608#false} ~cond := #in~cond; {83608#false} is VALID [2022-04-08 10:07:29,527 INFO L290 TraceCheckUtils]: 33: Hoare triple {83608#false} assume 0 == ~cond; {83608#false} is VALID [2022-04-08 10:07:29,527 INFO L290 TraceCheckUtils]: 34: Hoare triple {83608#false} assume !false; {83608#false} is VALID [2022-04-08 10:07:29,527 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:29,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:30,307 INFO L290 TraceCheckUtils]: 34: Hoare triple {83608#false} assume !false; {83608#false} is VALID [2022-04-08 10:07:30,307 INFO L290 TraceCheckUtils]: 33: Hoare triple {83608#false} assume 0 == ~cond; {83608#false} is VALID [2022-04-08 10:07:30,307 INFO L290 TraceCheckUtils]: 32: Hoare triple {83608#false} ~cond := #in~cond; {83608#false} is VALID [2022-04-08 10:07:30,307 INFO L272 TraceCheckUtils]: 31: Hoare triple {83608#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {83608#false} is VALID [2022-04-08 10:07:30,307 INFO L290 TraceCheckUtils]: 30: Hoare triple {83608#false} assume !(~x~0 % 4294967296 > 0); {83608#false} is VALID [2022-04-08 10:07:30,307 INFO L290 TraceCheckUtils]: 29: Hoare triple {83608#false} assume !(~y~0 % 4294967296 > 0); {83608#false} is VALID [2022-04-08 10:07:30,308 INFO L290 TraceCheckUtils]: 28: Hoare triple {83759#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {83608#false} is VALID [2022-04-08 10:07:30,308 INFO L290 TraceCheckUtils]: 27: Hoare triple {83763#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {83759#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:07:30,308 INFO L290 TraceCheckUtils]: 26: Hoare triple {83763#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {83763#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:30,309 INFO L290 TraceCheckUtils]: 25: Hoare triple {83770#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83763#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:30,310 INFO L290 TraceCheckUtils]: 24: Hoare triple {83774#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83770#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:07:30,310 INFO L290 TraceCheckUtils]: 23: Hoare triple {83778#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83774#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:07:30,311 INFO L290 TraceCheckUtils]: 22: Hoare triple {83782#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83778#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:07:30,312 INFO L290 TraceCheckUtils]: 21: Hoare triple {83786#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83782#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:07:30,312 INFO L290 TraceCheckUtils]: 20: Hoare triple {83790#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83786#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:30,313 INFO L290 TraceCheckUtils]: 19: Hoare triple {83794#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83790#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:07:30,313 INFO L290 TraceCheckUtils]: 18: Hoare triple {83798#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83794#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:30,314 INFO L290 TraceCheckUtils]: 17: Hoare triple {83802#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83798#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:07:30,315 INFO L290 TraceCheckUtils]: 16: Hoare triple {83806#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83802#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:07:30,315 INFO L290 TraceCheckUtils]: 15: Hoare triple {83810#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83806#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:07:30,316 INFO L290 TraceCheckUtils]: 14: Hoare triple {83814#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83810#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:07:30,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {83818#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83814#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:07:30,317 INFO L290 TraceCheckUtils]: 12: Hoare triple {83822#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83818#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:07:30,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {83826#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83822#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:07:30,318 INFO L290 TraceCheckUtils]: 10: Hoare triple {83830#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83826#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:07:30,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {83834#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83830#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:07:30,320 INFO L290 TraceCheckUtils]: 8: Hoare triple {83838#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83834#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:07:30,320 INFO L290 TraceCheckUtils]: 7: Hoare triple {83842#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83838#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-08 10:07:30,321 INFO L290 TraceCheckUtils]: 6: Hoare triple {83846#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {83842#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:30,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {83607#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {83846#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-08 10:07:30,321 INFO L272 TraceCheckUtils]: 4: Hoare triple {83607#true} call #t~ret13 := main(); {83607#true} is VALID [2022-04-08 10:07:30,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83607#true} {83607#true} #72#return; {83607#true} is VALID [2022-04-08 10:07:30,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {83607#true} assume true; {83607#true} is VALID [2022-04-08 10:07:30,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {83607#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {83607#true} is VALID [2022-04-08 10:07:30,321 INFO L272 TraceCheckUtils]: 0: Hoare triple {83607#true} call ULTIMATE.init(); {83607#true} is VALID [2022-04-08 10:07:30,322 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:30,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390913275] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:30,322 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:30,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-08 10:07:30,322 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:30,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2105423620] [2022-04-08 10:07:30,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2105423620] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:30,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:30,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-08 10:07:30,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167810782] [2022-04-08 10:07:30,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:30,323 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 states have internal predecessors, (31), 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 35 [2022-04-08 10:07:30,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:30,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 states have internal predecessors, (31), 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-08 10:07:30,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:30,343 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-08 10:07:30,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:30,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-08 10:07:30,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=536, Invalid=1720, Unknown=0, NotChecked=0, Total=2256 [2022-04-08 10:07:30,344 INFO L87 Difference]: Start difference. First operand 333 states and 450 transitions. Second operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 states have internal predecessors, (31), 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-08 10:07:37,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:37,133 INFO L93 Difference]: Finished difference Result 582 states and 884 transitions. [2022-04-08 10:07:37,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-08 10:07:37,133 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 states have internal predecessors, (31), 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 35 [2022-04-08 10:07:37,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:37,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 states have internal predecessors, (31), 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-08 10:07:37,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 219 transitions. [2022-04-08 10:07:37,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 states have internal predecessors, (31), 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-08 10:07:37,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 219 transitions. [2022-04-08 10:07:37,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 219 transitions. [2022-04-08 10:07:37,286 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 219 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:37,302 INFO L225 Difference]: With dead ends: 582 [2022-04-08 10:07:37,302 INFO L226 Difference]: Without dead ends: 557 [2022-04-08 10:07:37,303 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1088, Invalid=3742, Unknown=0, NotChecked=0, Total=4830 [2022-04-08 10:07:37,303 INFO L913 BasicCegarLoop]: 98 mSDtfsCounter, 165 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 3740 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 3856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 3740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:37,303 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 210 Invalid, 3856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 3740 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-08 10:07:37,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2022-04-08 10:07:39,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 350. [2022-04-08 10:07:39,029 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:39,030 INFO L82 GeneralOperation]: Start isEquivalent. First operand 557 states. Second operand has 350 states, 345 states have (on average 1.3652173913043477) internal successors, (471), 345 states have internal predecessors, (471), 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-08 10:07:39,030 INFO L74 IsIncluded]: Start isIncluded. First operand 557 states. Second operand has 350 states, 345 states have (on average 1.3652173913043477) internal successors, (471), 345 states have internal predecessors, (471), 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-08 10:07:39,030 INFO L87 Difference]: Start difference. First operand 557 states. Second operand has 350 states, 345 states have (on average 1.3652173913043477) internal successors, (471), 345 states have internal predecessors, (471), 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-08 10:07:39,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:39,039 INFO L93 Difference]: Finished difference Result 557 states and 703 transitions. [2022-04-08 10:07:39,039 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 703 transitions. [2022-04-08 10:07:39,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:39,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:39,039 INFO L74 IsIncluded]: Start isIncluded. First operand has 350 states, 345 states have (on average 1.3652173913043477) internal successors, (471), 345 states have internal predecessors, (471), 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 557 states. [2022-04-08 10:07:39,040 INFO L87 Difference]: Start difference. First operand has 350 states, 345 states have (on average 1.3652173913043477) internal successors, (471), 345 states have internal predecessors, (471), 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 557 states. [2022-04-08 10:07:39,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:39,048 INFO L93 Difference]: Finished difference Result 557 states and 703 transitions. [2022-04-08 10:07:39,048 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 703 transitions. [2022-04-08 10:07:39,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:39,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:39,049 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:39,049 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:39,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 345 states have (on average 1.3652173913043477) internal successors, (471), 345 states have internal predecessors, (471), 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-08 10:07:39,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 475 transitions. [2022-04-08 10:07:39,054 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 475 transitions. Word has length 35 [2022-04-08 10:07:39,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:39,054 INFO L478 AbstractCegarLoop]: Abstraction has 350 states and 475 transitions. [2022-04-08 10:07:39,054 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.24) internal successors, (31), 24 states have internal predecessors, (31), 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-08 10:07:39,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 350 states and 475 transitions. [2022-04-08 10:07:41,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 475 edges. 475 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:41,062 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 475 transitions. [2022-04-08 10:07:41,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 10:07:41,062 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:41,062 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:41,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Ended with exit code 0 [2022-04-08 10:07:41,262 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable60 [2022-04-08 10:07:41,263 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:41,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:41,263 INFO L85 PathProgramCache]: Analyzing trace with hash 225373872, now seen corresponding path program 53 times [2022-04-08 10:07:41,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:41,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [610425054] [2022-04-08 10:07:41,266 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:41,266 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:41,266 INFO L85 PathProgramCache]: Analyzing trace with hash 225373872, now seen corresponding path program 54 times [2022-04-08 10:07:41,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:41,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660701172] [2022-04-08 10:07:41,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:41,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:41,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:41,383 INFO L290 TraceCheckUtils]: 0: Hoare triple {86900#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {86889#true} is VALID [2022-04-08 10:07:41,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {86889#true} assume true; {86889#true} is VALID [2022-04-08 10:07:41,384 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {86889#true} {86889#true} #72#return; {86889#true} is VALID [2022-04-08 10:07:41,384 INFO L272 TraceCheckUtils]: 0: Hoare triple {86889#true} call ULTIMATE.init(); {86900#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:41,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {86900#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {86889#true} is VALID [2022-04-08 10:07:41,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {86889#true} assume true; {86889#true} is VALID [2022-04-08 10:07:41,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86889#true} {86889#true} #72#return; {86889#true} is VALID [2022-04-08 10:07:41,384 INFO L272 TraceCheckUtils]: 4: Hoare triple {86889#true} call #t~ret13 := main(); {86889#true} is VALID [2022-04-08 10:07:41,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {86889#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {86889#true} is VALID [2022-04-08 10:07:41,384 INFO L290 TraceCheckUtils]: 6: Hoare triple {86889#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86889#true} is VALID [2022-04-08 10:07:41,384 INFO L290 TraceCheckUtils]: 7: Hoare triple {86889#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86889#true} is VALID [2022-04-08 10:07:41,384 INFO L290 TraceCheckUtils]: 8: Hoare triple {86889#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86889#true} is VALID [2022-04-08 10:07:41,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {86889#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86889#true} is VALID [2022-04-08 10:07:41,384 INFO L290 TraceCheckUtils]: 10: Hoare triple {86889#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86889#true} is VALID [2022-04-08 10:07:41,385 INFO L290 TraceCheckUtils]: 11: Hoare triple {86889#true} assume !(~x~0 % 4294967296 > 0); {86894#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:41,385 INFO L290 TraceCheckUtils]: 12: Hoare triple {86894#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {86894#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:41,386 INFO L290 TraceCheckUtils]: 13: Hoare triple {86894#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86895#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:07:41,386 INFO L290 TraceCheckUtils]: 14: Hoare triple {86895#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86896#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:41,387 INFO L290 TraceCheckUtils]: 15: Hoare triple {86896#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86897#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:41,388 INFO L290 TraceCheckUtils]: 16: Hoare triple {86897#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86898#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:41,389 INFO L290 TraceCheckUtils]: 17: Hoare triple {86898#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:07:41,389 INFO L290 TraceCheckUtils]: 18: Hoare triple {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~z~0 % 4294967296 > 0); {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:07:41,389 INFO L290 TraceCheckUtils]: 19: Hoare triple {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:07:41,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:07:41,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:07:41,390 INFO L290 TraceCheckUtils]: 22: Hoare triple {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:07:41,391 INFO L290 TraceCheckUtils]: 23: Hoare triple {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:07:41,391 INFO L290 TraceCheckUtils]: 24: Hoare triple {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~y~0 % 4294967296 > 0); {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:07:41,392 INFO L290 TraceCheckUtils]: 25: Hoare triple {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {86898#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:41,392 INFO L290 TraceCheckUtils]: 26: Hoare triple {86898#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {86897#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:41,394 INFO L290 TraceCheckUtils]: 27: Hoare triple {86897#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {86896#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:41,394 INFO L290 TraceCheckUtils]: 28: Hoare triple {86896#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {86895#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:07:41,395 INFO L290 TraceCheckUtils]: 29: Hoare triple {86895#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {86894#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:41,396 INFO L290 TraceCheckUtils]: 30: Hoare triple {86894#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {86890#false} is VALID [2022-04-08 10:07:41,396 INFO L290 TraceCheckUtils]: 31: Hoare triple {86890#false} assume !(~x~0 % 4294967296 > 0); {86890#false} is VALID [2022-04-08 10:07:41,396 INFO L272 TraceCheckUtils]: 32: Hoare triple {86890#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {86890#false} is VALID [2022-04-08 10:07:41,396 INFO L290 TraceCheckUtils]: 33: Hoare triple {86890#false} ~cond := #in~cond; {86890#false} is VALID [2022-04-08 10:07:41,396 INFO L290 TraceCheckUtils]: 34: Hoare triple {86890#false} assume 0 == ~cond; {86890#false} is VALID [2022-04-08 10:07:41,396 INFO L290 TraceCheckUtils]: 35: Hoare triple {86890#false} assume !false; {86890#false} is VALID [2022-04-08 10:07:41,396 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-08 10:07:41,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:41,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660701172] [2022-04-08 10:07:41,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660701172] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:41,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439276876] [2022-04-08 10:07:41,397 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:07:41,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:41,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:41,398 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:07:41,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-04-08 10:07:41,481 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 10:07:41,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:41,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 10:07:41,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:41,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:41,732 INFO L272 TraceCheckUtils]: 0: Hoare triple {86889#true} call ULTIMATE.init(); {86889#true} is VALID [2022-04-08 10:07:41,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {86889#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {86889#true} is VALID [2022-04-08 10:07:41,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {86889#true} assume true; {86889#true} is VALID [2022-04-08 10:07:41,733 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86889#true} {86889#true} #72#return; {86889#true} is VALID [2022-04-08 10:07:41,733 INFO L272 TraceCheckUtils]: 4: Hoare triple {86889#true} call #t~ret13 := main(); {86889#true} is VALID [2022-04-08 10:07:41,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {86889#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {86889#true} is VALID [2022-04-08 10:07:41,733 INFO L290 TraceCheckUtils]: 6: Hoare triple {86889#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86889#true} is VALID [2022-04-08 10:07:41,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {86889#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86889#true} is VALID [2022-04-08 10:07:41,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {86889#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86889#true} is VALID [2022-04-08 10:07:41,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {86889#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86889#true} is VALID [2022-04-08 10:07:41,733 INFO L290 TraceCheckUtils]: 10: Hoare triple {86889#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86889#true} is VALID [2022-04-08 10:07:41,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {86889#true} assume !(~x~0 % 4294967296 > 0); {86894#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:41,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {86894#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {86894#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:41,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {86894#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86895#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:07:41,735 INFO L290 TraceCheckUtils]: 14: Hoare triple {86895#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86896#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:41,736 INFO L290 TraceCheckUtils]: 15: Hoare triple {86896#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86897#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:41,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {86897#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86898#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:41,737 INFO L290 TraceCheckUtils]: 17: Hoare triple {86898#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:07:41,738 INFO L290 TraceCheckUtils]: 18: Hoare triple {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~z~0 % 4294967296 > 0); {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:07:41,738 INFO L290 TraceCheckUtils]: 19: Hoare triple {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:07:41,738 INFO L290 TraceCheckUtils]: 20: Hoare triple {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:07:41,739 INFO L290 TraceCheckUtils]: 21: Hoare triple {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:07:41,739 INFO L290 TraceCheckUtils]: 22: Hoare triple {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:07:41,739 INFO L290 TraceCheckUtils]: 23: Hoare triple {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:07:41,740 INFO L290 TraceCheckUtils]: 24: Hoare triple {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~y~0 % 4294967296 > 0); {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:07:41,741 INFO L290 TraceCheckUtils]: 25: Hoare triple {86899#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {86898#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:41,742 INFO L290 TraceCheckUtils]: 26: Hoare triple {86898#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {86897#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:41,742 INFO L290 TraceCheckUtils]: 27: Hoare triple {86897#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {86896#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:07:41,743 INFO L290 TraceCheckUtils]: 28: Hoare triple {86896#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {86895#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:07:41,744 INFO L290 TraceCheckUtils]: 29: Hoare triple {86895#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {86894#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:41,744 INFO L290 TraceCheckUtils]: 30: Hoare triple {86894#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {86994#(<= (+ main_~x~0 1) (* (div (+ main_~x~0 1) 4294967296) 4294967296))} is VALID [2022-04-08 10:07:41,745 INFO L290 TraceCheckUtils]: 31: Hoare triple {86994#(<= (+ main_~x~0 1) (* (div (+ main_~x~0 1) 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {86890#false} is VALID [2022-04-08 10:07:41,745 INFO L272 TraceCheckUtils]: 32: Hoare triple {86890#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {86890#false} is VALID [2022-04-08 10:07:41,745 INFO L290 TraceCheckUtils]: 33: Hoare triple {86890#false} ~cond := #in~cond; {86890#false} is VALID [2022-04-08 10:07:41,745 INFO L290 TraceCheckUtils]: 34: Hoare triple {86890#false} assume 0 == ~cond; {86890#false} is VALID [2022-04-08 10:07:41,745 INFO L290 TraceCheckUtils]: 35: Hoare triple {86890#false} assume !false; {86890#false} is VALID [2022-04-08 10:07:41,745 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-08 10:07:41,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:42,012 INFO L290 TraceCheckUtils]: 35: Hoare triple {86890#false} assume !false; {86890#false} is VALID [2022-04-08 10:07:42,012 INFO L290 TraceCheckUtils]: 34: Hoare triple {86890#false} assume 0 == ~cond; {86890#false} is VALID [2022-04-08 10:07:42,013 INFO L290 TraceCheckUtils]: 33: Hoare triple {86890#false} ~cond := #in~cond; {86890#false} is VALID [2022-04-08 10:07:42,013 INFO L272 TraceCheckUtils]: 32: Hoare triple {86890#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {86890#false} is VALID [2022-04-08 10:07:42,013 INFO L290 TraceCheckUtils]: 31: Hoare triple {87022#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {86890#false} is VALID [2022-04-08 10:07:42,013 INFO L290 TraceCheckUtils]: 30: Hoare triple {87026#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {87022#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:07:42,014 INFO L290 TraceCheckUtils]: 29: Hoare triple {87030#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {87026#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:42,015 INFO L290 TraceCheckUtils]: 28: Hoare triple {87034#(< 0 (mod (+ main_~x~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {87030#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-08 10:07:42,016 INFO L290 TraceCheckUtils]: 27: Hoare triple {87038#(< 0 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {87034#(< 0 (mod (+ main_~x~0 4294967293) 4294967296))} is VALID [2022-04-08 10:07:42,016 INFO L290 TraceCheckUtils]: 26: Hoare triple {87042#(< 0 (mod (+ 4294967291 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {87038#(< 0 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-08 10:07:42,017 INFO L290 TraceCheckUtils]: 25: Hoare triple {87046#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {87042#(< 0 (mod (+ 4294967291 main_~x~0) 4294967296))} is VALID [2022-04-08 10:07:42,017 INFO L290 TraceCheckUtils]: 24: Hoare triple {87046#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !(~y~0 % 4294967296 > 0); {87046#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-08 10:07:42,017 INFO L290 TraceCheckUtils]: 23: Hoare triple {87046#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87046#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-08 10:07:42,018 INFO L290 TraceCheckUtils]: 22: Hoare triple {87046#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87046#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-08 10:07:42,018 INFO L290 TraceCheckUtils]: 21: Hoare triple {87046#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87046#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-08 10:07:42,018 INFO L290 TraceCheckUtils]: 20: Hoare triple {87046#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87046#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-08 10:07:42,018 INFO L290 TraceCheckUtils]: 19: Hoare triple {87046#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87046#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-08 10:07:42,018 INFO L290 TraceCheckUtils]: 18: Hoare triple {87046#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {87046#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-08 10:07:42,019 INFO L290 TraceCheckUtils]: 17: Hoare triple {87042#(< 0 (mod (+ 4294967291 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {87046#(< 0 (mod (+ 4294967290 main_~x~0) 4294967296))} is VALID [2022-04-08 10:07:42,020 INFO L290 TraceCheckUtils]: 16: Hoare triple {87038#(< 0 (mod (+ 4294967292 main_~x~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {87042#(< 0 (mod (+ 4294967291 main_~x~0) 4294967296))} is VALID [2022-04-08 10:07:42,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {87034#(< 0 (mod (+ main_~x~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {87038#(< 0 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-08 10:07:42,021 INFO L290 TraceCheckUtils]: 14: Hoare triple {87030#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {87034#(< 0 (mod (+ main_~x~0 4294967293) 4294967296))} is VALID [2022-04-08 10:07:42,021 INFO L290 TraceCheckUtils]: 13: Hoare triple {87026#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {87030#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-08 10:07:42,022 INFO L290 TraceCheckUtils]: 12: Hoare triple {87026#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} ~z~0 := ~y~0; {87026#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:42,022 INFO L290 TraceCheckUtils]: 11: Hoare triple {86889#true} assume !(~x~0 % 4294967296 > 0); {87026#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-08 10:07:42,022 INFO L290 TraceCheckUtils]: 10: Hoare triple {86889#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86889#true} is VALID [2022-04-08 10:07:42,022 INFO L290 TraceCheckUtils]: 9: Hoare triple {86889#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86889#true} is VALID [2022-04-08 10:07:42,022 INFO L290 TraceCheckUtils]: 8: Hoare triple {86889#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86889#true} is VALID [2022-04-08 10:07:42,022 INFO L290 TraceCheckUtils]: 7: Hoare triple {86889#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86889#true} is VALID [2022-04-08 10:07:42,022 INFO L290 TraceCheckUtils]: 6: Hoare triple {86889#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {86889#true} is VALID [2022-04-08 10:07:42,022 INFO L290 TraceCheckUtils]: 5: Hoare triple {86889#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {86889#true} is VALID [2022-04-08 10:07:42,022 INFO L272 TraceCheckUtils]: 4: Hoare triple {86889#true} call #t~ret13 := main(); {86889#true} is VALID [2022-04-08 10:07:42,022 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86889#true} {86889#true} #72#return; {86889#true} is VALID [2022-04-08 10:07:42,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {86889#true} assume true; {86889#true} is VALID [2022-04-08 10:07:42,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {86889#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {86889#true} is VALID [2022-04-08 10:07:42,023 INFO L272 TraceCheckUtils]: 0: Hoare triple {86889#true} call ULTIMATE.init(); {86889#true} is VALID [2022-04-08 10:07:42,023 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-08 10:07:42,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439276876] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:42,023 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:42,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2022-04-08 10:07:42,023 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:42,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [610425054] [2022-04-08 10:07:42,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [610425054] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:42,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:42,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 10:07:42,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334289342] [2022-04-08 10:07:42,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:42,023 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 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 36 [2022-04-08 10:07:42,024 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:42,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 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-08 10:07:42,043 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-08 10:07:42,043 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 10:07:42,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:42,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 10:07:42,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2022-04-08 10:07:42,044 INFO L87 Difference]: Start difference. First operand 350 states and 475 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 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-08 10:07:43,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:43,801 INFO L93 Difference]: Finished difference Result 374 states and 500 transitions. [2022-04-08 10:07:43,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 10:07:43,801 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 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 36 [2022-04-08 10:07:43,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:43,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 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-08 10:07:43,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2022-04-08 10:07:43,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 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-08 10:07:43,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2022-04-08 10:07:43,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 56 transitions. [2022-04-08 10:07:43,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:43,839 INFO L225 Difference]: With dead ends: 374 [2022-04-08 10:07:43,839 INFO L226 Difference]: Without dead ends: 349 [2022-04-08 10:07:43,840 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2022-04-08 10:07:43,840 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 39 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:43,840 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 64 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:07:43,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-04-08 10:07:44,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 344. [2022-04-08 10:07:44,831 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:44,832 INFO L82 GeneralOperation]: Start isEquivalent. First operand 349 states. Second operand has 344 states, 339 states have (on average 1.368731563421829) internal successors, (464), 339 states have internal predecessors, (464), 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-08 10:07:44,832 INFO L74 IsIncluded]: Start isIncluded. First operand 349 states. Second operand has 344 states, 339 states have (on average 1.368731563421829) internal successors, (464), 339 states have internal predecessors, (464), 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-08 10:07:44,832 INFO L87 Difference]: Start difference. First operand 349 states. Second operand has 344 states, 339 states have (on average 1.368731563421829) internal successors, (464), 339 states have internal predecessors, (464), 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-08 10:07:44,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:44,836 INFO L93 Difference]: Finished difference Result 349 states and 473 transitions. [2022-04-08 10:07:44,836 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 473 transitions. [2022-04-08 10:07:44,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:44,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:44,837 INFO L74 IsIncluded]: Start isIncluded. First operand has 344 states, 339 states have (on average 1.368731563421829) internal successors, (464), 339 states have internal predecessors, (464), 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 349 states. [2022-04-08 10:07:44,837 INFO L87 Difference]: Start difference. First operand has 344 states, 339 states have (on average 1.368731563421829) internal successors, (464), 339 states have internal predecessors, (464), 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 349 states. [2022-04-08 10:07:44,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:44,841 INFO L93 Difference]: Finished difference Result 349 states and 473 transitions. [2022-04-08 10:07:44,841 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 473 transitions. [2022-04-08 10:07:44,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:44,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:44,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:44,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:44,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 339 states have (on average 1.368731563421829) internal successors, (464), 339 states have internal predecessors, (464), 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-08 10:07:44,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 468 transitions. [2022-04-08 10:07:44,846 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 468 transitions. Word has length 36 [2022-04-08 10:07:44,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:44,846 INFO L478 AbstractCegarLoop]: Abstraction has 344 states and 468 transitions. [2022-04-08 10:07:44,846 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 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-08 10:07:44,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 344 states and 468 transitions. [2022-04-08 10:07:47,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 468 edges. 468 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:47,689 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 468 transitions. [2022-04-08 10:07:47,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 10:07:47,689 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:47,689 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:47,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2022-04-08 10:07:47,905 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable61 [2022-04-08 10:07:47,905 INFO L403 AbstractCegarLoop]: === Iteration 63 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:47,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:47,906 INFO L85 PathProgramCache]: Analyzing trace with hash 382085168, now seen corresponding path program 25 times [2022-04-08 10:07:47,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:47,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1279360423] [2022-04-08 10:07:47,908 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:47,908 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:47,908 INFO L85 PathProgramCache]: Analyzing trace with hash 382085168, now seen corresponding path program 26 times [2022-04-08 10:07:47,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:47,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522547337] [2022-04-08 10:07:47,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:47,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:48,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:48,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:48,147 INFO L290 TraceCheckUtils]: 0: Hoare triple {89289#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {89270#true} is VALID [2022-04-08 10:07:48,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {89270#true} assume true; {89270#true} is VALID [2022-04-08 10:07:48,147 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {89270#true} {89270#true} #72#return; {89270#true} is VALID [2022-04-08 10:07:48,148 INFO L272 TraceCheckUtils]: 0: Hoare triple {89270#true} call ULTIMATE.init(); {89289#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:48,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {89289#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {89270#true} is VALID [2022-04-08 10:07:48,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {89270#true} assume true; {89270#true} is VALID [2022-04-08 10:07:48,148 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89270#true} {89270#true} #72#return; {89270#true} is VALID [2022-04-08 10:07:48,148 INFO L272 TraceCheckUtils]: 4: Hoare triple {89270#true} call #t~ret13 := main(); {89270#true} is VALID [2022-04-08 10:07:48,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {89270#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {89270#true} is VALID [2022-04-08 10:07:48,149 INFO L290 TraceCheckUtils]: 6: Hoare triple {89270#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89275#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:07:48,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {89275#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89276#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-08 10:07:48,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {89276#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89277#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:07:48,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {89277#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89278#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:07:48,152 INFO L290 TraceCheckUtils]: 10: Hoare triple {89278#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89279#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:07:48,153 INFO L290 TraceCheckUtils]: 11: Hoare triple {89279#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89280#(<= main_~x~0 (+ 4294967289 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:07:48,154 INFO L290 TraceCheckUtils]: 12: Hoare triple {89280#(<= main_~x~0 (+ 4294967289 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89281#(<= (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:07:48,154 INFO L290 TraceCheckUtils]: 13: Hoare triple {89281#(<= (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {89281#(<= (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:07:48,154 INFO L290 TraceCheckUtils]: 14: Hoare triple {89281#(<= (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {89281#(<= (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:07:48,155 INFO L290 TraceCheckUtils]: 15: Hoare triple {89281#(<= (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {89282#(<= (+ (* 4294967296 (div (+ main_~x~0 6) 4294967296)) 1) main_~x~0)} is VALID [2022-04-08 10:07:48,156 INFO L290 TraceCheckUtils]: 16: Hoare triple {89282#(<= (+ (* 4294967296 (div (+ main_~x~0 6) 4294967296)) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {89283#(<= (+ 2 (* (div (+ 5 main_~x~0) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:07:48,156 INFO L290 TraceCheckUtils]: 17: Hoare triple {89283#(<= (+ 2 (* (div (+ 5 main_~x~0) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {89284#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 3) main_~x~0)} is VALID [2022-04-08 10:07:48,157 INFO L290 TraceCheckUtils]: 18: Hoare triple {89284#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 3) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {89285#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4) main_~x~0)} is VALID [2022-04-08 10:07:48,157 INFO L290 TraceCheckUtils]: 19: Hoare triple {89285#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {89286#(<= (+ 5 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:07:48,158 INFO L290 TraceCheckUtils]: 20: Hoare triple {89286#(<= (+ 5 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {89287#(<= (+ 6 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:07:48,159 INFO L290 TraceCheckUtils]: 21: Hoare triple {89287#(<= (+ 6 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {89288#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:07:48,159 INFO L290 TraceCheckUtils]: 22: Hoare triple {89288#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {89288#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:07:48,160 INFO L290 TraceCheckUtils]: 23: Hoare triple {89288#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {89288#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:07:48,160 INFO L290 TraceCheckUtils]: 24: Hoare triple {89288#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {89288#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:07:48,160 INFO L290 TraceCheckUtils]: 25: Hoare triple {89288#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {89288#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:07:48,161 INFO L290 TraceCheckUtils]: 26: Hoare triple {89288#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {89288#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:07:48,161 INFO L290 TraceCheckUtils]: 27: Hoare triple {89288#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {89288#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:07:48,161 INFO L290 TraceCheckUtils]: 28: Hoare triple {89288#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {89288#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:07:48,162 INFO L290 TraceCheckUtils]: 29: Hoare triple {89288#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {89288#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:07:48,162 INFO L290 TraceCheckUtils]: 30: Hoare triple {89288#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {89288#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:07:48,162 INFO L290 TraceCheckUtils]: 31: Hoare triple {89288#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {89271#false} is VALID [2022-04-08 10:07:48,162 INFO L272 TraceCheckUtils]: 32: Hoare triple {89271#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {89271#false} is VALID [2022-04-08 10:07:48,162 INFO L290 TraceCheckUtils]: 33: Hoare triple {89271#false} ~cond := #in~cond; {89271#false} is VALID [2022-04-08 10:07:48,163 INFO L290 TraceCheckUtils]: 34: Hoare triple {89271#false} assume 0 == ~cond; {89271#false} is VALID [2022-04-08 10:07:48,163 INFO L290 TraceCheckUtils]: 35: Hoare triple {89271#false} assume !false; {89271#false} is VALID [2022-04-08 10:07:48,163 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 28 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 10:07:48,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:48,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522547337] [2022-04-08 10:07:48,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522547337] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:48,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175283292] [2022-04-08 10:07:48,163 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:07:48,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:48,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:48,164 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:07:48,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-04-08 10:07:48,204 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:07:48,204 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:48,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-08 10:07:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:48,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:48,789 INFO L272 TraceCheckUtils]: 0: Hoare triple {89270#true} call ULTIMATE.init(); {89270#true} is VALID [2022-04-08 10:07:48,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {89270#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {89270#true} is VALID [2022-04-08 10:07:48,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {89270#true} assume true; {89270#true} is VALID [2022-04-08 10:07:48,790 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89270#true} {89270#true} #72#return; {89270#true} is VALID [2022-04-08 10:07:48,790 INFO L272 TraceCheckUtils]: 4: Hoare triple {89270#true} call #t~ret13 := main(); {89270#true} is VALID [2022-04-08 10:07:48,790 INFO L290 TraceCheckUtils]: 5: Hoare triple {89270#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {89308#(= main_~n~0 main_~x~0)} is VALID [2022-04-08 10:07:48,790 INFO L290 TraceCheckUtils]: 6: Hoare triple {89308#(= main_~n~0 main_~x~0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89312#(= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-08 10:07:48,791 INFO L290 TraceCheckUtils]: 7: Hoare triple {89312#(= (+ main_~x~0 1) main_~n~0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89316#(= main_~n~0 (+ main_~x~0 2))} is VALID [2022-04-08 10:07:48,791 INFO L290 TraceCheckUtils]: 8: Hoare triple {89316#(= main_~n~0 (+ main_~x~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89320#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} is VALID [2022-04-08 10:07:48,791 INFO L290 TraceCheckUtils]: 9: Hoare triple {89320#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89324#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} is VALID [2022-04-08 10:07:48,792 INFO L290 TraceCheckUtils]: 10: Hoare triple {89324#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89328#(= (+ main_~n~0 (- 3)) (+ main_~x~0 2))} is VALID [2022-04-08 10:07:48,792 INFO L290 TraceCheckUtils]: 11: Hoare triple {89328#(= (+ main_~n~0 (- 3)) (+ main_~x~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89332#(= (+ main_~n~0 (- 3)) (+ main_~x~0 3))} is VALID [2022-04-08 10:07:48,793 INFO L290 TraceCheckUtils]: 12: Hoare triple {89332#(= (+ main_~n~0 (- 3)) (+ main_~x~0 3))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89336#(= (+ main_~n~0 (- 3)) (+ main_~x~0 4))} is VALID [2022-04-08 10:07:48,793 INFO L290 TraceCheckUtils]: 13: Hoare triple {89336#(= (+ main_~n~0 (- 3)) (+ main_~x~0 4))} assume !(~x~0 % 4294967296 > 0); {89336#(= (+ main_~n~0 (- 3)) (+ main_~x~0 4))} is VALID [2022-04-08 10:07:48,793 INFO L290 TraceCheckUtils]: 14: Hoare triple {89336#(= (+ main_~n~0 (- 3)) (+ main_~x~0 4))} ~z~0 := ~y~0; {89336#(= (+ main_~n~0 (- 3)) (+ main_~x~0 4))} is VALID [2022-04-08 10:07:48,794 INFO L290 TraceCheckUtils]: 15: Hoare triple {89336#(= (+ main_~n~0 (- 3)) (+ main_~x~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {89332#(= (+ main_~n~0 (- 3)) (+ main_~x~0 3))} is VALID [2022-04-08 10:07:48,794 INFO L290 TraceCheckUtils]: 16: Hoare triple {89332#(= (+ main_~n~0 (- 3)) (+ main_~x~0 3))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {89328#(= (+ main_~n~0 (- 3)) (+ main_~x~0 2))} is VALID [2022-04-08 10:07:48,794 INFO L290 TraceCheckUtils]: 17: Hoare triple {89328#(= (+ main_~n~0 (- 3)) (+ main_~x~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {89324#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} is VALID [2022-04-08 10:07:48,795 INFO L290 TraceCheckUtils]: 18: Hoare triple {89324#(= (+ main_~n~0 (- 3)) (+ main_~x~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {89320#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} is VALID [2022-04-08 10:07:48,795 INFO L290 TraceCheckUtils]: 19: Hoare triple {89320#(= (+ (- 2) main_~n~0) (+ main_~x~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {89316#(= main_~n~0 (+ main_~x~0 2))} is VALID [2022-04-08 10:07:48,796 INFO L290 TraceCheckUtils]: 20: Hoare triple {89316#(= main_~n~0 (+ main_~x~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {89312#(= (+ main_~x~0 1) main_~n~0)} is VALID [2022-04-08 10:07:48,796 INFO L290 TraceCheckUtils]: 21: Hoare triple {89312#(= (+ main_~x~0 1) main_~n~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {89308#(= main_~n~0 main_~x~0)} is VALID [2022-04-08 10:07:48,796 INFO L290 TraceCheckUtils]: 22: Hoare triple {89308#(= main_~n~0 main_~x~0)} assume !(~z~0 % 4294967296 > 0); {89308#(= main_~n~0 main_~x~0)} is VALID [2022-04-08 10:07:48,797 INFO L290 TraceCheckUtils]: 23: Hoare triple {89308#(= main_~n~0 main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {89308#(= main_~n~0 main_~x~0)} is VALID [2022-04-08 10:07:48,797 INFO L290 TraceCheckUtils]: 24: Hoare triple {89308#(= main_~n~0 main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {89308#(= main_~n~0 main_~x~0)} is VALID [2022-04-08 10:07:48,797 INFO L290 TraceCheckUtils]: 25: Hoare triple {89308#(= main_~n~0 main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {89308#(= main_~n~0 main_~x~0)} is VALID [2022-04-08 10:07:48,797 INFO L290 TraceCheckUtils]: 26: Hoare triple {89308#(= main_~n~0 main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {89308#(= main_~n~0 main_~x~0)} is VALID [2022-04-08 10:07:48,797 INFO L290 TraceCheckUtils]: 27: Hoare triple {89308#(= main_~n~0 main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {89308#(= main_~n~0 main_~x~0)} is VALID [2022-04-08 10:07:48,798 INFO L290 TraceCheckUtils]: 28: Hoare triple {89308#(= main_~n~0 main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {89308#(= main_~n~0 main_~x~0)} is VALID [2022-04-08 10:07:48,798 INFO L290 TraceCheckUtils]: 29: Hoare triple {89308#(= main_~n~0 main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {89308#(= main_~n~0 main_~x~0)} is VALID [2022-04-08 10:07:48,798 INFO L290 TraceCheckUtils]: 30: Hoare triple {89308#(= main_~n~0 main_~x~0)} assume !(~y~0 % 4294967296 > 0); {89391#(and (= main_~n~0 main_~x~0) (not (< 0 (mod main_~y~0 4294967296))))} is VALID [2022-04-08 10:07:48,798 INFO L290 TraceCheckUtils]: 31: Hoare triple {89391#(and (= main_~n~0 main_~x~0) (not (< 0 (mod main_~y~0 4294967296))))} assume !(~x~0 % 4294967296 > 0); {89395#(and (not (< 0 (mod main_~y~0 4294967296))) (not (< 0 (mod main_~n~0 4294967296))))} is VALID [2022-04-08 10:07:48,799 INFO L272 TraceCheckUtils]: 32: Hoare triple {89395#(and (not (< 0 (mod main_~y~0 4294967296))) (not (< 0 (mod main_~n~0 4294967296))))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {89399#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:07:48,799 INFO L290 TraceCheckUtils]: 33: Hoare triple {89399#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {89403#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:07:48,799 INFO L290 TraceCheckUtils]: 34: Hoare triple {89403#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {89271#false} is VALID [2022-04-08 10:07:48,799 INFO L290 TraceCheckUtils]: 35: Hoare triple {89271#false} assume !false; {89271#false} is VALID [2022-04-08 10:07:48,799 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 10:07:48,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:49,406 INFO L290 TraceCheckUtils]: 35: Hoare triple {89271#false} assume !false; {89271#false} is VALID [2022-04-08 10:07:49,406 INFO L290 TraceCheckUtils]: 34: Hoare triple {89403#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {89271#false} is VALID [2022-04-08 10:07:49,407 INFO L290 TraceCheckUtils]: 33: Hoare triple {89399#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {89403#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:07:49,407 INFO L272 TraceCheckUtils]: 32: Hoare triple {89419#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {89399#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:07:49,407 INFO L290 TraceCheckUtils]: 31: Hoare triple {89423#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {89419#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:49,408 INFO L290 TraceCheckUtils]: 30: Hoare triple {89427#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {89423#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:07:49,408 INFO L290 TraceCheckUtils]: 29: Hoare triple {89427#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {89427#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:49,408 INFO L290 TraceCheckUtils]: 28: Hoare triple {89427#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {89427#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:49,409 INFO L290 TraceCheckUtils]: 27: Hoare triple {89427#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {89427#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:49,409 INFO L290 TraceCheckUtils]: 26: Hoare triple {89427#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {89427#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:49,409 INFO L290 TraceCheckUtils]: 25: Hoare triple {89427#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {89427#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:49,409 INFO L290 TraceCheckUtils]: 24: Hoare triple {89427#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {89427#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:49,410 INFO L290 TraceCheckUtils]: 23: Hoare triple {89427#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {89427#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:49,410 INFO L290 TraceCheckUtils]: 22: Hoare triple {89427#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {89427#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:49,411 INFO L290 TraceCheckUtils]: 21: Hoare triple {89455#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {89427#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:49,411 INFO L290 TraceCheckUtils]: 20: Hoare triple {89459#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod (+ main_~x~0 2) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {89455#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-08 10:07:49,412 INFO L290 TraceCheckUtils]: 19: Hoare triple {89463#(or (< 0 (mod (+ main_~x~0 3) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {89459#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod (+ main_~x~0 2) 4294967296)))} is VALID [2022-04-08 10:07:49,413 INFO L290 TraceCheckUtils]: 18: Hoare triple {89467#(or (< 0 (mod (+ main_~x~0 4) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {89463#(or (< 0 (mod (+ main_~x~0 3) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-08 10:07:49,413 INFO L290 TraceCheckUtils]: 17: Hoare triple {89471#(or (< 0 (mod (+ 5 main_~x~0) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {89467#(or (< 0 (mod (+ main_~x~0 4) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-08 10:07:49,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {89475#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod (+ main_~x~0 6) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {89471#(or (< 0 (mod (+ 5 main_~x~0) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-08 10:07:49,415 INFO L290 TraceCheckUtils]: 15: Hoare triple {89479#(or (< 0 (mod (+ 7 main_~x~0) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {89475#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-08 10:07:49,415 INFO L290 TraceCheckUtils]: 14: Hoare triple {89479#(or (< 0 (mod (+ 7 main_~x~0) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} ~z~0 := ~y~0; {89479#(or (< 0 (mod (+ 7 main_~x~0) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-08 10:07:49,415 INFO L290 TraceCheckUtils]: 13: Hoare triple {89479#(or (< 0 (mod (+ 7 main_~x~0) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {89479#(or (< 0 (mod (+ 7 main_~x~0) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-08 10:07:49,416 INFO L290 TraceCheckUtils]: 12: Hoare triple {89475#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod (+ main_~x~0 6) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89479#(or (< 0 (mod (+ 7 main_~x~0) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-08 10:07:49,417 INFO L290 TraceCheckUtils]: 11: Hoare triple {89471#(or (< 0 (mod (+ 5 main_~x~0) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89475#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-08 10:07:49,418 INFO L290 TraceCheckUtils]: 10: Hoare triple {89467#(or (< 0 (mod (+ main_~x~0 4) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89471#(or (< 0 (mod (+ 5 main_~x~0) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-08 10:07:49,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {89463#(or (< 0 (mod (+ main_~x~0 3) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89467#(or (< 0 (mod (+ main_~x~0 4) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-08 10:07:49,419 INFO L290 TraceCheckUtils]: 8: Hoare triple {89459#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod (+ main_~x~0 2) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89463#(or (< 0 (mod (+ main_~x~0 3) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-08 10:07:49,420 INFO L290 TraceCheckUtils]: 7: Hoare triple {89455#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89459#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod (+ main_~x~0 2) 4294967296)))} is VALID [2022-04-08 10:07:49,421 INFO L290 TraceCheckUtils]: 6: Hoare triple {89427#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {89455#(or (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (mod main_~n~0 4294967296) 0))} is VALID [2022-04-08 10:07:49,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {89270#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {89427#(or (<= (mod main_~n~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-08 10:07:49,421 INFO L272 TraceCheckUtils]: 4: Hoare triple {89270#true} call #t~ret13 := main(); {89270#true} is VALID [2022-04-08 10:07:49,421 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89270#true} {89270#true} #72#return; {89270#true} is VALID [2022-04-08 10:07:49,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {89270#true} assume true; {89270#true} is VALID [2022-04-08 10:07:49,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {89270#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {89270#true} is VALID [2022-04-08 10:07:49,421 INFO L272 TraceCheckUtils]: 0: Hoare triple {89270#true} call ULTIMATE.init(); {89270#true} is VALID [2022-04-08 10:07:49,422 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 10:07:49,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175283292] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:49,422 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:49,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 39 [2022-04-08 10:07:49,422 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:49,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1279360423] [2022-04-08 10:07:49,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1279360423] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:49,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:49,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 10:07:49,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088433272] [2022-04-08 10:07:49,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:49,422 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 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 36 [2022-04-08 10:07:49,422 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:49,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 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-08 10:07:49,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:49,441 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 10:07:49,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:49,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 10:07:49,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1280, Unknown=0, NotChecked=0, Total=1482 [2022-04-08 10:07:49,441 INFO L87 Difference]: Start difference. First operand 344 states and 468 transitions. Second operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 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-08 10:07:52,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:52,383 INFO L93 Difference]: Finished difference Result 400 states and 553 transitions. [2022-04-08 10:07:52,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 10:07:52,383 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 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 36 [2022-04-08 10:07:52,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:07:52,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 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-08 10:07:52,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 91 transitions. [2022-04-08 10:07:52,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 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-08 10:07:52,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 91 transitions. [2022-04-08 10:07:52,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 91 transitions. [2022-04-08 10:07:52,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:52,456 INFO L225 Difference]: With dead ends: 400 [2022-04-08 10:07:52,456 INFO L226 Difference]: Without dead ends: 395 [2022-04-08 10:07:52,456 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=405, Invalid=2351, Unknown=0, NotChecked=0, Total=2756 [2022-04-08 10:07:52,456 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 106 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:07:52,457 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 53 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 10:07:52,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-04-08 10:07:53,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 382. [2022-04-08 10:07:53,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:07:53,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 395 states. Second operand has 382 states, 377 states have (on average 1.3740053050397878) internal successors, (518), 377 states have internal predecessors, (518), 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-08 10:07:53,842 INFO L74 IsIncluded]: Start isIncluded. First operand 395 states. Second operand has 382 states, 377 states have (on average 1.3740053050397878) internal successors, (518), 377 states have internal predecessors, (518), 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-08 10:07:53,842 INFO L87 Difference]: Start difference. First operand 395 states. Second operand has 382 states, 377 states have (on average 1.3740053050397878) internal successors, (518), 377 states have internal predecessors, (518), 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-08 10:07:53,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:53,848 INFO L93 Difference]: Finished difference Result 395 states and 542 transitions. [2022-04-08 10:07:53,848 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 542 transitions. [2022-04-08 10:07:53,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:53,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:53,848 INFO L74 IsIncluded]: Start isIncluded. First operand has 382 states, 377 states have (on average 1.3740053050397878) internal successors, (518), 377 states have internal predecessors, (518), 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 395 states. [2022-04-08 10:07:53,848 INFO L87 Difference]: Start difference. First operand has 382 states, 377 states have (on average 1.3740053050397878) internal successors, (518), 377 states have internal predecessors, (518), 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 395 states. [2022-04-08 10:07:53,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:07:53,853 INFO L93 Difference]: Finished difference Result 395 states and 542 transitions. [2022-04-08 10:07:53,853 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 542 transitions. [2022-04-08 10:07:53,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:07:53,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:07:53,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:07:53,854 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:07:53,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 377 states have (on average 1.3740053050397878) internal successors, (518), 377 states have internal predecessors, (518), 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-08 10:07:53,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 522 transitions. [2022-04-08 10:07:53,860 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 522 transitions. Word has length 36 [2022-04-08 10:07:53,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:07:53,860 INFO L478 AbstractCegarLoop]: Abstraction has 382 states and 522 transitions. [2022-04-08 10:07:53,860 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 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-08 10:07:53,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 382 states and 522 transitions. [2022-04-08 10:07:56,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 522 edges. 522 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:56,230 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 522 transitions. [2022-04-08 10:07:56,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 10:07:56,231 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:07:56,231 INFO L499 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:07:56,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2022-04-08 10:07:56,438 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:56,438 INFO L403 AbstractCegarLoop]: === Iteration 64 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:07:56,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:07:56,438 INFO L85 PathProgramCache]: Analyzing trace with hash 500352545, now seen corresponding path program 41 times [2022-04-08 10:07:56,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:56,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2026747533] [2022-04-08 10:07:56,440 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:07:56,440 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:07:56,441 INFO L85 PathProgramCache]: Analyzing trace with hash 500352545, now seen corresponding path program 42 times [2022-04-08 10:07:56,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:07:56,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470944638] [2022-04-08 10:07:56,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:07:56,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:07:56,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:56,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:07:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:56,826 INFO L290 TraceCheckUtils]: 0: Hoare triple {91937#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {91909#true} is VALID [2022-04-08 10:07:56,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {91909#true} assume true; {91909#true} is VALID [2022-04-08 10:07:56,826 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {91909#true} {91909#true} #72#return; {91909#true} is VALID [2022-04-08 10:07:56,844 INFO L272 TraceCheckUtils]: 0: Hoare triple {91909#true} call ULTIMATE.init(); {91937#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:07:56,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {91937#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {91909#true} is VALID [2022-04-08 10:07:56,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {91909#true} assume true; {91909#true} is VALID [2022-04-08 10:07:56,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {91909#true} {91909#true} #72#return; {91909#true} is VALID [2022-04-08 10:07:56,844 INFO L272 TraceCheckUtils]: 4: Hoare triple {91909#true} call #t~ret13 := main(); {91909#true} is VALID [2022-04-08 10:07:56,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {91909#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {91914#(= main_~y~0 0)} is VALID [2022-04-08 10:07:56,845 INFO L290 TraceCheckUtils]: 6: Hoare triple {91914#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91915#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:56,845 INFO L290 TraceCheckUtils]: 7: Hoare triple {91915#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91916#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:56,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {91916#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91917#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:56,846 INFO L290 TraceCheckUtils]: 9: Hoare triple {91917#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91918#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:56,847 INFO L290 TraceCheckUtils]: 10: Hoare triple {91918#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91919#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:56,847 INFO L290 TraceCheckUtils]: 11: Hoare triple {91919#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91920#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:56,848 INFO L290 TraceCheckUtils]: 12: Hoare triple {91920#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91921#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:56,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {91921#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91922#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:56,849 INFO L290 TraceCheckUtils]: 14: Hoare triple {91922#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91923#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:56,849 INFO L290 TraceCheckUtils]: 15: Hoare triple {91923#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91924#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:56,850 INFO L290 TraceCheckUtils]: 16: Hoare triple {91924#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91925#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:56,850 INFO L290 TraceCheckUtils]: 17: Hoare triple {91925#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91926#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:07:56,851 INFO L290 TraceCheckUtils]: 18: Hoare triple {91926#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91927#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:07:56,851 INFO L290 TraceCheckUtils]: 19: Hoare triple {91927#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91928#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:07:56,852 INFO L290 TraceCheckUtils]: 20: Hoare triple {91928#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91929#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:07:56,852 INFO L290 TraceCheckUtils]: 21: Hoare triple {91929#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91930#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:07:56,853 INFO L290 TraceCheckUtils]: 22: Hoare triple {91930#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91931#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:07:56,853 INFO L290 TraceCheckUtils]: 23: Hoare triple {91931#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91932#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:07:56,854 INFO L290 TraceCheckUtils]: 24: Hoare triple {91932#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91933#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:07:56,854 INFO L290 TraceCheckUtils]: 25: Hoare triple {91933#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91934#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:07:56,855 INFO L290 TraceCheckUtils]: 26: Hoare triple {91934#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91935#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:07:56,855 INFO L290 TraceCheckUtils]: 27: Hoare triple {91935#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {91935#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:07:56,856 INFO L290 TraceCheckUtils]: 28: Hoare triple {91935#(and (<= main_~y~0 21) (<= 21 main_~y~0))} ~z~0 := ~y~0; {91936#(and (<= (div main_~z~0 4294967296) 0) (<= 21 main_~z~0))} is VALID [2022-04-08 10:07:56,856 INFO L290 TraceCheckUtils]: 29: Hoare triple {91936#(and (<= (div main_~z~0 4294967296) 0) (<= 21 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {91910#false} is VALID [2022-04-08 10:07:56,856 INFO L290 TraceCheckUtils]: 30: Hoare triple {91910#false} assume !(~y~0 % 4294967296 > 0); {91910#false} is VALID [2022-04-08 10:07:56,856 INFO L290 TraceCheckUtils]: 31: Hoare triple {91910#false} assume !(~x~0 % 4294967296 > 0); {91910#false} is VALID [2022-04-08 10:07:56,856 INFO L272 TraceCheckUtils]: 32: Hoare triple {91910#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {91910#false} is VALID [2022-04-08 10:07:56,856 INFO L290 TraceCheckUtils]: 33: Hoare triple {91910#false} ~cond := #in~cond; {91910#false} is VALID [2022-04-08 10:07:56,856 INFO L290 TraceCheckUtils]: 34: Hoare triple {91910#false} assume 0 == ~cond; {91910#false} is VALID [2022-04-08 10:07:56,856 INFO L290 TraceCheckUtils]: 35: Hoare triple {91910#false} assume !false; {91910#false} is VALID [2022-04-08 10:07:56,856 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:56,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:07:56,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470944638] [2022-04-08 10:07:56,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470944638] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:07:56,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011716350] [2022-04-08 10:07:56,857 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:07:56,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:07:56,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:07:56,867 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:07:56,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-04-08 10:07:57,213 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2022-04-08 10:07:57,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:07:57,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-08 10:07:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:07:57,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:07:57,546 INFO L272 TraceCheckUtils]: 0: Hoare triple {91909#true} call ULTIMATE.init(); {91909#true} is VALID [2022-04-08 10:07:57,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {91909#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {91909#true} is VALID [2022-04-08 10:07:57,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {91909#true} assume true; {91909#true} is VALID [2022-04-08 10:07:57,546 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {91909#true} {91909#true} #72#return; {91909#true} is VALID [2022-04-08 10:07:57,546 INFO L272 TraceCheckUtils]: 4: Hoare triple {91909#true} call #t~ret13 := main(); {91909#true} is VALID [2022-04-08 10:07:57,547 INFO L290 TraceCheckUtils]: 5: Hoare triple {91909#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {91914#(= main_~y~0 0)} is VALID [2022-04-08 10:07:57,547 INFO L290 TraceCheckUtils]: 6: Hoare triple {91914#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91915#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:07:57,548 INFO L290 TraceCheckUtils]: 7: Hoare triple {91915#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91916#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:07:57,548 INFO L290 TraceCheckUtils]: 8: Hoare triple {91916#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91917#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:07:57,549 INFO L290 TraceCheckUtils]: 9: Hoare triple {91917#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91918#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:07:57,549 INFO L290 TraceCheckUtils]: 10: Hoare triple {91918#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91919#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:07:57,550 INFO L290 TraceCheckUtils]: 11: Hoare triple {91919#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91920#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:07:57,550 INFO L290 TraceCheckUtils]: 12: Hoare triple {91920#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91921#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:07:57,551 INFO L290 TraceCheckUtils]: 13: Hoare triple {91921#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91922#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:07:57,551 INFO L290 TraceCheckUtils]: 14: Hoare triple {91922#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91923#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:07:57,552 INFO L290 TraceCheckUtils]: 15: Hoare triple {91923#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91924#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:07:57,552 INFO L290 TraceCheckUtils]: 16: Hoare triple {91924#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91925#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:07:57,553 INFO L290 TraceCheckUtils]: 17: Hoare triple {91925#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91926#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:07:57,553 INFO L290 TraceCheckUtils]: 18: Hoare triple {91926#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91927#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:07:57,554 INFO L290 TraceCheckUtils]: 19: Hoare triple {91927#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91928#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:07:57,554 INFO L290 TraceCheckUtils]: 20: Hoare triple {91928#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91929#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:07:57,555 INFO L290 TraceCheckUtils]: 21: Hoare triple {91929#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91930#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:07:57,555 INFO L290 TraceCheckUtils]: 22: Hoare triple {91930#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91931#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:07:57,556 INFO L290 TraceCheckUtils]: 23: Hoare triple {91931#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91932#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:07:57,556 INFO L290 TraceCheckUtils]: 24: Hoare triple {91932#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91933#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:07:57,557 INFO L290 TraceCheckUtils]: 25: Hoare triple {91933#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91934#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:07:57,557 INFO L290 TraceCheckUtils]: 26: Hoare triple {91934#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91935#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:07:57,557 INFO L290 TraceCheckUtils]: 27: Hoare triple {91935#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {91935#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:07:57,558 INFO L290 TraceCheckUtils]: 28: Hoare triple {91935#(and (<= main_~y~0 21) (<= 21 main_~y~0))} ~z~0 := ~y~0; {92025#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-08 10:07:57,558 INFO L290 TraceCheckUtils]: 29: Hoare triple {92025#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {91910#false} is VALID [2022-04-08 10:07:57,558 INFO L290 TraceCheckUtils]: 30: Hoare triple {91910#false} assume !(~y~0 % 4294967296 > 0); {91910#false} is VALID [2022-04-08 10:07:57,558 INFO L290 TraceCheckUtils]: 31: Hoare triple {91910#false} assume !(~x~0 % 4294967296 > 0); {91910#false} is VALID [2022-04-08 10:07:57,558 INFO L272 TraceCheckUtils]: 32: Hoare triple {91910#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {91910#false} is VALID [2022-04-08 10:07:57,558 INFO L290 TraceCheckUtils]: 33: Hoare triple {91910#false} ~cond := #in~cond; {91910#false} is VALID [2022-04-08 10:07:57,558 INFO L290 TraceCheckUtils]: 34: Hoare triple {91910#false} assume 0 == ~cond; {91910#false} is VALID [2022-04-08 10:07:57,558 INFO L290 TraceCheckUtils]: 35: Hoare triple {91910#false} assume !false; {91910#false} is VALID [2022-04-08 10:07:57,559 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:57,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:07:58,389 INFO L290 TraceCheckUtils]: 35: Hoare triple {91910#false} assume !false; {91910#false} is VALID [2022-04-08 10:07:58,389 INFO L290 TraceCheckUtils]: 34: Hoare triple {91910#false} assume 0 == ~cond; {91910#false} is VALID [2022-04-08 10:07:58,389 INFO L290 TraceCheckUtils]: 33: Hoare triple {91910#false} ~cond := #in~cond; {91910#false} is VALID [2022-04-08 10:07:58,389 INFO L272 TraceCheckUtils]: 32: Hoare triple {91910#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {91910#false} is VALID [2022-04-08 10:07:58,390 INFO L290 TraceCheckUtils]: 31: Hoare triple {91910#false} assume !(~x~0 % 4294967296 > 0); {91910#false} is VALID [2022-04-08 10:07:58,390 INFO L290 TraceCheckUtils]: 30: Hoare triple {91910#false} assume !(~y~0 % 4294967296 > 0); {91910#false} is VALID [2022-04-08 10:07:58,390 INFO L290 TraceCheckUtils]: 29: Hoare triple {92065#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {91910#false} is VALID [2022-04-08 10:07:58,390 INFO L290 TraceCheckUtils]: 28: Hoare triple {92069#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {92065#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:07:58,390 INFO L290 TraceCheckUtils]: 27: Hoare triple {92069#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {92069#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:58,391 INFO L290 TraceCheckUtils]: 26: Hoare triple {92076#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92069#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:07:58,392 INFO L290 TraceCheckUtils]: 25: Hoare triple {92080#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92076#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:07:58,392 INFO L290 TraceCheckUtils]: 24: Hoare triple {92084#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92080#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:07:58,393 INFO L290 TraceCheckUtils]: 23: Hoare triple {92088#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92084#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:07:58,393 INFO L290 TraceCheckUtils]: 22: Hoare triple {92092#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92088#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:07:58,394 INFO L290 TraceCheckUtils]: 21: Hoare triple {92096#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92092#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:58,395 INFO L290 TraceCheckUtils]: 20: Hoare triple {92100#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92096#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:07:58,395 INFO L290 TraceCheckUtils]: 19: Hoare triple {92104#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92100#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:58,396 INFO L290 TraceCheckUtils]: 18: Hoare triple {92108#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92104#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:07:58,396 INFO L290 TraceCheckUtils]: 17: Hoare triple {92112#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92108#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:07:58,397 INFO L290 TraceCheckUtils]: 16: Hoare triple {92116#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92112#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:07:58,398 INFO L290 TraceCheckUtils]: 15: Hoare triple {92120#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92116#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:07:58,398 INFO L290 TraceCheckUtils]: 14: Hoare triple {92124#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92120#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:07:58,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {92128#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92124#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:07:58,399 INFO L290 TraceCheckUtils]: 12: Hoare triple {92132#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92128#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:07:58,400 INFO L290 TraceCheckUtils]: 11: Hoare triple {92136#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92132#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:07:58,401 INFO L290 TraceCheckUtils]: 10: Hoare triple {92140#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92136#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:07:58,401 INFO L290 TraceCheckUtils]: 9: Hoare triple {92144#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92140#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:07:58,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {92148#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92144#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-08 10:07:58,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {92152#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92148#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-08 10:07:58,403 INFO L290 TraceCheckUtils]: 6: Hoare triple {92156#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {92152#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-08 10:07:58,403 INFO L290 TraceCheckUtils]: 5: Hoare triple {91909#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {92156#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-08 10:07:58,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {91909#true} call #t~ret13 := main(); {91909#true} is VALID [2022-04-08 10:07:58,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {91909#true} {91909#true} #72#return; {91909#true} is VALID [2022-04-08 10:07:58,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {91909#true} assume true; {91909#true} is VALID [2022-04-08 10:07:58,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {91909#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {91909#true} is VALID [2022-04-08 10:07:58,404 INFO L272 TraceCheckUtils]: 0: Hoare triple {91909#true} call ULTIMATE.init(); {91909#true} is VALID [2022-04-08 10:07:58,404 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:07:58,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011716350] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:07:58,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:07:58,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-08 10:07:58,404 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:07:58,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2026747533] [2022-04-08 10:07:58,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2026747533] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:07:58,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:07:58,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-08 10:07:58,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908271851] [2022-04-08 10:07:58,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:07:58,405 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 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 36 [2022-04-08 10:07:58,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:07:58,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 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-08 10:07:58,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:07:58,426 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-08 10:07:58,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:07:58,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-08 10:07:58,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=583, Invalid=1867, Unknown=0, NotChecked=0, Total=2450 [2022-04-08 10:07:58,426 INFO L87 Difference]: Start difference. First operand 382 states and 522 transitions. Second operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 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-08 10:08:06,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:06,026 INFO L93 Difference]: Finished difference Result 674 states and 1031 transitions. [2022-04-08 10:08:06,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-08 10:08:06,026 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 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 36 [2022-04-08 10:08:06,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:08:06,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 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-08 10:08:06,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 225 transitions. [2022-04-08 10:08:06,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 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-08 10:08:06,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 225 transitions. [2022-04-08 10:08:06,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 225 transitions. [2022-04-08 10:08:06,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:06,165 INFO L225 Difference]: With dead ends: 674 [2022-04-08 10:08:06,165 INFO L226 Difference]: Without dead ends: 646 [2022-04-08 10:08:06,166 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1183, Invalid=4073, Unknown=0, NotChecked=0, Total=5256 [2022-04-08 10:08:06,166 INFO L913 BasicCegarLoop]: 100 mSDtfsCounter, 169 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 4027 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 4149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 4027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:08:06,166 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 217 Invalid, 4149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 4027 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-08 10:08:06,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2022-04-08 10:08:07,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 401. [2022-04-08 10:08:07,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:08:07,367 INFO L82 GeneralOperation]: Start isEquivalent. First operand 646 states. Second operand has 401 states, 396 states have (on average 1.378787878787879) internal successors, (546), 396 states have internal predecessors, (546), 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-08 10:08:07,367 INFO L74 IsIncluded]: Start isIncluded. First operand 646 states. Second operand has 401 states, 396 states have (on average 1.378787878787879) internal successors, (546), 396 states have internal predecessors, (546), 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-08 10:08:07,367 INFO L87 Difference]: Start difference. First operand 646 states. Second operand has 401 states, 396 states have (on average 1.378787878787879) internal successors, (546), 396 states have internal predecessors, (546), 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-08 10:08:07,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:07,378 INFO L93 Difference]: Finished difference Result 646 states and 817 transitions. [2022-04-08 10:08:07,378 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 817 transitions. [2022-04-08 10:08:07,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:07,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:07,379 INFO L74 IsIncluded]: Start isIncluded. First operand has 401 states, 396 states have (on average 1.378787878787879) internal successors, (546), 396 states have internal predecessors, (546), 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 646 states. [2022-04-08 10:08:07,379 INFO L87 Difference]: Start difference. First operand has 401 states, 396 states have (on average 1.378787878787879) internal successors, (546), 396 states have internal predecessors, (546), 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 646 states. [2022-04-08 10:08:07,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:07,390 INFO L93 Difference]: Finished difference Result 646 states and 817 transitions. [2022-04-08 10:08:07,390 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 817 transitions. [2022-04-08 10:08:07,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:07,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:07,390 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:08:07,390 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:08:07,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 396 states have (on average 1.378787878787879) internal successors, (546), 396 states have internal predecessors, (546), 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-08 10:08:07,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 550 transitions. [2022-04-08 10:08:07,397 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 550 transitions. Word has length 36 [2022-04-08 10:08:07,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:08:07,397 INFO L478 AbstractCegarLoop]: Abstraction has 401 states and 550 transitions. [2022-04-08 10:08:07,397 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 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-08 10:08:07,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 401 states and 550 transitions. [2022-04-08 10:08:12,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 550 edges. 550 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:12,090 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 550 transitions. [2022-04-08 10:08:12,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 10:08:12,091 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:08:12,091 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:08:12,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Forceful destruction successful, exit code 0 [2022-04-08 10:08:12,291 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:12,292 INFO L403 AbstractCegarLoop]: === Iteration 65 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:08:12,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:08:12,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1873101146, now seen corresponding path program 55 times [2022-04-08 10:08:12,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:12,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1328323024] [2022-04-08 10:08:12,294 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:08:12,294 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:08:12,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1873101146, now seen corresponding path program 56 times [2022-04-08 10:08:12,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:08:12,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531442644] [2022-04-08 10:08:12,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:08:12,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:08:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:12,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:08:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:12,490 INFO L290 TraceCheckUtils]: 0: Hoare triple {95683#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {95665#true} is VALID [2022-04-08 10:08:12,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {95665#true} assume true; {95665#true} is VALID [2022-04-08 10:08:12,490 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {95665#true} {95665#true} #72#return; {95665#true} is VALID [2022-04-08 10:08:12,491 INFO L272 TraceCheckUtils]: 0: Hoare triple {95665#true} call ULTIMATE.init(); {95683#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:08:12,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {95683#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {95665#true} is VALID [2022-04-08 10:08:12,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {95665#true} assume true; {95665#true} is VALID [2022-04-08 10:08:12,491 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95665#true} {95665#true} #72#return; {95665#true} is VALID [2022-04-08 10:08:12,491 INFO L272 TraceCheckUtils]: 4: Hoare triple {95665#true} call #t~ret13 := main(); {95665#true} is VALID [2022-04-08 10:08:12,491 INFO L290 TraceCheckUtils]: 5: Hoare triple {95665#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {95670#(= main_~y~0 0)} is VALID [2022-04-08 10:08:12,492 INFO L290 TraceCheckUtils]: 6: Hoare triple {95670#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95671#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:12,492 INFO L290 TraceCheckUtils]: 7: Hoare triple {95671#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95672#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:12,493 INFO L290 TraceCheckUtils]: 8: Hoare triple {95672#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95673#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:12,493 INFO L290 TraceCheckUtils]: 9: Hoare triple {95673#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95674#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:12,494 INFO L290 TraceCheckUtils]: 10: Hoare triple {95674#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95675#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:12,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {95675#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95676#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:12,495 INFO L290 TraceCheckUtils]: 12: Hoare triple {95676#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95677#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:12,495 INFO L290 TraceCheckUtils]: 13: Hoare triple {95677#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {95677#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:12,495 INFO L290 TraceCheckUtils]: 14: Hoare triple {95677#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {95678#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:08:12,496 INFO L290 TraceCheckUtils]: 15: Hoare triple {95678#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95679#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:08:12,496 INFO L290 TraceCheckUtils]: 16: Hoare triple {95679#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95680#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:08:12,497 INFO L290 TraceCheckUtils]: 17: Hoare triple {95680#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95681#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:08:12,497 INFO L290 TraceCheckUtils]: 18: Hoare triple {95681#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95682#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:08:12,498 INFO L290 TraceCheckUtils]: 19: Hoare triple {95682#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {95666#false} is VALID [2022-04-08 10:08:12,498 INFO L290 TraceCheckUtils]: 20: Hoare triple {95666#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95666#false} is VALID [2022-04-08 10:08:12,498 INFO L290 TraceCheckUtils]: 21: Hoare triple {95666#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95666#false} is VALID [2022-04-08 10:08:12,498 INFO L290 TraceCheckUtils]: 22: Hoare triple {95666#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95666#false} is VALID [2022-04-08 10:08:12,498 INFO L290 TraceCheckUtils]: 23: Hoare triple {95666#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95666#false} is VALID [2022-04-08 10:08:12,498 INFO L290 TraceCheckUtils]: 24: Hoare triple {95666#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95666#false} is VALID [2022-04-08 10:08:12,498 INFO L290 TraceCheckUtils]: 25: Hoare triple {95666#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95666#false} is VALID [2022-04-08 10:08:12,498 INFO L290 TraceCheckUtils]: 26: Hoare triple {95666#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95666#false} is VALID [2022-04-08 10:08:12,498 INFO L290 TraceCheckUtils]: 27: Hoare triple {95666#false} assume !(~y~0 % 4294967296 > 0); {95666#false} is VALID [2022-04-08 10:08:12,498 INFO L290 TraceCheckUtils]: 28: Hoare triple {95666#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95666#false} is VALID [2022-04-08 10:08:12,498 INFO L290 TraceCheckUtils]: 29: Hoare triple {95666#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95666#false} is VALID [2022-04-08 10:08:12,498 INFO L290 TraceCheckUtils]: 30: Hoare triple {95666#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95666#false} is VALID [2022-04-08 10:08:12,498 INFO L290 TraceCheckUtils]: 31: Hoare triple {95666#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95666#false} is VALID [2022-04-08 10:08:12,498 INFO L290 TraceCheckUtils]: 32: Hoare triple {95666#false} assume !(~x~0 % 4294967296 > 0); {95666#false} is VALID [2022-04-08 10:08:12,498 INFO L272 TraceCheckUtils]: 33: Hoare triple {95666#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {95666#false} is VALID [2022-04-08 10:08:12,499 INFO L290 TraceCheckUtils]: 34: Hoare triple {95666#false} ~cond := #in~cond; {95666#false} is VALID [2022-04-08 10:08:12,499 INFO L290 TraceCheckUtils]: 35: Hoare triple {95666#false} assume 0 == ~cond; {95666#false} is VALID [2022-04-08 10:08:12,499 INFO L290 TraceCheckUtils]: 36: Hoare triple {95666#false} assume !false; {95666#false} is VALID [2022-04-08 10:08:12,499 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-08 10:08:12,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:08:12,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531442644] [2022-04-08 10:08:12,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531442644] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:08:12,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576872244] [2022-04-08 10:08:12,499 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:08:12,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:12,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:08:12,500 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:08:12,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2022-04-08 10:08:12,544 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:08:12,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:08:12,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-08 10:08:12,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:12,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:08:12,796 INFO L272 TraceCheckUtils]: 0: Hoare triple {95665#true} call ULTIMATE.init(); {95665#true} is VALID [2022-04-08 10:08:12,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {95665#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {95665#true} is VALID [2022-04-08 10:08:12,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {95665#true} assume true; {95665#true} is VALID [2022-04-08 10:08:12,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95665#true} {95665#true} #72#return; {95665#true} is VALID [2022-04-08 10:08:12,797 INFO L272 TraceCheckUtils]: 4: Hoare triple {95665#true} call #t~ret13 := main(); {95665#true} is VALID [2022-04-08 10:08:12,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {95665#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {95670#(= main_~y~0 0)} is VALID [2022-04-08 10:08:12,797 INFO L290 TraceCheckUtils]: 6: Hoare triple {95670#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95671#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:12,798 INFO L290 TraceCheckUtils]: 7: Hoare triple {95671#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95672#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:12,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {95672#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95673#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:12,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {95673#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95674#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:12,799 INFO L290 TraceCheckUtils]: 10: Hoare triple {95674#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95675#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:12,800 INFO L290 TraceCheckUtils]: 11: Hoare triple {95675#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95676#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:12,800 INFO L290 TraceCheckUtils]: 12: Hoare triple {95676#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95677#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:12,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {95677#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {95677#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:12,801 INFO L290 TraceCheckUtils]: 14: Hoare triple {95677#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {95729#(and (= main_~z~0 main_~y~0) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:12,801 INFO L290 TraceCheckUtils]: 15: Hoare triple {95729#(and (= main_~z~0 main_~y~0) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95733#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:08:12,802 INFO L290 TraceCheckUtils]: 16: Hoare triple {95733#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95737#(and (= main_~y~0 (+ main_~z~0 2)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:12,802 INFO L290 TraceCheckUtils]: 17: Hoare triple {95737#(and (= main_~y~0 (+ main_~z~0 2)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95741#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-08 10:08:12,803 INFO L290 TraceCheckUtils]: 18: Hoare triple {95741#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95745#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:12,804 INFO L290 TraceCheckUtils]: 19: Hoare triple {95745#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~z~0 % 4294967296 > 0); {95666#false} is VALID [2022-04-08 10:08:12,804 INFO L290 TraceCheckUtils]: 20: Hoare triple {95666#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95666#false} is VALID [2022-04-08 10:08:12,804 INFO L290 TraceCheckUtils]: 21: Hoare triple {95666#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95666#false} is VALID [2022-04-08 10:08:12,804 INFO L290 TraceCheckUtils]: 22: Hoare triple {95666#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95666#false} is VALID [2022-04-08 10:08:12,804 INFO L290 TraceCheckUtils]: 23: Hoare triple {95666#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95666#false} is VALID [2022-04-08 10:08:12,804 INFO L290 TraceCheckUtils]: 24: Hoare triple {95666#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95666#false} is VALID [2022-04-08 10:08:12,804 INFO L290 TraceCheckUtils]: 25: Hoare triple {95666#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95666#false} is VALID [2022-04-08 10:08:12,804 INFO L290 TraceCheckUtils]: 26: Hoare triple {95666#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95666#false} is VALID [2022-04-08 10:08:12,804 INFO L290 TraceCheckUtils]: 27: Hoare triple {95666#false} assume !(~y~0 % 4294967296 > 0); {95666#false} is VALID [2022-04-08 10:08:12,804 INFO L290 TraceCheckUtils]: 28: Hoare triple {95666#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95666#false} is VALID [2022-04-08 10:08:12,804 INFO L290 TraceCheckUtils]: 29: Hoare triple {95666#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95666#false} is VALID [2022-04-08 10:08:12,804 INFO L290 TraceCheckUtils]: 30: Hoare triple {95666#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95666#false} is VALID [2022-04-08 10:08:12,804 INFO L290 TraceCheckUtils]: 31: Hoare triple {95666#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95666#false} is VALID [2022-04-08 10:08:12,804 INFO L290 TraceCheckUtils]: 32: Hoare triple {95666#false} assume !(~x~0 % 4294967296 > 0); {95666#false} is VALID [2022-04-08 10:08:12,804 INFO L272 TraceCheckUtils]: 33: Hoare triple {95666#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {95666#false} is VALID [2022-04-08 10:08:12,804 INFO L290 TraceCheckUtils]: 34: Hoare triple {95666#false} ~cond := #in~cond; {95666#false} is VALID [2022-04-08 10:08:12,804 INFO L290 TraceCheckUtils]: 35: Hoare triple {95666#false} assume 0 == ~cond; {95666#false} is VALID [2022-04-08 10:08:12,804 INFO L290 TraceCheckUtils]: 36: Hoare triple {95666#false} assume !false; {95666#false} is VALID [2022-04-08 10:08:12,805 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-08 10:08:12,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:08:13,109 INFO L290 TraceCheckUtils]: 36: Hoare triple {95666#false} assume !false; {95666#false} is VALID [2022-04-08 10:08:13,109 INFO L290 TraceCheckUtils]: 35: Hoare triple {95666#false} assume 0 == ~cond; {95666#false} is VALID [2022-04-08 10:08:13,109 INFO L290 TraceCheckUtils]: 34: Hoare triple {95666#false} ~cond := #in~cond; {95666#false} is VALID [2022-04-08 10:08:13,110 INFO L272 TraceCheckUtils]: 33: Hoare triple {95666#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {95666#false} is VALID [2022-04-08 10:08:13,110 INFO L290 TraceCheckUtils]: 32: Hoare triple {95666#false} assume !(~x~0 % 4294967296 > 0); {95666#false} is VALID [2022-04-08 10:08:13,110 INFO L290 TraceCheckUtils]: 31: Hoare triple {95666#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95666#false} is VALID [2022-04-08 10:08:13,110 INFO L290 TraceCheckUtils]: 30: Hoare triple {95666#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95666#false} is VALID [2022-04-08 10:08:13,110 INFO L290 TraceCheckUtils]: 29: Hoare triple {95666#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95666#false} is VALID [2022-04-08 10:08:13,110 INFO L290 TraceCheckUtils]: 28: Hoare triple {95666#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {95666#false} is VALID [2022-04-08 10:08:13,110 INFO L290 TraceCheckUtils]: 27: Hoare triple {95666#false} assume !(~y~0 % 4294967296 > 0); {95666#false} is VALID [2022-04-08 10:08:13,110 INFO L290 TraceCheckUtils]: 26: Hoare triple {95666#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95666#false} is VALID [2022-04-08 10:08:13,110 INFO L290 TraceCheckUtils]: 25: Hoare triple {95666#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95666#false} is VALID [2022-04-08 10:08:13,110 INFO L290 TraceCheckUtils]: 24: Hoare triple {95836#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95666#false} is VALID [2022-04-08 10:08:13,111 INFO L290 TraceCheckUtils]: 23: Hoare triple {95840#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95836#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:08:13,112 INFO L290 TraceCheckUtils]: 22: Hoare triple {95844#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95840#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:08:13,112 INFO L290 TraceCheckUtils]: 21: Hoare triple {95848#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95844#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:08:13,113 INFO L290 TraceCheckUtils]: 20: Hoare triple {95852#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95848#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:08:13,113 INFO L290 TraceCheckUtils]: 19: Hoare triple {95856#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {95852#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:08:13,114 INFO L290 TraceCheckUtils]: 18: Hoare triple {95860#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95856#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-08 10:08:13,115 INFO L290 TraceCheckUtils]: 17: Hoare triple {95864#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95860#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-08 10:08:13,115 INFO L290 TraceCheckUtils]: 16: Hoare triple {95868#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95864#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-08 10:08:13,116 INFO L290 TraceCheckUtils]: 15: Hoare triple {95872#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95868#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-08 10:08:13,117 INFO L290 TraceCheckUtils]: 14: Hoare triple {95665#true} ~z~0 := ~y~0; {95872#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-08 10:08:13,117 INFO L290 TraceCheckUtils]: 13: Hoare triple {95665#true} assume !(~x~0 % 4294967296 > 0); {95665#true} is VALID [2022-04-08 10:08:13,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {95665#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95665#true} is VALID [2022-04-08 10:08:13,117 INFO L290 TraceCheckUtils]: 11: Hoare triple {95665#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95665#true} is VALID [2022-04-08 10:08:13,117 INFO L290 TraceCheckUtils]: 10: Hoare triple {95665#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95665#true} is VALID [2022-04-08 10:08:13,117 INFO L290 TraceCheckUtils]: 9: Hoare triple {95665#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95665#true} is VALID [2022-04-08 10:08:13,117 INFO L290 TraceCheckUtils]: 8: Hoare triple {95665#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95665#true} is VALID [2022-04-08 10:08:13,117 INFO L290 TraceCheckUtils]: 7: Hoare triple {95665#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95665#true} is VALID [2022-04-08 10:08:13,117 INFO L290 TraceCheckUtils]: 6: Hoare triple {95665#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {95665#true} is VALID [2022-04-08 10:08:13,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {95665#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {95665#true} is VALID [2022-04-08 10:08:13,117 INFO L272 TraceCheckUtils]: 4: Hoare triple {95665#true} call #t~ret13 := main(); {95665#true} is VALID [2022-04-08 10:08:13,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95665#true} {95665#true} #72#return; {95665#true} is VALID [2022-04-08 10:08:13,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {95665#true} assume true; {95665#true} is VALID [2022-04-08 10:08:13,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {95665#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {95665#true} is VALID [2022-04-08 10:08:13,118 INFO L272 TraceCheckUtils]: 0: Hoare triple {95665#true} call ULTIMATE.init(); {95665#true} is VALID [2022-04-08 10:08:13,118 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-04-08 10:08:13,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576872244] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:08:13,118 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:08:13,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 12] total 31 [2022-04-08 10:08:13,118 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:08:13,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1328323024] [2022-04-08 10:08:13,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1328323024] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:08:13,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:08:13,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 10:08:13,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199677614] [2022-04-08 10:08:13,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:08:13,119 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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 37 [2022-04-08 10:08:13,119 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:08:13,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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-08 10:08:13,137 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-08 10:08:13,137 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 10:08:13,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:13,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 10:08:13,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=793, Unknown=0, NotChecked=0, Total=930 [2022-04-08 10:08:13,138 INFO L87 Difference]: Start difference. First operand 401 states and 550 transitions. Second operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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-08 10:08:17,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:17,291 INFO L93 Difference]: Finished difference Result 486 states and 642 transitions. [2022-04-08 10:08:17,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 10:08:17,291 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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 37 [2022-04-08 10:08:17,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:08:17,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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-08 10:08:17,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 85 transitions. [2022-04-08 10:08:17,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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-08 10:08:17,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 85 transitions. [2022-04-08 10:08:17,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 85 transitions. [2022-04-08 10:08:17,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:17,344 INFO L225 Difference]: With dead ends: 486 [2022-04-08 10:08:17,344 INFO L226 Difference]: Without dead ends: 468 [2022-04-08 10:08:17,344 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=290, Invalid=1966, Unknown=0, NotChecked=0, Total=2256 [2022-04-08 10:08:17,345 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 35 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:08:17,345 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 93 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:08:17,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2022-04-08 10:08:18,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 401. [2022-04-08 10:08:18,542 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:08:18,542 INFO L82 GeneralOperation]: Start isEquivalent. First operand 468 states. Second operand has 401 states, 396 states have (on average 1.3762626262626263) internal successors, (545), 396 states have internal predecessors, (545), 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-08 10:08:18,543 INFO L74 IsIncluded]: Start isIncluded. First operand 468 states. Second operand has 401 states, 396 states have (on average 1.3762626262626263) internal successors, (545), 396 states have internal predecessors, (545), 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-08 10:08:18,543 INFO L87 Difference]: Start difference. First operand 468 states. Second operand has 401 states, 396 states have (on average 1.3762626262626263) internal successors, (545), 396 states have internal predecessors, (545), 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-08 10:08:18,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:18,550 INFO L93 Difference]: Finished difference Result 468 states and 624 transitions. [2022-04-08 10:08:18,550 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 624 transitions. [2022-04-08 10:08:18,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:18,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:18,550 INFO L74 IsIncluded]: Start isIncluded. First operand has 401 states, 396 states have (on average 1.3762626262626263) internal successors, (545), 396 states have internal predecessors, (545), 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 468 states. [2022-04-08 10:08:18,550 INFO L87 Difference]: Start difference. First operand has 401 states, 396 states have (on average 1.3762626262626263) internal successors, (545), 396 states have internal predecessors, (545), 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 468 states. [2022-04-08 10:08:18,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:18,557 INFO L93 Difference]: Finished difference Result 468 states and 624 transitions. [2022-04-08 10:08:18,557 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 624 transitions. [2022-04-08 10:08:18,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:18,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:18,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:08:18,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:08:18,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 396 states have (on average 1.3762626262626263) internal successors, (545), 396 states have internal predecessors, (545), 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-08 10:08:18,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 549 transitions. [2022-04-08 10:08:18,564 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 549 transitions. Word has length 37 [2022-04-08 10:08:18,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:08:18,564 INFO L478 AbstractCegarLoop]: Abstraction has 401 states and 549 transitions. [2022-04-08 10:08:18,564 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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-08 10:08:18,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 401 states and 549 transitions. [2022-04-08 10:08:21,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 549 edges. 549 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:21,336 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 549 transitions. [2022-04-08 10:08:21,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 10:08:21,337 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:08:21,337 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:08:21,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Ended with exit code 0 [2022-04-08 10:08:21,537 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable64 [2022-04-08 10:08:21,537 INFO L403 AbstractCegarLoop]: === Iteration 66 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:08:21,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:08:21,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1394492966, now seen corresponding path program 27 times [2022-04-08 10:08:21,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:21,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [501049600] [2022-04-08 10:08:21,541 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:08:21,541 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:08:21,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1394492966, now seen corresponding path program 28 times [2022-04-08 10:08:21,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:08:21,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386678] [2022-04-08 10:08:21,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:08:21,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:08:21,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:21,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:08:21,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:21,773 INFO L290 TraceCheckUtils]: 0: Hoare triple {98685#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {98664#true} is VALID [2022-04-08 10:08:21,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {98664#true} assume true; {98664#true} is VALID [2022-04-08 10:08:21,773 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {98664#true} {98664#true} #72#return; {98664#true} is VALID [2022-04-08 10:08:21,774 INFO L272 TraceCheckUtils]: 0: Hoare triple {98664#true} call ULTIMATE.init(); {98685#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:08:21,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {98685#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {98664#true} is VALID [2022-04-08 10:08:21,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {98664#true} assume true; {98664#true} is VALID [2022-04-08 10:08:21,774 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98664#true} {98664#true} #72#return; {98664#true} is VALID [2022-04-08 10:08:21,774 INFO L272 TraceCheckUtils]: 4: Hoare triple {98664#true} call #t~ret13 := main(); {98664#true} is VALID [2022-04-08 10:08:21,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {98664#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {98669#(= main_~y~0 0)} is VALID [2022-04-08 10:08:21,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {98669#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98670#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:21,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {98670#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98671#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:21,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {98671#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98672#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:21,776 INFO L290 TraceCheckUtils]: 9: Hoare triple {98672#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98673#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:21,776 INFO L290 TraceCheckUtils]: 10: Hoare triple {98673#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98674#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:21,777 INFO L290 TraceCheckUtils]: 11: Hoare triple {98674#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98675#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:21,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {98675#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98676#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:21,778 INFO L290 TraceCheckUtils]: 13: Hoare triple {98676#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {98676#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:21,778 INFO L290 TraceCheckUtils]: 14: Hoare triple {98676#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {98677#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:08:21,779 INFO L290 TraceCheckUtils]: 15: Hoare triple {98677#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {98678#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:08:21,779 INFO L290 TraceCheckUtils]: 16: Hoare triple {98678#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {98679#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:08:21,780 INFO L290 TraceCheckUtils]: 17: Hoare triple {98679#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {98680#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:08:21,780 INFO L290 TraceCheckUtils]: 18: Hoare triple {98680#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {98681#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:08:21,781 INFO L290 TraceCheckUtils]: 19: Hoare triple {98681#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {98682#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:08:21,781 INFO L290 TraceCheckUtils]: 20: Hoare triple {98682#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {98683#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:08:21,782 INFO L290 TraceCheckUtils]: 21: Hoare triple {98683#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {98684#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:08:21,782 INFO L290 TraceCheckUtils]: 22: Hoare triple {98684#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {98665#false} is VALID [2022-04-08 10:08:21,782 INFO L290 TraceCheckUtils]: 23: Hoare triple {98665#false} assume !(~z~0 % 4294967296 > 0); {98665#false} is VALID [2022-04-08 10:08:21,782 INFO L290 TraceCheckUtils]: 24: Hoare triple {98665#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {98665#false} is VALID [2022-04-08 10:08:21,782 INFO L290 TraceCheckUtils]: 25: Hoare triple {98665#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {98665#false} is VALID [2022-04-08 10:08:21,782 INFO L290 TraceCheckUtils]: 26: Hoare triple {98665#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {98665#false} is VALID [2022-04-08 10:08:21,782 INFO L290 TraceCheckUtils]: 27: Hoare triple {98665#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {98665#false} is VALID [2022-04-08 10:08:21,782 INFO L290 TraceCheckUtils]: 28: Hoare triple {98665#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {98665#false} is VALID [2022-04-08 10:08:21,782 INFO L290 TraceCheckUtils]: 29: Hoare triple {98665#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {98665#false} is VALID [2022-04-08 10:08:21,782 INFO L290 TraceCheckUtils]: 30: Hoare triple {98665#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {98665#false} is VALID [2022-04-08 10:08:21,782 INFO L290 TraceCheckUtils]: 31: Hoare triple {98665#false} assume !(~y~0 % 4294967296 > 0); {98665#false} is VALID [2022-04-08 10:08:21,782 INFO L290 TraceCheckUtils]: 32: Hoare triple {98665#false} assume !(~x~0 % 4294967296 > 0); {98665#false} is VALID [2022-04-08 10:08:21,783 INFO L272 TraceCheckUtils]: 33: Hoare triple {98665#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {98665#false} is VALID [2022-04-08 10:08:21,783 INFO L290 TraceCheckUtils]: 34: Hoare triple {98665#false} ~cond := #in~cond; {98665#false} is VALID [2022-04-08 10:08:21,783 INFO L290 TraceCheckUtils]: 35: Hoare triple {98665#false} assume 0 == ~cond; {98665#false} is VALID [2022-04-08 10:08:21,783 INFO L290 TraceCheckUtils]: 36: Hoare triple {98665#false} assume !false; {98665#false} is VALID [2022-04-08 10:08:21,783 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 10:08:21,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:08:21,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386678] [2022-04-08 10:08:21,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386678] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:08:21,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562469953] [2022-04-08 10:08:21,783 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:08:21,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:21,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:08:21,784 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:08:21,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-04-08 10:08:21,825 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:08:21,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:08:21,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-08 10:08:21,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:21,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:08:22,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {98664#true} call ULTIMATE.init(); {98664#true} is VALID [2022-04-08 10:08:22,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {98664#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {98664#true} is VALID [2022-04-08 10:08:22,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {98664#true} assume true; {98664#true} is VALID [2022-04-08 10:08:22,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98664#true} {98664#true} #72#return; {98664#true} is VALID [2022-04-08 10:08:22,174 INFO L272 TraceCheckUtils]: 4: Hoare triple {98664#true} call #t~ret13 := main(); {98664#true} is VALID [2022-04-08 10:08:22,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {98664#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {98669#(= main_~y~0 0)} is VALID [2022-04-08 10:08:22,174 INFO L290 TraceCheckUtils]: 6: Hoare triple {98669#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98670#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:22,175 INFO L290 TraceCheckUtils]: 7: Hoare triple {98670#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98671#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:22,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {98671#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98672#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:22,176 INFO L290 TraceCheckUtils]: 9: Hoare triple {98672#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98673#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:22,176 INFO L290 TraceCheckUtils]: 10: Hoare triple {98673#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98674#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:22,177 INFO L290 TraceCheckUtils]: 11: Hoare triple {98674#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98675#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:22,177 INFO L290 TraceCheckUtils]: 12: Hoare triple {98675#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98676#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:22,178 INFO L290 TraceCheckUtils]: 13: Hoare triple {98676#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {98676#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:22,178 INFO L290 TraceCheckUtils]: 14: Hoare triple {98676#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {98731#(and (= main_~z~0 main_~y~0) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:22,178 INFO L290 TraceCheckUtils]: 15: Hoare triple {98731#(and (= main_~z~0 main_~y~0) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {98735#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:08:22,179 INFO L290 TraceCheckUtils]: 16: Hoare triple {98735#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {98739#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:08:22,180 INFO L290 TraceCheckUtils]: 17: Hoare triple {98739#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {98743#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:22,180 INFO L290 TraceCheckUtils]: 18: Hoare triple {98743#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {98747#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:22,181 INFO L290 TraceCheckUtils]: 19: Hoare triple {98747#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {98751#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)))} is VALID [2022-04-08 10:08:22,181 INFO L290 TraceCheckUtils]: 20: Hoare triple {98751#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {98755#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:22,182 INFO L290 TraceCheckUtils]: 21: Hoare triple {98755#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {98759#(and (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:22,182 INFO L290 TraceCheckUtils]: 22: Hoare triple {98759#(and (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {98665#false} is VALID [2022-04-08 10:08:22,183 INFO L290 TraceCheckUtils]: 23: Hoare triple {98665#false} assume !(~z~0 % 4294967296 > 0); {98665#false} is VALID [2022-04-08 10:08:22,183 INFO L290 TraceCheckUtils]: 24: Hoare triple {98665#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {98665#false} is VALID [2022-04-08 10:08:22,183 INFO L290 TraceCheckUtils]: 25: Hoare triple {98665#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {98665#false} is VALID [2022-04-08 10:08:22,183 INFO L290 TraceCheckUtils]: 26: Hoare triple {98665#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {98665#false} is VALID [2022-04-08 10:08:22,183 INFO L290 TraceCheckUtils]: 27: Hoare triple {98665#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {98665#false} is VALID [2022-04-08 10:08:22,183 INFO L290 TraceCheckUtils]: 28: Hoare triple {98665#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {98665#false} is VALID [2022-04-08 10:08:22,183 INFO L290 TraceCheckUtils]: 29: Hoare triple {98665#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {98665#false} is VALID [2022-04-08 10:08:22,183 INFO L290 TraceCheckUtils]: 30: Hoare triple {98665#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {98665#false} is VALID [2022-04-08 10:08:22,183 INFO L290 TraceCheckUtils]: 31: Hoare triple {98665#false} assume !(~y~0 % 4294967296 > 0); {98665#false} is VALID [2022-04-08 10:08:22,183 INFO L290 TraceCheckUtils]: 32: Hoare triple {98665#false} assume !(~x~0 % 4294967296 > 0); {98665#false} is VALID [2022-04-08 10:08:22,183 INFO L272 TraceCheckUtils]: 33: Hoare triple {98665#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {98665#false} is VALID [2022-04-08 10:08:22,183 INFO L290 TraceCheckUtils]: 34: Hoare triple {98665#false} ~cond := #in~cond; {98665#false} is VALID [2022-04-08 10:08:22,183 INFO L290 TraceCheckUtils]: 35: Hoare triple {98665#false} assume 0 == ~cond; {98665#false} is VALID [2022-04-08 10:08:22,183 INFO L290 TraceCheckUtils]: 36: Hoare triple {98665#false} assume !false; {98665#false} is VALID [2022-04-08 10:08:22,183 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 10:08:22,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:08:22,654 INFO L290 TraceCheckUtils]: 36: Hoare triple {98665#false} assume !false; {98665#false} is VALID [2022-04-08 10:08:22,654 INFO L290 TraceCheckUtils]: 35: Hoare triple {98665#false} assume 0 == ~cond; {98665#false} is VALID [2022-04-08 10:08:22,654 INFO L290 TraceCheckUtils]: 34: Hoare triple {98665#false} ~cond := #in~cond; {98665#false} is VALID [2022-04-08 10:08:22,654 INFO L272 TraceCheckUtils]: 33: Hoare triple {98665#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {98665#false} is VALID [2022-04-08 10:08:22,654 INFO L290 TraceCheckUtils]: 32: Hoare triple {98665#false} assume !(~x~0 % 4294967296 > 0); {98665#false} is VALID [2022-04-08 10:08:22,654 INFO L290 TraceCheckUtils]: 31: Hoare triple {98820#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {98665#false} is VALID [2022-04-08 10:08:22,655 INFO L290 TraceCheckUtils]: 30: Hoare triple {98824#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {98820#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:08:22,656 INFO L290 TraceCheckUtils]: 29: Hoare triple {98828#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {98824#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:08:22,658 INFO L290 TraceCheckUtils]: 28: Hoare triple {98832#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {98828#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:08:22,659 INFO L290 TraceCheckUtils]: 27: Hoare triple {98836#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {98832#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:08:22,660 INFO L290 TraceCheckUtils]: 26: Hoare triple {98840#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {98836#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:22,660 INFO L290 TraceCheckUtils]: 25: Hoare triple {98844#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {98840#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:22,661 INFO L290 TraceCheckUtils]: 24: Hoare triple {98848#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {98844#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:22,661 INFO L290 TraceCheckUtils]: 23: Hoare triple {98848#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !(~z~0 % 4294967296 > 0); {98848#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:08:22,661 INFO L290 TraceCheckUtils]: 22: Hoare triple {98855#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {98848#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:08:22,662 INFO L290 TraceCheckUtils]: 21: Hoare triple {98859#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {98855#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-08 10:08:22,663 INFO L290 TraceCheckUtils]: 20: Hoare triple {98863#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {98859#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-08 10:08:22,664 INFO L290 TraceCheckUtils]: 19: Hoare triple {98867#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {98863#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-08 10:08:22,665 INFO L290 TraceCheckUtils]: 18: Hoare triple {98871#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {98867#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-08 10:08:22,665 INFO L290 TraceCheckUtils]: 17: Hoare triple {98875#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {98871#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-08 10:08:22,666 INFO L290 TraceCheckUtils]: 16: Hoare triple {98879#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {98875#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-08 10:08:22,667 INFO L290 TraceCheckUtils]: 15: Hoare triple {98883#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {98879#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-08 10:08:22,667 INFO L290 TraceCheckUtils]: 14: Hoare triple {98664#true} ~z~0 := ~y~0; {98883#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} is VALID [2022-04-08 10:08:22,667 INFO L290 TraceCheckUtils]: 13: Hoare triple {98664#true} assume !(~x~0 % 4294967296 > 0); {98664#true} is VALID [2022-04-08 10:08:22,667 INFO L290 TraceCheckUtils]: 12: Hoare triple {98664#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98664#true} is VALID [2022-04-08 10:08:22,667 INFO L290 TraceCheckUtils]: 11: Hoare triple {98664#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98664#true} is VALID [2022-04-08 10:08:22,667 INFO L290 TraceCheckUtils]: 10: Hoare triple {98664#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98664#true} is VALID [2022-04-08 10:08:22,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {98664#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98664#true} is VALID [2022-04-08 10:08:22,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {98664#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98664#true} is VALID [2022-04-08 10:08:22,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {98664#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98664#true} is VALID [2022-04-08 10:08:22,667 INFO L290 TraceCheckUtils]: 6: Hoare triple {98664#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {98664#true} is VALID [2022-04-08 10:08:22,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {98664#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {98664#true} is VALID [2022-04-08 10:08:22,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {98664#true} call #t~ret13 := main(); {98664#true} is VALID [2022-04-08 10:08:22,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98664#true} {98664#true} #72#return; {98664#true} is VALID [2022-04-08 10:08:22,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {98664#true} assume true; {98664#true} is VALID [2022-04-08 10:08:22,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {98664#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {98664#true} is VALID [2022-04-08 10:08:22,668 INFO L272 TraceCheckUtils]: 0: Hoare triple {98664#true} call ULTIMATE.init(); {98664#true} is VALID [2022-04-08 10:08:22,668 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 10:08:22,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562469953] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:08:22,668 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:08:22,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 43 [2022-04-08 10:08:22,668 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:08:22,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [501049600] [2022-04-08 10:08:22,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [501049600] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:08:22,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:08:22,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 10:08:22,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070426412] [2022-04-08 10:08:22,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:08:22,669 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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 37 [2022-04-08 10:08:22,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:08:22,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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-08 10:08:22,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:22,685 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 10:08:22,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:22,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 10:08:22,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1515, Unknown=0, NotChecked=0, Total=1806 [2022-04-08 10:08:22,685 INFO L87 Difference]: Start difference. First operand 401 states and 549 transitions. Second operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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-08 10:08:27,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:27,501 INFO L93 Difference]: Finished difference Result 481 states and 634 transitions. [2022-04-08 10:08:27,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-04-08 10:08:27,501 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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 37 [2022-04-08 10:08:27,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:08:27,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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-08 10:08:27,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 102 transitions. [2022-04-08 10:08:27,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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-08 10:08:27,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 102 transitions. [2022-04-08 10:08:27,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 102 transitions. [2022-04-08 10:08:27,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:27,572 INFO L225 Difference]: With dead ends: 481 [2022-04-08 10:08:27,573 INFO L226 Difference]: Without dead ends: 438 [2022-04-08 10:08:27,573 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1744 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1190, Invalid=6820, Unknown=0, NotChecked=0, Total=8010 [2022-04-08 10:08:27,573 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 39 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1103 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:08:27,573 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 103 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1103 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 10:08:27,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2022-04-08 10:08:29,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 400. [2022-04-08 10:08:29,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:08:29,059 INFO L82 GeneralOperation]: Start isEquivalent. First operand 438 states. Second operand has 400 states, 395 states have (on average 1.3670886075949367) internal successors, (540), 395 states have internal predecessors, (540), 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-08 10:08:29,060 INFO L74 IsIncluded]: Start isIncluded. First operand 438 states. Second operand has 400 states, 395 states have (on average 1.3670886075949367) internal successors, (540), 395 states have internal predecessors, (540), 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-08 10:08:29,060 INFO L87 Difference]: Start difference. First operand 438 states. Second operand has 400 states, 395 states have (on average 1.3670886075949367) internal successors, (540), 395 states have internal predecessors, (540), 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-08 10:08:29,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:29,066 INFO L93 Difference]: Finished difference Result 438 states and 587 transitions. [2022-04-08 10:08:29,066 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 587 transitions. [2022-04-08 10:08:29,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:29,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:29,066 INFO L74 IsIncluded]: Start isIncluded. First operand has 400 states, 395 states have (on average 1.3670886075949367) internal successors, (540), 395 states have internal predecessors, (540), 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 438 states. [2022-04-08 10:08:29,067 INFO L87 Difference]: Start difference. First operand has 400 states, 395 states have (on average 1.3670886075949367) internal successors, (540), 395 states have internal predecessors, (540), 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 438 states. [2022-04-08 10:08:29,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:29,073 INFO L93 Difference]: Finished difference Result 438 states and 587 transitions. [2022-04-08 10:08:29,073 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 587 transitions. [2022-04-08 10:08:29,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:29,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:29,073 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:08:29,073 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:08:29,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 395 states have (on average 1.3670886075949367) internal successors, (540), 395 states have internal predecessors, (540), 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-08 10:08:29,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 544 transitions. [2022-04-08 10:08:29,080 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 544 transitions. Word has length 37 [2022-04-08 10:08:29,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:08:29,080 INFO L478 AbstractCegarLoop]: Abstraction has 400 states and 544 transitions. [2022-04-08 10:08:29,080 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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-08 10:08:29,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 400 states and 544 transitions. [2022-04-08 10:08:31,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 544 edges. 544 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:31,342 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 544 transitions. [2022-04-08 10:08:31,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 10:08:31,343 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:08:31,343 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:08:31,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Ended with exit code 0 [2022-04-08 10:08:31,555 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2022-04-08 10:08:31,555 INFO L403 AbstractCegarLoop]: === Iteration 67 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:08:31,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:08:31,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1905915000, now seen corresponding path program 57 times [2022-04-08 10:08:31,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:31,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [554379070] [2022-04-08 10:08:31,557 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:08:31,558 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:08:31,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1905915000, now seen corresponding path program 58 times [2022-04-08 10:08:31,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:08:31,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386452549] [2022-04-08 10:08:31,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:08:31,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:08:31,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:31,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:08:31,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:31,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {101681#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {101663#true} is VALID [2022-04-08 10:08:31,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {101663#true} assume true; {101663#true} is VALID [2022-04-08 10:08:31,766 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {101663#true} {101663#true} #72#return; {101663#true} is VALID [2022-04-08 10:08:31,767 INFO L272 TraceCheckUtils]: 0: Hoare triple {101663#true} call ULTIMATE.init(); {101681#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:08:31,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {101681#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {101663#true} is VALID [2022-04-08 10:08:31,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {101663#true} assume true; {101663#true} is VALID [2022-04-08 10:08:31,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {101663#true} {101663#true} #72#return; {101663#true} is VALID [2022-04-08 10:08:31,767 INFO L272 TraceCheckUtils]: 4: Hoare triple {101663#true} call #t~ret13 := main(); {101663#true} is VALID [2022-04-08 10:08:31,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {101663#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {101668#(= main_~y~0 0)} is VALID [2022-04-08 10:08:31,767 INFO L290 TraceCheckUtils]: 6: Hoare triple {101668#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101669#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:31,768 INFO L290 TraceCheckUtils]: 7: Hoare triple {101669#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101670#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:31,768 INFO L290 TraceCheckUtils]: 8: Hoare triple {101670#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101671#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:31,769 INFO L290 TraceCheckUtils]: 9: Hoare triple {101671#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101672#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:31,769 INFO L290 TraceCheckUtils]: 10: Hoare triple {101672#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101673#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:31,770 INFO L290 TraceCheckUtils]: 11: Hoare triple {101673#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101674#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:31,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {101674#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101675#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:31,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {101675#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101676#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:31,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {101676#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {101676#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:31,772 INFO L290 TraceCheckUtils]: 15: Hoare triple {101676#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {101677#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:08:31,772 INFO L290 TraceCheckUtils]: 16: Hoare triple {101677#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {101678#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:08:31,773 INFO L290 TraceCheckUtils]: 17: Hoare triple {101678#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {101679#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:08:31,773 INFO L290 TraceCheckUtils]: 18: Hoare triple {101679#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {101680#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:08:31,774 INFO L290 TraceCheckUtils]: 19: Hoare triple {101680#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {101664#false} is VALID [2022-04-08 10:08:31,774 INFO L290 TraceCheckUtils]: 20: Hoare triple {101664#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101664#false} is VALID [2022-04-08 10:08:31,774 INFO L290 TraceCheckUtils]: 21: Hoare triple {101664#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101664#false} is VALID [2022-04-08 10:08:31,774 INFO L290 TraceCheckUtils]: 22: Hoare triple {101664#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101664#false} is VALID [2022-04-08 10:08:31,774 INFO L290 TraceCheckUtils]: 23: Hoare triple {101664#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101664#false} is VALID [2022-04-08 10:08:31,774 INFO L290 TraceCheckUtils]: 24: Hoare triple {101664#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101664#false} is VALID [2022-04-08 10:08:31,774 INFO L290 TraceCheckUtils]: 25: Hoare triple {101664#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101664#false} is VALID [2022-04-08 10:08:31,774 INFO L290 TraceCheckUtils]: 26: Hoare triple {101664#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101664#false} is VALID [2022-04-08 10:08:31,774 INFO L290 TraceCheckUtils]: 27: Hoare triple {101664#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101664#false} is VALID [2022-04-08 10:08:31,774 INFO L290 TraceCheckUtils]: 28: Hoare triple {101664#false} assume !(~y~0 % 4294967296 > 0); {101664#false} is VALID [2022-04-08 10:08:31,774 INFO L290 TraceCheckUtils]: 29: Hoare triple {101664#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {101664#false} is VALID [2022-04-08 10:08:31,774 INFO L290 TraceCheckUtils]: 30: Hoare triple {101664#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {101664#false} is VALID [2022-04-08 10:08:31,774 INFO L290 TraceCheckUtils]: 31: Hoare triple {101664#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {101664#false} is VALID [2022-04-08 10:08:31,774 INFO L290 TraceCheckUtils]: 32: Hoare triple {101664#false} assume !(~x~0 % 4294967296 > 0); {101664#false} is VALID [2022-04-08 10:08:31,774 INFO L272 TraceCheckUtils]: 33: Hoare triple {101664#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {101664#false} is VALID [2022-04-08 10:08:31,774 INFO L290 TraceCheckUtils]: 34: Hoare triple {101664#false} ~cond := #in~cond; {101664#false} is VALID [2022-04-08 10:08:31,774 INFO L290 TraceCheckUtils]: 35: Hoare triple {101664#false} assume 0 == ~cond; {101664#false} is VALID [2022-04-08 10:08:31,774 INFO L290 TraceCheckUtils]: 36: Hoare triple {101664#false} assume !false; {101664#false} is VALID [2022-04-08 10:08:31,775 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-08 10:08:31,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:08:31,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386452549] [2022-04-08 10:08:31,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386452549] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:08:31,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942098382] [2022-04-08 10:08:31,775 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:08:31,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:31,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:08:31,776 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:08:31,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-04-08 10:08:31,816 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:08:31,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:08:31,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 10:08:31,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:31,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:08:32,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {101663#true} call ULTIMATE.init(); {101663#true} is VALID [2022-04-08 10:08:32,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {101663#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {101663#true} is VALID [2022-04-08 10:08:32,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {101663#true} assume true; {101663#true} is VALID [2022-04-08 10:08:32,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {101663#true} {101663#true} #72#return; {101663#true} is VALID [2022-04-08 10:08:32,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {101663#true} call #t~ret13 := main(); {101663#true} is VALID [2022-04-08 10:08:32,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {101663#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {101668#(= main_~y~0 0)} is VALID [2022-04-08 10:08:32,062 INFO L290 TraceCheckUtils]: 6: Hoare triple {101668#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101669#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:32,062 INFO L290 TraceCheckUtils]: 7: Hoare triple {101669#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101670#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:32,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {101670#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101671#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:32,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {101671#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101672#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:32,064 INFO L290 TraceCheckUtils]: 10: Hoare triple {101672#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101673#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:32,064 INFO L290 TraceCheckUtils]: 11: Hoare triple {101673#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101674#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:32,065 INFO L290 TraceCheckUtils]: 12: Hoare triple {101674#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101675#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:32,065 INFO L290 TraceCheckUtils]: 13: Hoare triple {101675#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101676#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:32,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {101676#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {101676#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:32,066 INFO L290 TraceCheckUtils]: 15: Hoare triple {101676#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {101677#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:08:32,066 INFO L290 TraceCheckUtils]: 16: Hoare triple {101677#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {101678#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:08:32,067 INFO L290 TraceCheckUtils]: 17: Hoare triple {101678#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {101679#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:08:32,067 INFO L290 TraceCheckUtils]: 18: Hoare triple {101679#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {101739#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:08:32,068 INFO L290 TraceCheckUtils]: 19: Hoare triple {101739#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {101664#false} is VALID [2022-04-08 10:08:32,068 INFO L290 TraceCheckUtils]: 20: Hoare triple {101664#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101664#false} is VALID [2022-04-08 10:08:32,068 INFO L290 TraceCheckUtils]: 21: Hoare triple {101664#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101664#false} is VALID [2022-04-08 10:08:32,068 INFO L290 TraceCheckUtils]: 22: Hoare triple {101664#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101664#false} is VALID [2022-04-08 10:08:32,068 INFO L290 TraceCheckUtils]: 23: Hoare triple {101664#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101664#false} is VALID [2022-04-08 10:08:32,068 INFO L290 TraceCheckUtils]: 24: Hoare triple {101664#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101664#false} is VALID [2022-04-08 10:08:32,068 INFO L290 TraceCheckUtils]: 25: Hoare triple {101664#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101664#false} is VALID [2022-04-08 10:08:32,068 INFO L290 TraceCheckUtils]: 26: Hoare triple {101664#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101664#false} is VALID [2022-04-08 10:08:32,068 INFO L290 TraceCheckUtils]: 27: Hoare triple {101664#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101664#false} is VALID [2022-04-08 10:08:32,068 INFO L290 TraceCheckUtils]: 28: Hoare triple {101664#false} assume !(~y~0 % 4294967296 > 0); {101664#false} is VALID [2022-04-08 10:08:32,068 INFO L290 TraceCheckUtils]: 29: Hoare triple {101664#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {101664#false} is VALID [2022-04-08 10:08:32,068 INFO L290 TraceCheckUtils]: 30: Hoare triple {101664#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {101664#false} is VALID [2022-04-08 10:08:32,068 INFO L290 TraceCheckUtils]: 31: Hoare triple {101664#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {101664#false} is VALID [2022-04-08 10:08:32,069 INFO L290 TraceCheckUtils]: 32: Hoare triple {101664#false} assume !(~x~0 % 4294967296 > 0); {101664#false} is VALID [2022-04-08 10:08:32,069 INFO L272 TraceCheckUtils]: 33: Hoare triple {101664#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {101664#false} is VALID [2022-04-08 10:08:32,069 INFO L290 TraceCheckUtils]: 34: Hoare triple {101664#false} ~cond := #in~cond; {101664#false} is VALID [2022-04-08 10:08:32,069 INFO L290 TraceCheckUtils]: 35: Hoare triple {101664#false} assume 0 == ~cond; {101664#false} is VALID [2022-04-08 10:08:32,069 INFO L290 TraceCheckUtils]: 36: Hoare triple {101664#false} assume !false; {101664#false} is VALID [2022-04-08 10:08:32,069 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-08 10:08:32,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:08:32,412 INFO L290 TraceCheckUtils]: 36: Hoare triple {101664#false} assume !false; {101664#false} is VALID [2022-04-08 10:08:32,413 INFO L290 TraceCheckUtils]: 35: Hoare triple {101664#false} assume 0 == ~cond; {101664#false} is VALID [2022-04-08 10:08:32,413 INFO L290 TraceCheckUtils]: 34: Hoare triple {101664#false} ~cond := #in~cond; {101664#false} is VALID [2022-04-08 10:08:32,413 INFO L272 TraceCheckUtils]: 33: Hoare triple {101664#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {101664#false} is VALID [2022-04-08 10:08:32,413 INFO L290 TraceCheckUtils]: 32: Hoare triple {101664#false} assume !(~x~0 % 4294967296 > 0); {101664#false} is VALID [2022-04-08 10:08:32,413 INFO L290 TraceCheckUtils]: 31: Hoare triple {101664#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {101664#false} is VALID [2022-04-08 10:08:32,413 INFO L290 TraceCheckUtils]: 30: Hoare triple {101664#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {101664#false} is VALID [2022-04-08 10:08:32,413 INFO L290 TraceCheckUtils]: 29: Hoare triple {101664#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {101664#false} is VALID [2022-04-08 10:08:32,413 INFO L290 TraceCheckUtils]: 28: Hoare triple {101664#false} assume !(~y~0 % 4294967296 > 0); {101664#false} is VALID [2022-04-08 10:08:32,413 INFO L290 TraceCheckUtils]: 27: Hoare triple {101664#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101664#false} is VALID [2022-04-08 10:08:32,413 INFO L290 TraceCheckUtils]: 26: Hoare triple {101664#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101664#false} is VALID [2022-04-08 10:08:32,413 INFO L290 TraceCheckUtils]: 25: Hoare triple {101664#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101664#false} is VALID [2022-04-08 10:08:32,413 INFO L290 TraceCheckUtils]: 24: Hoare triple {101664#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101664#false} is VALID [2022-04-08 10:08:32,413 INFO L290 TraceCheckUtils]: 23: Hoare triple {101664#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101664#false} is VALID [2022-04-08 10:08:32,413 INFO L290 TraceCheckUtils]: 22: Hoare triple {101664#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101664#false} is VALID [2022-04-08 10:08:32,413 INFO L290 TraceCheckUtils]: 21: Hoare triple {101664#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101664#false} is VALID [2022-04-08 10:08:32,413 INFO L290 TraceCheckUtils]: 20: Hoare triple {101664#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {101664#false} is VALID [2022-04-08 10:08:32,414 INFO L290 TraceCheckUtils]: 19: Hoare triple {101845#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {101664#false} is VALID [2022-04-08 10:08:32,414 INFO L290 TraceCheckUtils]: 18: Hoare triple {101849#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {101845#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:08:32,415 INFO L290 TraceCheckUtils]: 17: Hoare triple {101853#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {101849#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:08:32,416 INFO L290 TraceCheckUtils]: 16: Hoare triple {101857#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {101853#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:08:32,417 INFO L290 TraceCheckUtils]: 15: Hoare triple {101861#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {101857#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:08:32,417 INFO L290 TraceCheckUtils]: 14: Hoare triple {101861#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {101861#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:08:32,418 INFO L290 TraceCheckUtils]: 13: Hoare triple {101868#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101861#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:08:32,418 INFO L290 TraceCheckUtils]: 12: Hoare triple {101872#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101868#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:08:32,419 INFO L290 TraceCheckUtils]: 11: Hoare triple {101876#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101872#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:08:32,420 INFO L290 TraceCheckUtils]: 10: Hoare triple {101880#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101876#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:08:32,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {101884#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101880#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:08:32,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {101888#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101884#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:08:32,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {101892#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101888#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:08:32,422 INFO L290 TraceCheckUtils]: 6: Hoare triple {101896#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {101892#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:08:32,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {101663#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {101896#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:32,423 INFO L272 TraceCheckUtils]: 4: Hoare triple {101663#true} call #t~ret13 := main(); {101663#true} is VALID [2022-04-08 10:08:32,423 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {101663#true} {101663#true} #72#return; {101663#true} is VALID [2022-04-08 10:08:32,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {101663#true} assume true; {101663#true} is VALID [2022-04-08 10:08:32,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {101663#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {101663#true} is VALID [2022-04-08 10:08:32,423 INFO L272 TraceCheckUtils]: 0: Hoare triple {101663#true} call ULTIMATE.init(); {101663#true} is VALID [2022-04-08 10:08:32,423 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-08 10:08:32,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942098382] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:08:32,423 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:08:32,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-08 10:08:32,423 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:08:32,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [554379070] [2022-04-08 10:08:32,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [554379070] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:08:32,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:08:32,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 10:08:32,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916999119] [2022-04-08 10:08:32,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:08:32,424 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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 37 [2022-04-08 10:08:32,424 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:08:32,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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-08 10:08:32,442 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-08 10:08:32,442 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 10:08:32,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:32,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 10:08:32,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=712, Unknown=0, NotChecked=0, Total=870 [2022-04-08 10:08:32,442 INFO L87 Difference]: Start difference. First operand 400 states and 544 transitions. Second operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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-08 10:08:37,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:37,308 INFO L93 Difference]: Finished difference Result 505 states and 657 transitions. [2022-04-08 10:08:37,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 10:08:37,308 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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 37 [2022-04-08 10:08:37,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:08:37,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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-08 10:08:37,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 94 transitions. [2022-04-08 10:08:37,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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-08 10:08:37,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 94 transitions. [2022-04-08 10:08:37,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 94 transitions. [2022-04-08 10:08:37,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:37,368 INFO L225 Difference]: With dead ends: 505 [2022-04-08 10:08:37,368 INFO L226 Difference]: Without dead ends: 487 [2022-04-08 10:08:37,369 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=454, Invalid=1802, Unknown=0, NotChecked=0, Total=2256 [2022-04-08 10:08:37,370 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 42 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:08:37,370 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 94 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 10:08:37,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2022-04-08 10:08:38,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 400. [2022-04-08 10:08:38,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:08:38,579 INFO L82 GeneralOperation]: Start isEquivalent. First operand 487 states. Second operand has 400 states, 395 states have (on average 1.3645569620253164) internal successors, (539), 395 states have internal predecessors, (539), 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-08 10:08:38,579 INFO L74 IsIncluded]: Start isIncluded. First operand 487 states. Second operand has 400 states, 395 states have (on average 1.3645569620253164) internal successors, (539), 395 states have internal predecessors, (539), 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-08 10:08:38,580 INFO L87 Difference]: Start difference. First operand 487 states. Second operand has 400 states, 395 states have (on average 1.3645569620253164) internal successors, (539), 395 states have internal predecessors, (539), 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-08 10:08:38,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:38,587 INFO L93 Difference]: Finished difference Result 487 states and 639 transitions. [2022-04-08 10:08:38,587 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 639 transitions. [2022-04-08 10:08:38,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:38,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:38,587 INFO L74 IsIncluded]: Start isIncluded. First operand has 400 states, 395 states have (on average 1.3645569620253164) internal successors, (539), 395 states have internal predecessors, (539), 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 487 states. [2022-04-08 10:08:38,587 INFO L87 Difference]: Start difference. First operand has 400 states, 395 states have (on average 1.3645569620253164) internal successors, (539), 395 states have internal predecessors, (539), 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 487 states. [2022-04-08 10:08:38,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:38,594 INFO L93 Difference]: Finished difference Result 487 states and 639 transitions. [2022-04-08 10:08:38,594 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 639 transitions. [2022-04-08 10:08:38,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:38,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:38,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:08:38,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:08:38,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 395 states have (on average 1.3645569620253164) internal successors, (539), 395 states have internal predecessors, (539), 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-08 10:08:38,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 543 transitions. [2022-04-08 10:08:38,601 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 543 transitions. Word has length 37 [2022-04-08 10:08:38,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:08:38,601 INFO L478 AbstractCegarLoop]: Abstraction has 400 states and 543 transitions. [2022-04-08 10:08:38,602 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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-08 10:08:38,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 400 states and 543 transitions. [2022-04-08 10:08:40,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 543 edges. 543 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:40,874 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 543 transitions. [2022-04-08 10:08:40,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 10:08:40,874 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:08:40,875 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:08:40,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Ended with exit code 0 [2022-04-08 10:08:41,087 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:41,088 INFO L403 AbstractCegarLoop]: === Iteration 68 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:08:41,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:08:41,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1335082086, now seen corresponding path program 59 times [2022-04-08 10:08:41,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:41,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [223697248] [2022-04-08 10:08:41,090 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:08:41,090 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:08:41,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1335082086, now seen corresponding path program 60 times [2022-04-08 10:08:41,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:08:41,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625151097] [2022-04-08 10:08:41,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:08:41,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:08:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:41,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:08:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:41,245 INFO L290 TraceCheckUtils]: 0: Hoare triple {104755#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {104737#true} is VALID [2022-04-08 10:08:41,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {104737#true} assume true; {104737#true} is VALID [2022-04-08 10:08:41,245 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {104737#true} {104737#true} #72#return; {104737#true} is VALID [2022-04-08 10:08:41,246 INFO L272 TraceCheckUtils]: 0: Hoare triple {104737#true} call ULTIMATE.init(); {104755#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:08:41,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {104755#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {104737#true} is VALID [2022-04-08 10:08:41,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {104737#true} assume true; {104737#true} is VALID [2022-04-08 10:08:41,246 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104737#true} {104737#true} #72#return; {104737#true} is VALID [2022-04-08 10:08:41,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {104737#true} call #t~ret13 := main(); {104737#true} is VALID [2022-04-08 10:08:41,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {104737#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {104742#(= main_~y~0 0)} is VALID [2022-04-08 10:08:41,246 INFO L290 TraceCheckUtils]: 6: Hoare triple {104742#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104743#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:41,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {104743#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104744#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:41,247 INFO L290 TraceCheckUtils]: 8: Hoare triple {104744#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104745#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:41,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {104745#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104746#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:41,248 INFO L290 TraceCheckUtils]: 10: Hoare triple {104746#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104747#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:41,249 INFO L290 TraceCheckUtils]: 11: Hoare triple {104747#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104748#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:41,249 INFO L290 TraceCheckUtils]: 12: Hoare triple {104748#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104749#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:41,250 INFO L290 TraceCheckUtils]: 13: Hoare triple {104749#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104750#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:41,250 INFO L290 TraceCheckUtils]: 14: Hoare triple {104750#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104751#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:41,250 INFO L290 TraceCheckUtils]: 15: Hoare triple {104751#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {104751#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:41,251 INFO L290 TraceCheckUtils]: 16: Hoare triple {104751#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {104752#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:08:41,251 INFO L290 TraceCheckUtils]: 17: Hoare triple {104752#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {104753#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:08:41,252 INFO L290 TraceCheckUtils]: 18: Hoare triple {104753#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {104754#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:08:41,252 INFO L290 TraceCheckUtils]: 19: Hoare triple {104754#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {104738#false} is VALID [2022-04-08 10:08:41,252 INFO L290 TraceCheckUtils]: 20: Hoare triple {104738#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {104738#false} is VALID [2022-04-08 10:08:41,252 INFO L290 TraceCheckUtils]: 21: Hoare triple {104738#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {104738#false} is VALID [2022-04-08 10:08:41,252 INFO L290 TraceCheckUtils]: 22: Hoare triple {104738#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {104738#false} is VALID [2022-04-08 10:08:41,252 INFO L290 TraceCheckUtils]: 23: Hoare triple {104738#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {104738#false} is VALID [2022-04-08 10:08:41,252 INFO L290 TraceCheckUtils]: 24: Hoare triple {104738#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {104738#false} is VALID [2022-04-08 10:08:41,252 INFO L290 TraceCheckUtils]: 25: Hoare triple {104738#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {104738#false} is VALID [2022-04-08 10:08:41,252 INFO L290 TraceCheckUtils]: 26: Hoare triple {104738#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {104738#false} is VALID [2022-04-08 10:08:41,252 INFO L290 TraceCheckUtils]: 27: Hoare triple {104738#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {104738#false} is VALID [2022-04-08 10:08:41,252 INFO L290 TraceCheckUtils]: 28: Hoare triple {104738#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {104738#false} is VALID [2022-04-08 10:08:41,252 INFO L290 TraceCheckUtils]: 29: Hoare triple {104738#false} assume !(~y~0 % 4294967296 > 0); {104738#false} is VALID [2022-04-08 10:08:41,252 INFO L290 TraceCheckUtils]: 30: Hoare triple {104738#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {104738#false} is VALID [2022-04-08 10:08:41,253 INFO L290 TraceCheckUtils]: 31: Hoare triple {104738#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {104738#false} is VALID [2022-04-08 10:08:41,253 INFO L290 TraceCheckUtils]: 32: Hoare triple {104738#false} assume !(~x~0 % 4294967296 > 0); {104738#false} is VALID [2022-04-08 10:08:41,253 INFO L272 TraceCheckUtils]: 33: Hoare triple {104738#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {104738#false} is VALID [2022-04-08 10:08:41,253 INFO L290 TraceCheckUtils]: 34: Hoare triple {104738#false} ~cond := #in~cond; {104738#false} is VALID [2022-04-08 10:08:41,253 INFO L290 TraceCheckUtils]: 35: Hoare triple {104738#false} assume 0 == ~cond; {104738#false} is VALID [2022-04-08 10:08:41,253 INFO L290 TraceCheckUtils]: 36: Hoare triple {104738#false} assume !false; {104738#false} is VALID [2022-04-08 10:08:41,253 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-08 10:08:41,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:08:41,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625151097] [2022-04-08 10:08:41,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625151097] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:08:41,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679135260] [2022-04-08 10:08:41,253 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:08:41,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:41,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:08:41,254 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:08:41,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2022-04-08 10:08:41,385 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-08 10:08:41,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:08:41,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 10:08:41,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:41,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:08:41,629 INFO L272 TraceCheckUtils]: 0: Hoare triple {104737#true} call ULTIMATE.init(); {104737#true} is VALID [2022-04-08 10:08:41,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {104737#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {104737#true} is VALID [2022-04-08 10:08:41,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {104737#true} assume true; {104737#true} is VALID [2022-04-08 10:08:41,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104737#true} {104737#true} #72#return; {104737#true} is VALID [2022-04-08 10:08:41,629 INFO L272 TraceCheckUtils]: 4: Hoare triple {104737#true} call #t~ret13 := main(); {104737#true} is VALID [2022-04-08 10:08:41,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {104737#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {104742#(= main_~y~0 0)} is VALID [2022-04-08 10:08:41,630 INFO L290 TraceCheckUtils]: 6: Hoare triple {104742#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104743#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:41,631 INFO L290 TraceCheckUtils]: 7: Hoare triple {104743#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104744#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:41,631 INFO L290 TraceCheckUtils]: 8: Hoare triple {104744#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104745#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:41,632 INFO L290 TraceCheckUtils]: 9: Hoare triple {104745#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104746#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:41,632 INFO L290 TraceCheckUtils]: 10: Hoare triple {104746#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104747#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:41,632 INFO L290 TraceCheckUtils]: 11: Hoare triple {104747#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104748#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:41,633 INFO L290 TraceCheckUtils]: 12: Hoare triple {104748#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104749#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:41,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {104749#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104750#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:41,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {104750#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104751#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:41,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {104751#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {104751#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:41,635 INFO L290 TraceCheckUtils]: 16: Hoare triple {104751#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {104752#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:08:41,635 INFO L290 TraceCheckUtils]: 17: Hoare triple {104752#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {104753#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:08:41,636 INFO L290 TraceCheckUtils]: 18: Hoare triple {104753#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {104813#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:08:41,636 INFO L290 TraceCheckUtils]: 19: Hoare triple {104813#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {104738#false} is VALID [2022-04-08 10:08:41,636 INFO L290 TraceCheckUtils]: 20: Hoare triple {104738#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {104738#false} is VALID [2022-04-08 10:08:41,636 INFO L290 TraceCheckUtils]: 21: Hoare triple {104738#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {104738#false} is VALID [2022-04-08 10:08:41,636 INFO L290 TraceCheckUtils]: 22: Hoare triple {104738#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {104738#false} is VALID [2022-04-08 10:08:41,636 INFO L290 TraceCheckUtils]: 23: Hoare triple {104738#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {104738#false} is VALID [2022-04-08 10:08:41,636 INFO L290 TraceCheckUtils]: 24: Hoare triple {104738#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {104738#false} is VALID [2022-04-08 10:08:41,636 INFO L290 TraceCheckUtils]: 25: Hoare triple {104738#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {104738#false} is VALID [2022-04-08 10:08:41,636 INFO L290 TraceCheckUtils]: 26: Hoare triple {104738#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {104738#false} is VALID [2022-04-08 10:08:41,636 INFO L290 TraceCheckUtils]: 27: Hoare triple {104738#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {104738#false} is VALID [2022-04-08 10:08:41,636 INFO L290 TraceCheckUtils]: 28: Hoare triple {104738#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {104738#false} is VALID [2022-04-08 10:08:41,636 INFO L290 TraceCheckUtils]: 29: Hoare triple {104738#false} assume !(~y~0 % 4294967296 > 0); {104738#false} is VALID [2022-04-08 10:08:41,636 INFO L290 TraceCheckUtils]: 30: Hoare triple {104738#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {104738#false} is VALID [2022-04-08 10:08:41,637 INFO L290 TraceCheckUtils]: 31: Hoare triple {104738#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {104738#false} is VALID [2022-04-08 10:08:41,637 INFO L290 TraceCheckUtils]: 32: Hoare triple {104738#false} assume !(~x~0 % 4294967296 > 0); {104738#false} is VALID [2022-04-08 10:08:41,637 INFO L272 TraceCheckUtils]: 33: Hoare triple {104738#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {104738#false} is VALID [2022-04-08 10:08:41,637 INFO L290 TraceCheckUtils]: 34: Hoare triple {104738#false} ~cond := #in~cond; {104738#false} is VALID [2022-04-08 10:08:41,637 INFO L290 TraceCheckUtils]: 35: Hoare triple {104738#false} assume 0 == ~cond; {104738#false} is VALID [2022-04-08 10:08:41,637 INFO L290 TraceCheckUtils]: 36: Hoare triple {104738#false} assume !false; {104738#false} is VALID [2022-04-08 10:08:41,637 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-08 10:08:41,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:08:41,981 INFO L290 TraceCheckUtils]: 36: Hoare triple {104738#false} assume !false; {104738#false} is VALID [2022-04-08 10:08:41,981 INFO L290 TraceCheckUtils]: 35: Hoare triple {104738#false} assume 0 == ~cond; {104738#false} is VALID [2022-04-08 10:08:41,981 INFO L290 TraceCheckUtils]: 34: Hoare triple {104738#false} ~cond := #in~cond; {104738#false} is VALID [2022-04-08 10:08:41,981 INFO L272 TraceCheckUtils]: 33: Hoare triple {104738#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {104738#false} is VALID [2022-04-08 10:08:41,982 INFO L290 TraceCheckUtils]: 32: Hoare triple {104738#false} assume !(~x~0 % 4294967296 > 0); {104738#false} is VALID [2022-04-08 10:08:41,982 INFO L290 TraceCheckUtils]: 31: Hoare triple {104738#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {104738#false} is VALID [2022-04-08 10:08:41,982 INFO L290 TraceCheckUtils]: 30: Hoare triple {104738#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {104738#false} is VALID [2022-04-08 10:08:41,982 INFO L290 TraceCheckUtils]: 29: Hoare triple {104738#false} assume !(~y~0 % 4294967296 > 0); {104738#false} is VALID [2022-04-08 10:08:41,982 INFO L290 TraceCheckUtils]: 28: Hoare triple {104738#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {104738#false} is VALID [2022-04-08 10:08:41,982 INFO L290 TraceCheckUtils]: 27: Hoare triple {104738#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {104738#false} is VALID [2022-04-08 10:08:41,982 INFO L290 TraceCheckUtils]: 26: Hoare triple {104738#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {104738#false} is VALID [2022-04-08 10:08:41,982 INFO L290 TraceCheckUtils]: 25: Hoare triple {104738#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {104738#false} is VALID [2022-04-08 10:08:41,982 INFO L290 TraceCheckUtils]: 24: Hoare triple {104738#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {104738#false} is VALID [2022-04-08 10:08:41,982 INFO L290 TraceCheckUtils]: 23: Hoare triple {104738#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {104738#false} is VALID [2022-04-08 10:08:41,982 INFO L290 TraceCheckUtils]: 22: Hoare triple {104738#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {104738#false} is VALID [2022-04-08 10:08:41,982 INFO L290 TraceCheckUtils]: 21: Hoare triple {104738#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {104738#false} is VALID [2022-04-08 10:08:41,982 INFO L290 TraceCheckUtils]: 20: Hoare triple {104738#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {104738#false} is VALID [2022-04-08 10:08:41,982 INFO L290 TraceCheckUtils]: 19: Hoare triple {104919#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {104738#false} is VALID [2022-04-08 10:08:41,983 INFO L290 TraceCheckUtils]: 18: Hoare triple {104923#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {104919#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:08:41,984 INFO L290 TraceCheckUtils]: 17: Hoare triple {104927#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {104923#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:08:41,984 INFO L290 TraceCheckUtils]: 16: Hoare triple {104931#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {104927#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:08:41,984 INFO L290 TraceCheckUtils]: 15: Hoare triple {104931#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {104931#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:08:41,985 INFO L290 TraceCheckUtils]: 14: Hoare triple {104938#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104931#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:08:41,985 INFO L290 TraceCheckUtils]: 13: Hoare triple {104942#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104938#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:08:41,986 INFO L290 TraceCheckUtils]: 12: Hoare triple {104946#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104942#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:08:41,987 INFO L290 TraceCheckUtils]: 11: Hoare triple {104950#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104946#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:08:41,987 INFO L290 TraceCheckUtils]: 10: Hoare triple {104954#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104950#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:08:41,988 INFO L290 TraceCheckUtils]: 9: Hoare triple {104958#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104954#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:08:41,989 INFO L290 TraceCheckUtils]: 8: Hoare triple {104962#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104958#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:08:41,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {104966#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104962#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:41,990 INFO L290 TraceCheckUtils]: 6: Hoare triple {104970#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {104966#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:08:41,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {104737#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {104970#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:41,990 INFO L272 TraceCheckUtils]: 4: Hoare triple {104737#true} call #t~ret13 := main(); {104737#true} is VALID [2022-04-08 10:08:41,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104737#true} {104737#true} #72#return; {104737#true} is VALID [2022-04-08 10:08:41,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {104737#true} assume true; {104737#true} is VALID [2022-04-08 10:08:41,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {104737#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {104737#true} is VALID [2022-04-08 10:08:41,990 INFO L272 TraceCheckUtils]: 0: Hoare triple {104737#true} call ULTIMATE.init(); {104737#true} is VALID [2022-04-08 10:08:41,991 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-08 10:08:41,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679135260] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:08:41,991 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:08:41,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-08 10:08:41,991 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:08:41,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [223697248] [2022-04-08 10:08:41,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [223697248] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:08:41,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:08:41,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 10:08:41,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550815531] [2022-04-08 10:08:41,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:08:41,992 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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 37 [2022-04-08 10:08:41,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:08:41,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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-08 10:08:42,009 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-08 10:08:42,009 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 10:08:42,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:42,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 10:08:42,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=701, Unknown=0, NotChecked=0, Total=870 [2022-04-08 10:08:42,010 INFO L87 Difference]: Start difference. First operand 400 states and 543 transitions. Second operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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-08 10:08:45,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:45,968 INFO L93 Difference]: Finished difference Result 526 states and 678 transitions. [2022-04-08 10:08:45,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 10:08:45,968 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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 37 [2022-04-08 10:08:45,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:08:45,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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-08 10:08:45,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 100 transitions. [2022-04-08 10:08:45,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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-08 10:08:45,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 100 transitions. [2022-04-08 10:08:45,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 100 transitions. [2022-04-08 10:08:46,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:46,030 INFO L225 Difference]: With dead ends: 526 [2022-04-08 10:08:46,030 INFO L226 Difference]: Without dead ends: 508 [2022-04-08 10:08:46,043 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=426, Invalid=1644, Unknown=0, NotChecked=0, Total=2070 [2022-04-08 10:08:46,043 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 51 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:08:46,043 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 104 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:08:46,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2022-04-08 10:08:47,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 400. [2022-04-08 10:08:47,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:08:47,261 INFO L82 GeneralOperation]: Start isEquivalent. First operand 508 states. Second operand has 400 states, 395 states have (on average 1.3620253164556961) internal successors, (538), 395 states have internal predecessors, (538), 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-08 10:08:47,261 INFO L74 IsIncluded]: Start isIncluded. First operand 508 states. Second operand has 400 states, 395 states have (on average 1.3620253164556961) internal successors, (538), 395 states have internal predecessors, (538), 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-08 10:08:47,262 INFO L87 Difference]: Start difference. First operand 508 states. Second operand has 400 states, 395 states have (on average 1.3620253164556961) internal successors, (538), 395 states have internal predecessors, (538), 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-08 10:08:47,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:47,269 INFO L93 Difference]: Finished difference Result 508 states and 660 transitions. [2022-04-08 10:08:47,269 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 660 transitions. [2022-04-08 10:08:47,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:47,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:47,270 INFO L74 IsIncluded]: Start isIncluded. First operand has 400 states, 395 states have (on average 1.3620253164556961) internal successors, (538), 395 states have internal predecessors, (538), 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 508 states. [2022-04-08 10:08:47,270 INFO L87 Difference]: Start difference. First operand has 400 states, 395 states have (on average 1.3620253164556961) internal successors, (538), 395 states have internal predecessors, (538), 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 508 states. [2022-04-08 10:08:47,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:47,277 INFO L93 Difference]: Finished difference Result 508 states and 660 transitions. [2022-04-08 10:08:47,277 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 660 transitions. [2022-04-08 10:08:47,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:47,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:47,278 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:08:47,278 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:08:47,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 395 states have (on average 1.3620253164556961) internal successors, (538), 395 states have internal predecessors, (538), 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-08 10:08:47,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 542 transitions. [2022-04-08 10:08:47,284 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 542 transitions. Word has length 37 [2022-04-08 10:08:47,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:08:47,285 INFO L478 AbstractCegarLoop]: Abstraction has 400 states and 542 transitions. [2022-04-08 10:08:47,285 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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-08 10:08:47,285 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 400 states and 542 transitions. [2022-04-08 10:08:49,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 542 edges. 542 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:49,995 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 542 transitions. [2022-04-08 10:08:49,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 10:08:49,996 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:08:49,996 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:08:50,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Forceful destruction successful, exit code 0 [2022-04-08 10:08:50,212 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2022-04-08 10:08:50,212 INFO L403 AbstractCegarLoop]: === Iteration 69 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:08:50,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:08:50,212 INFO L85 PathProgramCache]: Analyzing trace with hash 208289464, now seen corresponding path program 61 times [2022-04-08 10:08:50,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:50,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1609375006] [2022-04-08 10:08:50,214 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:08:50,214 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:08:50,214 INFO L85 PathProgramCache]: Analyzing trace with hash 208289464, now seen corresponding path program 62 times [2022-04-08 10:08:50,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:08:50,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186017679] [2022-04-08 10:08:50,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:08:50,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:08:50,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:50,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:08:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:50,423 INFO L290 TraceCheckUtils]: 0: Hoare triple {107909#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {107891#true} is VALID [2022-04-08 10:08:50,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {107891#true} assume true; {107891#true} is VALID [2022-04-08 10:08:50,424 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {107891#true} {107891#true} #72#return; {107891#true} is VALID [2022-04-08 10:08:50,424 INFO L272 TraceCheckUtils]: 0: Hoare triple {107891#true} call ULTIMATE.init(); {107909#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:08:50,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {107909#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {107891#true} is VALID [2022-04-08 10:08:50,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {107891#true} assume true; {107891#true} is VALID [2022-04-08 10:08:50,424 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107891#true} {107891#true} #72#return; {107891#true} is VALID [2022-04-08 10:08:50,424 INFO L272 TraceCheckUtils]: 4: Hoare triple {107891#true} call #t~ret13 := main(); {107891#true} is VALID [2022-04-08 10:08:50,424 INFO L290 TraceCheckUtils]: 5: Hoare triple {107891#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {107896#(= main_~y~0 0)} is VALID [2022-04-08 10:08:50,425 INFO L290 TraceCheckUtils]: 6: Hoare triple {107896#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {107897#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:50,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {107897#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {107898#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:50,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {107898#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {107899#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:50,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {107899#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {107900#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:50,427 INFO L290 TraceCheckUtils]: 10: Hoare triple {107900#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {107901#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:50,427 INFO L290 TraceCheckUtils]: 11: Hoare triple {107901#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {107902#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:50,428 INFO L290 TraceCheckUtils]: 12: Hoare triple {107902#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {107903#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:50,428 INFO L290 TraceCheckUtils]: 13: Hoare triple {107903#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {107904#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:50,429 INFO L290 TraceCheckUtils]: 14: Hoare triple {107904#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {107905#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:50,429 INFO L290 TraceCheckUtils]: 15: Hoare triple {107905#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {107906#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:50,430 INFO L290 TraceCheckUtils]: 16: Hoare triple {107906#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {107906#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:50,430 INFO L290 TraceCheckUtils]: 17: Hoare triple {107906#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {107907#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:08:50,431 INFO L290 TraceCheckUtils]: 18: Hoare triple {107907#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {107908#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:08:50,431 INFO L290 TraceCheckUtils]: 19: Hoare triple {107908#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {107892#false} is VALID [2022-04-08 10:08:50,431 INFO L290 TraceCheckUtils]: 20: Hoare triple {107892#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {107892#false} is VALID [2022-04-08 10:08:50,431 INFO L290 TraceCheckUtils]: 21: Hoare triple {107892#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {107892#false} is VALID [2022-04-08 10:08:50,431 INFO L290 TraceCheckUtils]: 22: Hoare triple {107892#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {107892#false} is VALID [2022-04-08 10:08:50,431 INFO L290 TraceCheckUtils]: 23: Hoare triple {107892#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {107892#false} is VALID [2022-04-08 10:08:50,431 INFO L290 TraceCheckUtils]: 24: Hoare triple {107892#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {107892#false} is VALID [2022-04-08 10:08:50,431 INFO L290 TraceCheckUtils]: 25: Hoare triple {107892#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {107892#false} is VALID [2022-04-08 10:08:50,431 INFO L290 TraceCheckUtils]: 26: Hoare triple {107892#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {107892#false} is VALID [2022-04-08 10:08:50,431 INFO L290 TraceCheckUtils]: 27: Hoare triple {107892#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {107892#false} is VALID [2022-04-08 10:08:50,431 INFO L290 TraceCheckUtils]: 28: Hoare triple {107892#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {107892#false} is VALID [2022-04-08 10:08:50,431 INFO L290 TraceCheckUtils]: 29: Hoare triple {107892#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {107892#false} is VALID [2022-04-08 10:08:50,432 INFO L290 TraceCheckUtils]: 30: Hoare triple {107892#false} assume !(~y~0 % 4294967296 > 0); {107892#false} is VALID [2022-04-08 10:08:50,432 INFO L290 TraceCheckUtils]: 31: Hoare triple {107892#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {107892#false} is VALID [2022-04-08 10:08:50,432 INFO L290 TraceCheckUtils]: 32: Hoare triple {107892#false} assume !(~x~0 % 4294967296 > 0); {107892#false} is VALID [2022-04-08 10:08:50,432 INFO L272 TraceCheckUtils]: 33: Hoare triple {107892#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {107892#false} is VALID [2022-04-08 10:08:50,432 INFO L290 TraceCheckUtils]: 34: Hoare triple {107892#false} ~cond := #in~cond; {107892#false} is VALID [2022-04-08 10:08:50,432 INFO L290 TraceCheckUtils]: 35: Hoare triple {107892#false} assume 0 == ~cond; {107892#false} is VALID [2022-04-08 10:08:50,432 INFO L290 TraceCheckUtils]: 36: Hoare triple {107892#false} assume !false; {107892#false} is VALID [2022-04-08 10:08:50,432 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-04-08 10:08:50,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:08:50,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186017679] [2022-04-08 10:08:50,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186017679] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:08:50,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818868510] [2022-04-08 10:08:50,432 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:08:50,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:50,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:08:50,433 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:08:50,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2022-04-08 10:08:50,486 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:08:50,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:08:50,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 10:08:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:50,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:08:50,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {107891#true} call ULTIMATE.init(); {107891#true} is VALID [2022-04-08 10:08:50,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {107891#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {107891#true} is VALID [2022-04-08 10:08:50,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {107891#true} assume true; {107891#true} is VALID [2022-04-08 10:08:50,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107891#true} {107891#true} #72#return; {107891#true} is VALID [2022-04-08 10:08:50,739 INFO L272 TraceCheckUtils]: 4: Hoare triple {107891#true} call #t~ret13 := main(); {107891#true} is VALID [2022-04-08 10:08:50,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {107891#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {107896#(= main_~y~0 0)} is VALID [2022-04-08 10:08:50,739 INFO L290 TraceCheckUtils]: 6: Hoare triple {107896#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {107897#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:50,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {107897#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {107898#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:50,740 INFO L290 TraceCheckUtils]: 8: Hoare triple {107898#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {107899#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:50,740 INFO L290 TraceCheckUtils]: 9: Hoare triple {107899#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {107900#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:50,741 INFO L290 TraceCheckUtils]: 10: Hoare triple {107900#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {107901#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:50,741 INFO L290 TraceCheckUtils]: 11: Hoare triple {107901#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {107902#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:50,742 INFO L290 TraceCheckUtils]: 12: Hoare triple {107902#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {107903#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:50,742 INFO L290 TraceCheckUtils]: 13: Hoare triple {107903#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {107904#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:50,742 INFO L290 TraceCheckUtils]: 14: Hoare triple {107904#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {107905#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:50,743 INFO L290 TraceCheckUtils]: 15: Hoare triple {107905#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {107906#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:50,743 INFO L290 TraceCheckUtils]: 16: Hoare triple {107906#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {107906#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:50,743 INFO L290 TraceCheckUtils]: 17: Hoare triple {107906#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {107907#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:08:50,744 INFO L290 TraceCheckUtils]: 18: Hoare triple {107907#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {107967#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:08:50,744 INFO L290 TraceCheckUtils]: 19: Hoare triple {107967#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~z~0 % 4294967296 > 0); {107892#false} is VALID [2022-04-08 10:08:50,744 INFO L290 TraceCheckUtils]: 20: Hoare triple {107892#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {107892#false} is VALID [2022-04-08 10:08:50,744 INFO L290 TraceCheckUtils]: 21: Hoare triple {107892#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {107892#false} is VALID [2022-04-08 10:08:50,744 INFO L290 TraceCheckUtils]: 22: Hoare triple {107892#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {107892#false} is VALID [2022-04-08 10:08:50,744 INFO L290 TraceCheckUtils]: 23: Hoare triple {107892#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {107892#false} is VALID [2022-04-08 10:08:50,744 INFO L290 TraceCheckUtils]: 24: Hoare triple {107892#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {107892#false} is VALID [2022-04-08 10:08:50,744 INFO L290 TraceCheckUtils]: 25: Hoare triple {107892#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {107892#false} is VALID [2022-04-08 10:08:50,744 INFO L290 TraceCheckUtils]: 26: Hoare triple {107892#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {107892#false} is VALID [2022-04-08 10:08:50,744 INFO L290 TraceCheckUtils]: 27: Hoare triple {107892#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {107892#false} is VALID [2022-04-08 10:08:50,744 INFO L290 TraceCheckUtils]: 28: Hoare triple {107892#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {107892#false} is VALID [2022-04-08 10:08:50,744 INFO L290 TraceCheckUtils]: 29: Hoare triple {107892#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {107892#false} is VALID [2022-04-08 10:08:50,744 INFO L290 TraceCheckUtils]: 30: Hoare triple {107892#false} assume !(~y~0 % 4294967296 > 0); {107892#false} is VALID [2022-04-08 10:08:50,745 INFO L290 TraceCheckUtils]: 31: Hoare triple {107892#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {107892#false} is VALID [2022-04-08 10:08:50,745 INFO L290 TraceCheckUtils]: 32: Hoare triple {107892#false} assume !(~x~0 % 4294967296 > 0); {107892#false} is VALID [2022-04-08 10:08:50,745 INFO L272 TraceCheckUtils]: 33: Hoare triple {107892#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {107892#false} is VALID [2022-04-08 10:08:50,745 INFO L290 TraceCheckUtils]: 34: Hoare triple {107892#false} ~cond := #in~cond; {107892#false} is VALID [2022-04-08 10:08:50,745 INFO L290 TraceCheckUtils]: 35: Hoare triple {107892#false} assume 0 == ~cond; {107892#false} is VALID [2022-04-08 10:08:50,745 INFO L290 TraceCheckUtils]: 36: Hoare triple {107892#false} assume !false; {107892#false} is VALID [2022-04-08 10:08:50,745 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-04-08 10:08:50,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:08:51,150 INFO L290 TraceCheckUtils]: 36: Hoare triple {107892#false} assume !false; {107892#false} is VALID [2022-04-08 10:08:51,150 INFO L290 TraceCheckUtils]: 35: Hoare triple {107892#false} assume 0 == ~cond; {107892#false} is VALID [2022-04-08 10:08:51,150 INFO L290 TraceCheckUtils]: 34: Hoare triple {107892#false} ~cond := #in~cond; {107892#false} is VALID [2022-04-08 10:08:51,150 INFO L272 TraceCheckUtils]: 33: Hoare triple {107892#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {107892#false} is VALID [2022-04-08 10:08:51,150 INFO L290 TraceCheckUtils]: 32: Hoare triple {107892#false} assume !(~x~0 % 4294967296 > 0); {107892#false} is VALID [2022-04-08 10:08:51,150 INFO L290 TraceCheckUtils]: 31: Hoare triple {107892#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {107892#false} is VALID [2022-04-08 10:08:51,150 INFO L290 TraceCheckUtils]: 30: Hoare triple {107892#false} assume !(~y~0 % 4294967296 > 0); {107892#false} is VALID [2022-04-08 10:08:51,150 INFO L290 TraceCheckUtils]: 29: Hoare triple {107892#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {107892#false} is VALID [2022-04-08 10:08:51,150 INFO L290 TraceCheckUtils]: 28: Hoare triple {107892#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {107892#false} is VALID [2022-04-08 10:08:51,150 INFO L290 TraceCheckUtils]: 27: Hoare triple {107892#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {107892#false} is VALID [2022-04-08 10:08:51,150 INFO L290 TraceCheckUtils]: 26: Hoare triple {107892#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {107892#false} is VALID [2022-04-08 10:08:51,150 INFO L290 TraceCheckUtils]: 25: Hoare triple {107892#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {107892#false} is VALID [2022-04-08 10:08:51,150 INFO L290 TraceCheckUtils]: 24: Hoare triple {107892#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {107892#false} is VALID [2022-04-08 10:08:51,150 INFO L290 TraceCheckUtils]: 23: Hoare triple {107892#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {107892#false} is VALID [2022-04-08 10:08:51,150 INFO L290 TraceCheckUtils]: 22: Hoare triple {107892#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {107892#false} is VALID [2022-04-08 10:08:51,151 INFO L290 TraceCheckUtils]: 21: Hoare triple {107892#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {107892#false} is VALID [2022-04-08 10:08:51,151 INFO L290 TraceCheckUtils]: 20: Hoare triple {107892#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {107892#false} is VALID [2022-04-08 10:08:51,151 INFO L290 TraceCheckUtils]: 19: Hoare triple {108073#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {107892#false} is VALID [2022-04-08 10:08:51,152 INFO L290 TraceCheckUtils]: 18: Hoare triple {108077#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {108073#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:08:51,152 INFO L290 TraceCheckUtils]: 17: Hoare triple {108081#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {108077#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:08:51,152 INFO L290 TraceCheckUtils]: 16: Hoare triple {108081#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {108081#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:08:51,153 INFO L290 TraceCheckUtils]: 15: Hoare triple {108088#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108081#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:08:51,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {108092#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108088#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:08:51,154 INFO L290 TraceCheckUtils]: 13: Hoare triple {108096#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108092#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:08:51,155 INFO L290 TraceCheckUtils]: 12: Hoare triple {108100#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108096#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:08:51,155 INFO L290 TraceCheckUtils]: 11: Hoare triple {108104#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108100#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:08:51,156 INFO L290 TraceCheckUtils]: 10: Hoare triple {108108#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108104#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:08:51,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {108112#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108108#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:51,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {108116#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108112#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:08:51,158 INFO L290 TraceCheckUtils]: 7: Hoare triple {108120#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108116#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:08:51,158 INFO L290 TraceCheckUtils]: 6: Hoare triple {108124#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {108120#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:08:51,158 INFO L290 TraceCheckUtils]: 5: Hoare triple {107891#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {108124#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:08:51,158 INFO L272 TraceCheckUtils]: 4: Hoare triple {107891#true} call #t~ret13 := main(); {107891#true} is VALID [2022-04-08 10:08:51,159 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107891#true} {107891#true} #72#return; {107891#true} is VALID [2022-04-08 10:08:51,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {107891#true} assume true; {107891#true} is VALID [2022-04-08 10:08:51,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {107891#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {107891#true} is VALID [2022-04-08 10:08:51,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {107891#true} call ULTIMATE.init(); {107891#true} is VALID [2022-04-08 10:08:51,159 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-04-08 10:08:51,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818868510] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:08:51,159 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:08:51,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-08 10:08:51,159 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:08:51,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1609375006] [2022-04-08 10:08:51,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1609375006] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:08:51,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:08:51,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 10:08:51,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253295369] [2022-04-08 10:08:51,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:08:51,160 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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 37 [2022-04-08 10:08:51,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:08:51,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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-08 10:08:51,175 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-08 10:08:51,175 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 10:08:51,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:51,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 10:08:51,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=686, Unknown=0, NotChecked=0, Total=870 [2022-04-08 10:08:51,175 INFO L87 Difference]: Start difference. First operand 400 states and 542 transitions. Second operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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-08 10:08:55,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:55,052 INFO L93 Difference]: Finished difference Result 548 states and 700 transitions. [2022-04-08 10:08:55,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-08 10:08:55,052 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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 37 [2022-04-08 10:08:55,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:08:55,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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-08 10:08:55,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 106 transitions. [2022-04-08 10:08:55,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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-08 10:08:55,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 106 transitions. [2022-04-08 10:08:55,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 106 transitions. [2022-04-08 10:08:55,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:55,120 INFO L225 Difference]: With dead ends: 548 [2022-04-08 10:08:55,120 INFO L226 Difference]: Without dead ends: 530 [2022-04-08 10:08:55,120 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=406, Invalid=1486, Unknown=0, NotChecked=0, Total=1892 [2022-04-08 10:08:55,120 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 63 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:08:55,121 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 113 Invalid, 1080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1029 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 10:08:55,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2022-04-08 10:08:56,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 400. [2022-04-08 10:08:56,348 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:08:56,348 INFO L82 GeneralOperation]: Start isEquivalent. First operand 530 states. Second operand has 400 states, 395 states have (on average 1.3594936708860759) internal successors, (537), 395 states have internal predecessors, (537), 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-08 10:08:56,348 INFO L74 IsIncluded]: Start isIncluded. First operand 530 states. Second operand has 400 states, 395 states have (on average 1.3594936708860759) internal successors, (537), 395 states have internal predecessors, (537), 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-08 10:08:56,348 INFO L87 Difference]: Start difference. First operand 530 states. Second operand has 400 states, 395 states have (on average 1.3594936708860759) internal successors, (537), 395 states have internal predecessors, (537), 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-08 10:08:56,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:56,357 INFO L93 Difference]: Finished difference Result 530 states and 682 transitions. [2022-04-08 10:08:56,357 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 682 transitions. [2022-04-08 10:08:56,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:56,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:56,357 INFO L74 IsIncluded]: Start isIncluded. First operand has 400 states, 395 states have (on average 1.3594936708860759) internal successors, (537), 395 states have internal predecessors, (537), 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 530 states. [2022-04-08 10:08:56,357 INFO L87 Difference]: Start difference. First operand has 400 states, 395 states have (on average 1.3594936708860759) internal successors, (537), 395 states have internal predecessors, (537), 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 530 states. [2022-04-08 10:08:56,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:08:56,366 INFO L93 Difference]: Finished difference Result 530 states and 682 transitions. [2022-04-08 10:08:56,366 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 682 transitions. [2022-04-08 10:08:56,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:08:56,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:08:56,366 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:08:56,366 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:08:56,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 395 states have (on average 1.3594936708860759) internal successors, (537), 395 states have internal predecessors, (537), 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-08 10:08:56,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 541 transitions. [2022-04-08 10:08:56,373 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 541 transitions. Word has length 37 [2022-04-08 10:08:56,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:08:56,373 INFO L478 AbstractCegarLoop]: Abstraction has 400 states and 541 transitions. [2022-04-08 10:08:56,373 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 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-08 10:08:56,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 400 states and 541 transitions. [2022-04-08 10:08:58,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 541 edges. 541 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:08:58,910 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 541 transitions. [2022-04-08 10:08:58,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 10:08:58,910 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:08:58,910 INFO L499 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:08:58,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Forceful destruction successful, exit code 0 [2022-04-08 10:08:59,110 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2022-04-08 10:08:59,111 INFO L403 AbstractCegarLoop]: === Iteration 70 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:08:59,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:08:59,111 INFO L85 PathProgramCache]: Analyzing trace with hash -632235336, now seen corresponding path program 43 times [2022-04-08 10:08:59,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:08:59,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [655674349] [2022-04-08 10:08:59,113 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:08:59,113 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:08:59,113 INFO L85 PathProgramCache]: Analyzing trace with hash -632235336, now seen corresponding path program 44 times [2022-04-08 10:08:59,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:08:59,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271965930] [2022-04-08 10:08:59,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:08:59,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:08:59,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:59,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:08:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:59,611 INFO L290 TraceCheckUtils]: 0: Hoare triple {111158#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {111129#true} is VALID [2022-04-08 10:08:59,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {111129#true} assume true; {111129#true} is VALID [2022-04-08 10:08:59,611 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {111129#true} {111129#true} #72#return; {111129#true} is VALID [2022-04-08 10:08:59,612 INFO L272 TraceCheckUtils]: 0: Hoare triple {111129#true} call ULTIMATE.init(); {111158#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:08:59,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {111158#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {111129#true} is VALID [2022-04-08 10:08:59,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {111129#true} assume true; {111129#true} is VALID [2022-04-08 10:08:59,612 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111129#true} {111129#true} #72#return; {111129#true} is VALID [2022-04-08 10:08:59,612 INFO L272 TraceCheckUtils]: 4: Hoare triple {111129#true} call #t~ret13 := main(); {111129#true} is VALID [2022-04-08 10:08:59,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {111129#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {111134#(= main_~y~0 0)} is VALID [2022-04-08 10:08:59,613 INFO L290 TraceCheckUtils]: 6: Hoare triple {111134#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111135#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:59,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {111135#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111136#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:59,614 INFO L290 TraceCheckUtils]: 8: Hoare triple {111136#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111137#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:59,614 INFO L290 TraceCheckUtils]: 9: Hoare triple {111137#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111138#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:59,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {111138#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111139#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:59,615 INFO L290 TraceCheckUtils]: 11: Hoare triple {111139#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111140#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:59,616 INFO L290 TraceCheckUtils]: 12: Hoare triple {111140#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111141#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:59,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {111141#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111142#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:59,617 INFO L290 TraceCheckUtils]: 14: Hoare triple {111142#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111143#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:59,617 INFO L290 TraceCheckUtils]: 15: Hoare triple {111143#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111144#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:59,618 INFO L290 TraceCheckUtils]: 16: Hoare triple {111144#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111145#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:59,618 INFO L290 TraceCheckUtils]: 17: Hoare triple {111145#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111146#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:08:59,619 INFO L290 TraceCheckUtils]: 18: Hoare triple {111146#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111147#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:08:59,619 INFO L290 TraceCheckUtils]: 19: Hoare triple {111147#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111148#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:08:59,620 INFO L290 TraceCheckUtils]: 20: Hoare triple {111148#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111149#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:08:59,620 INFO L290 TraceCheckUtils]: 21: Hoare triple {111149#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111150#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:08:59,621 INFO L290 TraceCheckUtils]: 22: Hoare triple {111150#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111151#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:08:59,621 INFO L290 TraceCheckUtils]: 23: Hoare triple {111151#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111152#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:08:59,622 INFO L290 TraceCheckUtils]: 24: Hoare triple {111152#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111153#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:08:59,622 INFO L290 TraceCheckUtils]: 25: Hoare triple {111153#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111154#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:08:59,623 INFO L290 TraceCheckUtils]: 26: Hoare triple {111154#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111155#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:08:59,623 INFO L290 TraceCheckUtils]: 27: Hoare triple {111155#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111156#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:08:59,623 INFO L290 TraceCheckUtils]: 28: Hoare triple {111156#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {111156#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:08:59,624 INFO L290 TraceCheckUtils]: 29: Hoare triple {111156#(and (<= main_~y~0 22) (<= 22 main_~y~0))} ~z~0 := ~y~0; {111157#(and (<= 22 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:08:59,624 INFO L290 TraceCheckUtils]: 30: Hoare triple {111157#(and (<= 22 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {111130#false} is VALID [2022-04-08 10:08:59,624 INFO L290 TraceCheckUtils]: 31: Hoare triple {111130#false} assume !(~y~0 % 4294967296 > 0); {111130#false} is VALID [2022-04-08 10:08:59,624 INFO L290 TraceCheckUtils]: 32: Hoare triple {111130#false} assume !(~x~0 % 4294967296 > 0); {111130#false} is VALID [2022-04-08 10:08:59,624 INFO L272 TraceCheckUtils]: 33: Hoare triple {111130#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {111130#false} is VALID [2022-04-08 10:08:59,624 INFO L290 TraceCheckUtils]: 34: Hoare triple {111130#false} ~cond := #in~cond; {111130#false} is VALID [2022-04-08 10:08:59,625 INFO L290 TraceCheckUtils]: 35: Hoare triple {111130#false} assume 0 == ~cond; {111130#false} is VALID [2022-04-08 10:08:59,625 INFO L290 TraceCheckUtils]: 36: Hoare triple {111130#false} assume !false; {111130#false} is VALID [2022-04-08 10:08:59,625 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:08:59,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:08:59,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271965930] [2022-04-08 10:08:59,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271965930] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:08:59,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890094492] [2022-04-08 10:08:59,625 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:08:59,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:08:59,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:08:59,626 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:08:59,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2022-04-08 10:08:59,687 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:08:59,687 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:08:59,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-08 10:08:59,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:08:59,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:08:59,978 INFO L272 TraceCheckUtils]: 0: Hoare triple {111129#true} call ULTIMATE.init(); {111129#true} is VALID [2022-04-08 10:08:59,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {111129#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {111129#true} is VALID [2022-04-08 10:08:59,979 INFO L290 TraceCheckUtils]: 2: Hoare triple {111129#true} assume true; {111129#true} is VALID [2022-04-08 10:08:59,979 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111129#true} {111129#true} #72#return; {111129#true} is VALID [2022-04-08 10:08:59,979 INFO L272 TraceCheckUtils]: 4: Hoare triple {111129#true} call #t~ret13 := main(); {111129#true} is VALID [2022-04-08 10:08:59,979 INFO L290 TraceCheckUtils]: 5: Hoare triple {111129#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {111134#(= main_~y~0 0)} is VALID [2022-04-08 10:08:59,979 INFO L290 TraceCheckUtils]: 6: Hoare triple {111134#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111135#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:08:59,980 INFO L290 TraceCheckUtils]: 7: Hoare triple {111135#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111136#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:08:59,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {111136#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111137#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:08:59,981 INFO L290 TraceCheckUtils]: 9: Hoare triple {111137#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111138#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:08:59,981 INFO L290 TraceCheckUtils]: 10: Hoare triple {111138#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111139#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:08:59,981 INFO L290 TraceCheckUtils]: 11: Hoare triple {111139#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111140#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:08:59,982 INFO L290 TraceCheckUtils]: 12: Hoare triple {111140#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111141#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:08:59,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {111141#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111142#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:08:59,983 INFO L290 TraceCheckUtils]: 14: Hoare triple {111142#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111143#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:08:59,983 INFO L290 TraceCheckUtils]: 15: Hoare triple {111143#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111144#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:08:59,984 INFO L290 TraceCheckUtils]: 16: Hoare triple {111144#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111145#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:08:59,984 INFO L290 TraceCheckUtils]: 17: Hoare triple {111145#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111146#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:08:59,984 INFO L290 TraceCheckUtils]: 18: Hoare triple {111146#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111147#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:08:59,985 INFO L290 TraceCheckUtils]: 19: Hoare triple {111147#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111148#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:08:59,985 INFO L290 TraceCheckUtils]: 20: Hoare triple {111148#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111149#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:08:59,986 INFO L290 TraceCheckUtils]: 21: Hoare triple {111149#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111150#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:08:59,986 INFO L290 TraceCheckUtils]: 22: Hoare triple {111150#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111151#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:08:59,987 INFO L290 TraceCheckUtils]: 23: Hoare triple {111151#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111152#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:08:59,987 INFO L290 TraceCheckUtils]: 24: Hoare triple {111152#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111153#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:08:59,988 INFO L290 TraceCheckUtils]: 25: Hoare triple {111153#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111154#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:08:59,988 INFO L290 TraceCheckUtils]: 26: Hoare triple {111154#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111155#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:08:59,988 INFO L290 TraceCheckUtils]: 27: Hoare triple {111155#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111156#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:08:59,989 INFO L290 TraceCheckUtils]: 28: Hoare triple {111156#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {111156#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:08:59,989 INFO L290 TraceCheckUtils]: 29: Hoare triple {111156#(and (<= main_~y~0 22) (<= 22 main_~y~0))} ~z~0 := ~y~0; {111249#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-08 10:08:59,989 INFO L290 TraceCheckUtils]: 30: Hoare triple {111249#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !(~z~0 % 4294967296 > 0); {111130#false} is VALID [2022-04-08 10:08:59,989 INFO L290 TraceCheckUtils]: 31: Hoare triple {111130#false} assume !(~y~0 % 4294967296 > 0); {111130#false} is VALID [2022-04-08 10:08:59,989 INFO L290 TraceCheckUtils]: 32: Hoare triple {111130#false} assume !(~x~0 % 4294967296 > 0); {111130#false} is VALID [2022-04-08 10:08:59,989 INFO L272 TraceCheckUtils]: 33: Hoare triple {111130#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {111130#false} is VALID [2022-04-08 10:08:59,989 INFO L290 TraceCheckUtils]: 34: Hoare triple {111130#false} ~cond := #in~cond; {111130#false} is VALID [2022-04-08 10:08:59,990 INFO L290 TraceCheckUtils]: 35: Hoare triple {111130#false} assume 0 == ~cond; {111130#false} is VALID [2022-04-08 10:08:59,990 INFO L290 TraceCheckUtils]: 36: Hoare triple {111130#false} assume !false; {111130#false} is VALID [2022-04-08 10:08:59,990 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:08:59,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:09:00,894 INFO L290 TraceCheckUtils]: 36: Hoare triple {111130#false} assume !false; {111130#false} is VALID [2022-04-08 10:09:00,894 INFO L290 TraceCheckUtils]: 35: Hoare triple {111130#false} assume 0 == ~cond; {111130#false} is VALID [2022-04-08 10:09:00,894 INFO L290 TraceCheckUtils]: 34: Hoare triple {111130#false} ~cond := #in~cond; {111130#false} is VALID [2022-04-08 10:09:00,894 INFO L272 TraceCheckUtils]: 33: Hoare triple {111130#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {111130#false} is VALID [2022-04-08 10:09:00,894 INFO L290 TraceCheckUtils]: 32: Hoare triple {111130#false} assume !(~x~0 % 4294967296 > 0); {111130#false} is VALID [2022-04-08 10:09:00,894 INFO L290 TraceCheckUtils]: 31: Hoare triple {111130#false} assume !(~y~0 % 4294967296 > 0); {111130#false} is VALID [2022-04-08 10:09:00,895 INFO L290 TraceCheckUtils]: 30: Hoare triple {111289#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {111130#false} is VALID [2022-04-08 10:09:00,895 INFO L290 TraceCheckUtils]: 29: Hoare triple {111293#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {111289#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:09:00,895 INFO L290 TraceCheckUtils]: 28: Hoare triple {111293#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {111293#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:09:00,896 INFO L290 TraceCheckUtils]: 27: Hoare triple {111300#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111293#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:09:00,897 INFO L290 TraceCheckUtils]: 26: Hoare triple {111304#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111300#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:09:00,897 INFO L290 TraceCheckUtils]: 25: Hoare triple {111308#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111304#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:09:00,898 INFO L290 TraceCheckUtils]: 24: Hoare triple {111312#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111308#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:09:00,898 INFO L290 TraceCheckUtils]: 23: Hoare triple {111316#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111312#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:09:00,899 INFO L290 TraceCheckUtils]: 22: Hoare triple {111320#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111316#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:00,900 INFO L290 TraceCheckUtils]: 21: Hoare triple {111324#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111320#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:09:00,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {111328#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111324#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:00,901 INFO L290 TraceCheckUtils]: 19: Hoare triple {111332#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111328#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:09:00,901 INFO L290 TraceCheckUtils]: 18: Hoare triple {111336#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111332#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:09:00,902 INFO L290 TraceCheckUtils]: 17: Hoare triple {111340#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111336#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:09:00,903 INFO L290 TraceCheckUtils]: 16: Hoare triple {111344#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111340#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:09:00,903 INFO L290 TraceCheckUtils]: 15: Hoare triple {111348#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111344#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:09:00,904 INFO L290 TraceCheckUtils]: 14: Hoare triple {111352#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111348#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:09:00,905 INFO L290 TraceCheckUtils]: 13: Hoare triple {111356#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111352#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:09:00,905 INFO L290 TraceCheckUtils]: 12: Hoare triple {111360#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111356#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:09:00,906 INFO L290 TraceCheckUtils]: 11: Hoare triple {111364#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111360#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:09:00,906 INFO L290 TraceCheckUtils]: 10: Hoare triple {111368#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111364#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:09:00,907 INFO L290 TraceCheckUtils]: 9: Hoare triple {111372#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111368#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-08 10:09:00,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {111376#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111372#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:00,908 INFO L290 TraceCheckUtils]: 7: Hoare triple {111380#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111376#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-08 10:09:00,909 INFO L290 TraceCheckUtils]: 6: Hoare triple {111384#(< 0 (mod (+ main_~y~0 22) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {111380#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-08 10:09:00,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {111129#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {111384#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-08 10:09:00,909 INFO L272 TraceCheckUtils]: 4: Hoare triple {111129#true} call #t~ret13 := main(); {111129#true} is VALID [2022-04-08 10:09:00,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111129#true} {111129#true} #72#return; {111129#true} is VALID [2022-04-08 10:09:00,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {111129#true} assume true; {111129#true} is VALID [2022-04-08 10:09:00,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {111129#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {111129#true} is VALID [2022-04-08 10:09:00,909 INFO L272 TraceCheckUtils]: 0: Hoare triple {111129#true} call ULTIMATE.init(); {111129#true} is VALID [2022-04-08 10:09:00,910 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:09:00,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890094492] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:09:00,910 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:09:00,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 52 [2022-04-08 10:09:00,910 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:09:00,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [655674349] [2022-04-08 10:09:00,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [655674349] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:09:00,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:09:00,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-08 10:09:00,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390355932] [2022-04-08 10:09:00,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:09:00,910 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 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 37 [2022-04-08 10:09:00,911 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:09:00,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 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-08 10:09:00,940 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-08 10:09:00,940 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-08 10:09:00,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:00,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-08 10:09:00,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=2020, Unknown=0, NotChecked=0, Total=2652 [2022-04-08 10:09:00,941 INFO L87 Difference]: Start difference. First operand 400 states and 541 transitions. Second operand has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 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-08 10:09:11,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:11,043 INFO L93 Difference]: Finished difference Result 702 states and 1069 transitions. [2022-04-08 10:09:11,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-08 10:09:11,043 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 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 37 [2022-04-08 10:09:11,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:09:11,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 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-08 10:09:11,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 235 transitions. [2022-04-08 10:09:11,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 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-08 10:09:11,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 235 transitions. [2022-04-08 10:09:11,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 235 transitions. [2022-04-08 10:09:11,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:11,184 INFO L225 Difference]: With dead ends: 702 [2022-04-08 10:09:11,184 INFO L226 Difference]: Without dead ends: 674 [2022-04-08 10:09:11,185 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1282, Invalid=4418, Unknown=0, NotChecked=0, Total=5700 [2022-04-08 10:09:11,185 INFO L913 BasicCegarLoop]: 107 mSDtfsCounter, 173 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 4465 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 4588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 4465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:09:11,185 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 229 Invalid, 4588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 4465 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-08 10:09:11,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2022-04-08 10:09:12,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 419. [2022-04-08 10:09:12,442 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:09:12,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 674 states. Second operand has 419 states, 414 states have (on average 1.3647342995169083) internal successors, (565), 414 states have internal predecessors, (565), 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-08 10:09:12,443 INFO L74 IsIncluded]: Start isIncluded. First operand 674 states. Second operand has 419 states, 414 states have (on average 1.3647342995169083) internal successors, (565), 414 states have internal predecessors, (565), 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-08 10:09:12,443 INFO L87 Difference]: Start difference. First operand 674 states. Second operand has 419 states, 414 states have (on average 1.3647342995169083) internal successors, (565), 414 states have internal predecessors, (565), 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-08 10:09:12,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:12,455 INFO L93 Difference]: Finished difference Result 674 states and 847 transitions. [2022-04-08 10:09:12,455 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 847 transitions. [2022-04-08 10:09:12,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:12,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:12,456 INFO L74 IsIncluded]: Start isIncluded. First operand has 419 states, 414 states have (on average 1.3647342995169083) internal successors, (565), 414 states have internal predecessors, (565), 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 674 states. [2022-04-08 10:09:12,456 INFO L87 Difference]: Start difference. First operand has 419 states, 414 states have (on average 1.3647342995169083) internal successors, (565), 414 states have internal predecessors, (565), 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 674 states. [2022-04-08 10:09:12,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:12,468 INFO L93 Difference]: Finished difference Result 674 states and 847 transitions. [2022-04-08 10:09:12,468 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 847 transitions. [2022-04-08 10:09:12,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:12,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:12,468 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:09:12,468 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:09:12,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 414 states have (on average 1.3647342995169083) internal successors, (565), 414 states have internal predecessors, (565), 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-08 10:09:12,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 569 transitions. [2022-04-08 10:09:12,476 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 569 transitions. Word has length 37 [2022-04-08 10:09:12,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:09:12,476 INFO L478 AbstractCegarLoop]: Abstraction has 419 states and 569 transitions. [2022-04-08 10:09:12,476 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 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-08 10:09:12,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 419 states and 569 transitions. [2022-04-08 10:09:15,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 569 edges. 569 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:15,182 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 569 transitions. [2022-04-08 10:09:15,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-08 10:09:15,182 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:09:15,182 INFO L499 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:09:15,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Forceful destruction successful, exit code 0 [2022-04-08 10:09:15,388 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2022-04-08 10:09:15,388 INFO L403 AbstractCegarLoop]: === Iteration 71 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:09:15,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:09:15,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1382721279, now seen corresponding path program 45 times [2022-04-08 10:09:15,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:15,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [627003634] [2022-04-08 10:09:15,391 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:09:15,391 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:09:15,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1382721279, now seen corresponding path program 46 times [2022-04-08 10:09:15,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:09:15,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230200173] [2022-04-08 10:09:15,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:09:15,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:09:15,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:15,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:09:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:15,814 INFO L290 TraceCheckUtils]: 0: Hoare triple {115073#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {115043#true} is VALID [2022-04-08 10:09:15,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {115043#true} assume true; {115043#true} is VALID [2022-04-08 10:09:15,814 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {115043#true} {115043#true} #72#return; {115043#true} is VALID [2022-04-08 10:09:15,815 INFO L272 TraceCheckUtils]: 0: Hoare triple {115043#true} call ULTIMATE.init(); {115073#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:09:15,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {115073#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {115043#true} is VALID [2022-04-08 10:09:15,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {115043#true} assume true; {115043#true} is VALID [2022-04-08 10:09:15,815 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {115043#true} {115043#true} #72#return; {115043#true} is VALID [2022-04-08 10:09:15,815 INFO L272 TraceCheckUtils]: 4: Hoare triple {115043#true} call #t~ret13 := main(); {115043#true} is VALID [2022-04-08 10:09:15,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {115043#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {115048#(= main_~y~0 0)} is VALID [2022-04-08 10:09:15,816 INFO L290 TraceCheckUtils]: 6: Hoare triple {115048#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115049#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:15,816 INFO L290 TraceCheckUtils]: 7: Hoare triple {115049#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115050#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:15,817 INFO L290 TraceCheckUtils]: 8: Hoare triple {115050#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115051#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:15,817 INFO L290 TraceCheckUtils]: 9: Hoare triple {115051#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115052#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:15,818 INFO L290 TraceCheckUtils]: 10: Hoare triple {115052#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115053#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:15,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {115053#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115054#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:15,819 INFO L290 TraceCheckUtils]: 12: Hoare triple {115054#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115055#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:15,819 INFO L290 TraceCheckUtils]: 13: Hoare triple {115055#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115056#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:15,820 INFO L290 TraceCheckUtils]: 14: Hoare triple {115056#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115057#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:09:15,820 INFO L290 TraceCheckUtils]: 15: Hoare triple {115057#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115058#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:15,821 INFO L290 TraceCheckUtils]: 16: Hoare triple {115058#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115059#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:15,821 INFO L290 TraceCheckUtils]: 17: Hoare triple {115059#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115060#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:09:15,822 INFO L290 TraceCheckUtils]: 18: Hoare triple {115060#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115061#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:09:15,822 INFO L290 TraceCheckUtils]: 19: Hoare triple {115061#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115062#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:09:15,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {115062#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115063#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:09:15,823 INFO L290 TraceCheckUtils]: 21: Hoare triple {115063#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115064#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:09:15,824 INFO L290 TraceCheckUtils]: 22: Hoare triple {115064#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115065#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:09:15,824 INFO L290 TraceCheckUtils]: 23: Hoare triple {115065#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115066#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:09:15,825 INFO L290 TraceCheckUtils]: 24: Hoare triple {115066#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115067#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:09:15,825 INFO L290 TraceCheckUtils]: 25: Hoare triple {115067#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115068#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:09:15,825 INFO L290 TraceCheckUtils]: 26: Hoare triple {115068#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115069#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:09:15,826 INFO L290 TraceCheckUtils]: 27: Hoare triple {115069#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115070#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:09:15,826 INFO L290 TraceCheckUtils]: 28: Hoare triple {115070#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115071#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:09:15,827 INFO L290 TraceCheckUtils]: 29: Hoare triple {115071#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {115071#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:09:15,827 INFO L290 TraceCheckUtils]: 30: Hoare triple {115071#(and (<= main_~y~0 23) (<= 23 main_~y~0))} ~z~0 := ~y~0; {115072#(and (<= (div main_~z~0 4294967296) 0) (<= 23 main_~z~0))} is VALID [2022-04-08 10:09:15,828 INFO L290 TraceCheckUtils]: 31: Hoare triple {115072#(and (<= (div main_~z~0 4294967296) 0) (<= 23 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {115044#false} is VALID [2022-04-08 10:09:15,828 INFO L290 TraceCheckUtils]: 32: Hoare triple {115044#false} assume !(~y~0 % 4294967296 > 0); {115044#false} is VALID [2022-04-08 10:09:15,828 INFO L290 TraceCheckUtils]: 33: Hoare triple {115044#false} assume !(~x~0 % 4294967296 > 0); {115044#false} is VALID [2022-04-08 10:09:15,828 INFO L272 TraceCheckUtils]: 34: Hoare triple {115044#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {115044#false} is VALID [2022-04-08 10:09:15,828 INFO L290 TraceCheckUtils]: 35: Hoare triple {115044#false} ~cond := #in~cond; {115044#false} is VALID [2022-04-08 10:09:15,828 INFO L290 TraceCheckUtils]: 36: Hoare triple {115044#false} assume 0 == ~cond; {115044#false} is VALID [2022-04-08 10:09:15,828 INFO L290 TraceCheckUtils]: 37: Hoare triple {115044#false} assume !false; {115044#false} is VALID [2022-04-08 10:09:15,828 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:09:15,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:09:15,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230200173] [2022-04-08 10:09:15,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230200173] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:09:15,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402158790] [2022-04-08 10:09:15,828 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:09:15,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:15,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:09:15,829 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:09:15,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2022-04-08 10:09:15,892 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:09:15,892 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:09:15,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-08 10:09:15,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:15,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:09:16,269 INFO L272 TraceCheckUtils]: 0: Hoare triple {115043#true} call ULTIMATE.init(); {115043#true} is VALID [2022-04-08 10:09:16,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {115043#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {115043#true} is VALID [2022-04-08 10:09:16,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {115043#true} assume true; {115043#true} is VALID [2022-04-08 10:09:16,269 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {115043#true} {115043#true} #72#return; {115043#true} is VALID [2022-04-08 10:09:16,269 INFO L272 TraceCheckUtils]: 4: Hoare triple {115043#true} call #t~ret13 := main(); {115043#true} is VALID [2022-04-08 10:09:16,270 INFO L290 TraceCheckUtils]: 5: Hoare triple {115043#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {115048#(= main_~y~0 0)} is VALID [2022-04-08 10:09:16,270 INFO L290 TraceCheckUtils]: 6: Hoare triple {115048#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115049#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:16,271 INFO L290 TraceCheckUtils]: 7: Hoare triple {115049#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115050#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:16,271 INFO L290 TraceCheckUtils]: 8: Hoare triple {115050#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115051#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:16,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {115051#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115052#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:16,272 INFO L290 TraceCheckUtils]: 10: Hoare triple {115052#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115053#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:16,273 INFO L290 TraceCheckUtils]: 11: Hoare triple {115053#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115054#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:16,273 INFO L290 TraceCheckUtils]: 12: Hoare triple {115054#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115055#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:16,274 INFO L290 TraceCheckUtils]: 13: Hoare triple {115055#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115056#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:16,274 INFO L290 TraceCheckUtils]: 14: Hoare triple {115056#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115057#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:09:16,275 INFO L290 TraceCheckUtils]: 15: Hoare triple {115057#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115058#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:09:16,275 INFO L290 TraceCheckUtils]: 16: Hoare triple {115058#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115059#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:09:16,276 INFO L290 TraceCheckUtils]: 17: Hoare triple {115059#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115060#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:09:16,276 INFO L290 TraceCheckUtils]: 18: Hoare triple {115060#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115061#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:09:16,277 INFO L290 TraceCheckUtils]: 19: Hoare triple {115061#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115062#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:09:16,277 INFO L290 TraceCheckUtils]: 20: Hoare triple {115062#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115063#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:09:16,278 INFO L290 TraceCheckUtils]: 21: Hoare triple {115063#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115064#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:09:16,278 INFO L290 TraceCheckUtils]: 22: Hoare triple {115064#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115065#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:09:16,279 INFO L290 TraceCheckUtils]: 23: Hoare triple {115065#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115066#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:09:16,279 INFO L290 TraceCheckUtils]: 24: Hoare triple {115066#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115067#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:09:16,280 INFO L290 TraceCheckUtils]: 25: Hoare triple {115067#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115068#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:09:16,280 INFO L290 TraceCheckUtils]: 26: Hoare triple {115068#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115069#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:09:16,281 INFO L290 TraceCheckUtils]: 27: Hoare triple {115069#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115070#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:09:16,281 INFO L290 TraceCheckUtils]: 28: Hoare triple {115070#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115071#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:09:16,282 INFO L290 TraceCheckUtils]: 29: Hoare triple {115071#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {115071#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:09:16,282 INFO L290 TraceCheckUtils]: 30: Hoare triple {115071#(and (<= main_~y~0 23) (<= 23 main_~y~0))} ~z~0 := ~y~0; {115167#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-08 10:09:16,282 INFO L290 TraceCheckUtils]: 31: Hoare triple {115167#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !(~z~0 % 4294967296 > 0); {115044#false} is VALID [2022-04-08 10:09:16,282 INFO L290 TraceCheckUtils]: 32: Hoare triple {115044#false} assume !(~y~0 % 4294967296 > 0); {115044#false} is VALID [2022-04-08 10:09:16,283 INFO L290 TraceCheckUtils]: 33: Hoare triple {115044#false} assume !(~x~0 % 4294967296 > 0); {115044#false} is VALID [2022-04-08 10:09:16,283 INFO L272 TraceCheckUtils]: 34: Hoare triple {115044#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {115044#false} is VALID [2022-04-08 10:09:16,283 INFO L290 TraceCheckUtils]: 35: Hoare triple {115044#false} ~cond := #in~cond; {115044#false} is VALID [2022-04-08 10:09:16,283 INFO L290 TraceCheckUtils]: 36: Hoare triple {115044#false} assume 0 == ~cond; {115044#false} is VALID [2022-04-08 10:09:16,283 INFO L290 TraceCheckUtils]: 37: Hoare triple {115044#false} assume !false; {115044#false} is VALID [2022-04-08 10:09:16,283 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:09:16,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:09:17,108 INFO L290 TraceCheckUtils]: 37: Hoare triple {115044#false} assume !false; {115044#false} is VALID [2022-04-08 10:09:17,109 INFO L290 TraceCheckUtils]: 36: Hoare triple {115044#false} assume 0 == ~cond; {115044#false} is VALID [2022-04-08 10:09:17,109 INFO L290 TraceCheckUtils]: 35: Hoare triple {115044#false} ~cond := #in~cond; {115044#false} is VALID [2022-04-08 10:09:17,109 INFO L272 TraceCheckUtils]: 34: Hoare triple {115044#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {115044#false} is VALID [2022-04-08 10:09:17,109 INFO L290 TraceCheckUtils]: 33: Hoare triple {115044#false} assume !(~x~0 % 4294967296 > 0); {115044#false} is VALID [2022-04-08 10:09:17,109 INFO L290 TraceCheckUtils]: 32: Hoare triple {115044#false} assume !(~y~0 % 4294967296 > 0); {115044#false} is VALID [2022-04-08 10:09:17,109 INFO L290 TraceCheckUtils]: 31: Hoare triple {115207#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {115044#false} is VALID [2022-04-08 10:09:17,109 INFO L290 TraceCheckUtils]: 30: Hoare triple {115211#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {115207#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:09:17,110 INFO L290 TraceCheckUtils]: 29: Hoare triple {115211#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {115211#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:09:17,110 INFO L290 TraceCheckUtils]: 28: Hoare triple {115218#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115211#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:09:17,111 INFO L290 TraceCheckUtils]: 27: Hoare triple {115222#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115218#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:09:17,111 INFO L290 TraceCheckUtils]: 26: Hoare triple {115226#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115222#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:09:17,112 INFO L290 TraceCheckUtils]: 25: Hoare triple {115230#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115226#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:09:17,113 INFO L290 TraceCheckUtils]: 24: Hoare triple {115234#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115230#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:09:17,113 INFO L290 TraceCheckUtils]: 23: Hoare triple {115238#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115234#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:17,114 INFO L290 TraceCheckUtils]: 22: Hoare triple {115242#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115238#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:09:17,114 INFO L290 TraceCheckUtils]: 21: Hoare triple {115246#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115242#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:17,115 INFO L290 TraceCheckUtils]: 20: Hoare triple {115250#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115246#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:09:17,115 INFO L290 TraceCheckUtils]: 19: Hoare triple {115254#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115250#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:09:17,116 INFO L290 TraceCheckUtils]: 18: Hoare triple {115258#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115254#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:09:17,117 INFO L290 TraceCheckUtils]: 17: Hoare triple {115262#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115258#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:09:17,117 INFO L290 TraceCheckUtils]: 16: Hoare triple {115266#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115262#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:09:17,118 INFO L290 TraceCheckUtils]: 15: Hoare triple {115270#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115266#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:09:17,118 INFO L290 TraceCheckUtils]: 14: Hoare triple {115274#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115270#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:09:17,119 INFO L290 TraceCheckUtils]: 13: Hoare triple {115278#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115274#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:09:17,119 INFO L290 TraceCheckUtils]: 12: Hoare triple {115282#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115278#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:09:17,120 INFO L290 TraceCheckUtils]: 11: Hoare triple {115286#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115282#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:09:17,120 INFO L290 TraceCheckUtils]: 10: Hoare triple {115290#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115286#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-08 10:09:17,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {115294#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115290#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:17,122 INFO L290 TraceCheckUtils]: 8: Hoare triple {115298#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115294#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-08 10:09:17,122 INFO L290 TraceCheckUtils]: 7: Hoare triple {115302#(< 0 (mod (+ main_~y~0 22) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115298#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-08 10:09:17,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {115306#(< 0 (mod (+ 23 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {115302#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-08 10:09:17,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {115043#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {115306#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:17,123 INFO L272 TraceCheckUtils]: 4: Hoare triple {115043#true} call #t~ret13 := main(); {115043#true} is VALID [2022-04-08 10:09:17,123 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {115043#true} {115043#true} #72#return; {115043#true} is VALID [2022-04-08 10:09:17,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {115043#true} assume true; {115043#true} is VALID [2022-04-08 10:09:17,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {115043#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {115043#true} is VALID [2022-04-08 10:09:17,123 INFO L272 TraceCheckUtils]: 0: Hoare triple {115043#true} call ULTIMATE.init(); {115043#true} is VALID [2022-04-08 10:09:17,123 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:09:17,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402158790] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:09:17,124 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:09:17,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 54 [2022-04-08 10:09:17,124 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:09:17,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [627003634] [2022-04-08 10:09:17,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [627003634] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:09:17,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:09:17,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-08 10:09:17,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756514776] [2022-04-08 10:09:17,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:09:17,124 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 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 38 [2022-04-08 10:09:17,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:09:17,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 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-08 10:09:17,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:17,143 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-08 10:09:17,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:17,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-08 10:09:17,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=683, Invalid=2179, Unknown=0, NotChecked=0, Total=2862 [2022-04-08 10:09:17,144 INFO L87 Difference]: Start difference. First operand 419 states and 569 transitions. Second operand has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 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-08 10:09:26,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:26,120 INFO L93 Difference]: Finished difference Result 731 states and 1116 transitions. [2022-04-08 10:09:26,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-08 10:09:26,121 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 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 38 [2022-04-08 10:09:26,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:09:26,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 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-08 10:09:26,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 245 transitions. [2022-04-08 10:09:26,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 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-08 10:09:26,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 245 transitions. [2022-04-08 10:09:26,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 245 transitions. [2022-04-08 10:09:26,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 245 edges. 245 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:26,277 INFO L225 Difference]: With dead ends: 731 [2022-04-08 10:09:26,277 INFO L226 Difference]: Without dead ends: 703 [2022-04-08 10:09:26,277 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1385, Invalid=4777, Unknown=0, NotChecked=0, Total=6162 [2022-04-08 10:09:26,277 INFO L913 BasicCegarLoop]: 110 mSDtfsCounter, 188 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 4825 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 4960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 4825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:09:26,277 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 237 Invalid, 4960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 4825 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-08 10:09:26,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2022-04-08 10:09:27,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 438. [2022-04-08 10:09:27,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:09:27,585 INFO L82 GeneralOperation]: Start isEquivalent. First operand 703 states. Second operand has 438 states, 433 states have (on average 1.369515011547344) internal successors, (593), 433 states have internal predecessors, (593), 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-08 10:09:27,585 INFO L74 IsIncluded]: Start isIncluded. First operand 703 states. Second operand has 438 states, 433 states have (on average 1.369515011547344) internal successors, (593), 433 states have internal predecessors, (593), 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-08 10:09:27,585 INFO L87 Difference]: Start difference. First operand 703 states. Second operand has 438 states, 433 states have (on average 1.369515011547344) internal successors, (593), 433 states have internal predecessors, (593), 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-08 10:09:27,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:27,598 INFO L93 Difference]: Finished difference Result 703 states and 886 transitions. [2022-04-08 10:09:27,598 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 886 transitions. [2022-04-08 10:09:27,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:27,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:27,599 INFO L74 IsIncluded]: Start isIncluded. First operand has 438 states, 433 states have (on average 1.369515011547344) internal successors, (593), 433 states have internal predecessors, (593), 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 703 states. [2022-04-08 10:09:27,599 INFO L87 Difference]: Start difference. First operand has 438 states, 433 states have (on average 1.369515011547344) internal successors, (593), 433 states have internal predecessors, (593), 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 703 states. [2022-04-08 10:09:27,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:27,612 INFO L93 Difference]: Finished difference Result 703 states and 886 transitions. [2022-04-08 10:09:27,612 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 886 transitions. [2022-04-08 10:09:27,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:27,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:27,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:09:27,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:09:27,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 433 states have (on average 1.369515011547344) internal successors, (593), 433 states have internal predecessors, (593), 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-08 10:09:27,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 597 transitions. [2022-04-08 10:09:27,621 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 597 transitions. Word has length 38 [2022-04-08 10:09:27,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:09:27,621 INFO L478 AbstractCegarLoop]: Abstraction has 438 states and 597 transitions. [2022-04-08 10:09:27,621 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 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-08 10:09:27,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 438 states and 597 transitions. [2022-04-08 10:09:31,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 597 edges. 597 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:31,075 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 597 transitions. [2022-04-08 10:09:31,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 10:09:31,075 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:09:31,075 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:09:31,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Forceful destruction successful, exit code 0 [2022-04-08 10:09:31,291 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable70 [2022-04-08 10:09:31,291 INFO L403 AbstractCegarLoop]: === Iteration 72 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:09:31,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:09:31,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1036634024, now seen corresponding path program 63 times [2022-04-08 10:09:31,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:31,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1010598769] [2022-04-08 10:09:31,294 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:09:31,294 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:09:31,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1036634024, now seen corresponding path program 64 times [2022-04-08 10:09:31,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:09:31,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384574679] [2022-04-08 10:09:31,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:09:31,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:09:31,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:33,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:09:33,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:33,872 INFO L290 TraceCheckUtils]: 0: Hoare triple {119144#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {119121#true} is VALID [2022-04-08 10:09:33,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {119121#true} assume true; {119121#true} is VALID [2022-04-08 10:09:33,872 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {119121#true} {119121#true} #72#return; {119121#true} is VALID [2022-04-08 10:09:33,873 INFO L272 TraceCheckUtils]: 0: Hoare triple {119121#true} call ULTIMATE.init(); {119144#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:09:33,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {119144#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {119121#true} is VALID [2022-04-08 10:09:33,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {119121#true} assume true; {119121#true} is VALID [2022-04-08 10:09:33,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {119121#true} {119121#true} #72#return; {119121#true} is VALID [2022-04-08 10:09:33,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {119121#true} call #t~ret13 := main(); {119121#true} is VALID [2022-04-08 10:09:33,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {119121#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {119126#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-08 10:09:33,874 INFO L290 TraceCheckUtils]: 6: Hoare triple {119126#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119127#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:33,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {119127#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119128#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-08 10:09:34,215 INFO L290 TraceCheckUtils]: 8: Hoare triple {119128#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119129#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:09:34,225 INFO L290 TraceCheckUtils]: 9: Hoare triple {119129#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119130#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-08 10:09:34,227 INFO L290 TraceCheckUtils]: 10: Hoare triple {119130#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= (+ main_~x~0 4) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119131#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~y~0 5) (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:09:34,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {119131#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~y~0 5) (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119132#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 main_~x~0)) (<= (+ main_~x~0 6) main_~n~0))} is VALID [2022-04-08 10:09:34,229 INFO L290 TraceCheckUtils]: 12: Hoare triple {119132#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 main_~x~0)) (<= (+ main_~x~0 6) main_~n~0))} assume !(~x~0 % 4294967296 > 0); {119133#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} is VALID [2022-04-08 10:09:34,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {119133#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} ~z~0 := ~y~0; {119133#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} is VALID [2022-04-08 10:09:34,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {119133#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {119134#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:09:34,230 INFO L290 TraceCheckUtils]: 15: Hoare triple {119134#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {119134#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:09:34,231 INFO L290 TraceCheckUtils]: 16: Hoare triple {119134#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {119134#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:09:34,231 INFO L290 TraceCheckUtils]: 17: Hoare triple {119134#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {119134#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:09:34,232 INFO L290 TraceCheckUtils]: 18: Hoare triple {119134#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {119134#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:09:34,232 INFO L290 TraceCheckUtils]: 19: Hoare triple {119134#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {119134#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:09:34,232 INFO L290 TraceCheckUtils]: 20: Hoare triple {119134#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {119134#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:09:34,233 INFO L290 TraceCheckUtils]: 21: Hoare triple {119134#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {119135#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296) 1)) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:34,234 INFO L290 TraceCheckUtils]: 22: Hoare triple {119135#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296) 1)) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {119136#(and (<= main_~y~0 4) (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:09:34,234 INFO L290 TraceCheckUtils]: 23: Hoare triple {119136#(and (<= main_~y~0 4) (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {119137#(and (<= main_~y~0 3) (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:09:34,235 INFO L290 TraceCheckUtils]: 24: Hoare triple {119137#(and (<= main_~y~0 3) (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {119138#(and (<= main_~y~0 2) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296) 4)))} is VALID [2022-04-08 10:09:34,235 INFO L290 TraceCheckUtils]: 25: Hoare triple {119138#(and (<= main_~y~0 2) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296) 4)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {119139#(and (<= main_~n~0 (+ 5 main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:34,236 INFO L290 TraceCheckUtils]: 26: Hoare triple {119139#(and (<= main_~n~0 (+ 5 main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {119140#(and (<= main_~n~0 (+ main_~y~0 6 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))) (<= main_~y~0 0))} is VALID [2022-04-08 10:09:34,236 INFO L290 TraceCheckUtils]: 27: Hoare triple {119140#(and (<= main_~n~0 (+ main_~y~0 6 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))) (<= main_~y~0 0))} assume !(~y~0 % 4294967296 > 0); {119140#(and (<= main_~n~0 (+ main_~y~0 6 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))) (<= main_~y~0 0))} is VALID [2022-04-08 10:09:34,237 INFO L290 TraceCheckUtils]: 28: Hoare triple {119140#(and (<= main_~n~0 (+ main_~y~0 6 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))) (<= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {119139#(and (<= main_~n~0 (+ 5 main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:34,238 INFO L290 TraceCheckUtils]: 29: Hoare triple {119139#(and (<= main_~n~0 (+ 5 main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {119138#(and (<= main_~y~0 2) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296) 4)))} is VALID [2022-04-08 10:09:34,238 INFO L290 TraceCheckUtils]: 30: Hoare triple {119138#(and (<= main_~y~0 2) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296) 4)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {119137#(and (<= main_~y~0 3) (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:09:34,239 INFO L290 TraceCheckUtils]: 31: Hoare triple {119137#(and (<= main_~y~0 3) (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {119136#(and (<= main_~y~0 4) (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:09:34,239 INFO L290 TraceCheckUtils]: 32: Hoare triple {119136#(and (<= main_~y~0 4) (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {119135#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296) 1)) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:34,255 INFO L290 TraceCheckUtils]: 33: Hoare triple {119135#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296) 1)) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:09:34,256 INFO L290 TraceCheckUtils]: 34: Hoare triple {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:09:34,257 INFO L272 TraceCheckUtils]: 35: Hoare triple {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {119142#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:09:34,258 INFO L290 TraceCheckUtils]: 36: Hoare triple {119142#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {119143#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:09:34,258 INFO L290 TraceCheckUtils]: 37: Hoare triple {119143#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {119122#false} is VALID [2022-04-08 10:09:34,258 INFO L290 TraceCheckUtils]: 38: Hoare triple {119122#false} assume !false; {119122#false} is VALID [2022-04-08 10:09:34,258 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 10:09:34,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:09:34,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384574679] [2022-04-08 10:09:34,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384574679] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:09:34,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826137369] [2022-04-08 10:09:34,258 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:09:34,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:34,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:09:34,259 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:09:34,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2022-04-08 10:09:34,512 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:09:34,512 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:09:34,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 72 conjunts are in the unsatisfiable core [2022-04-08 10:09:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:34,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:09:43,713 INFO L272 TraceCheckUtils]: 0: Hoare triple {119121#true} call ULTIMATE.init(); {119121#true} is VALID [2022-04-08 10:09:43,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {119121#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {119121#true} is VALID [2022-04-08 10:09:43,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {119121#true} assume true; {119121#true} is VALID [2022-04-08 10:09:43,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {119121#true} {119121#true} #72#return; {119121#true} is VALID [2022-04-08 10:09:43,714 INFO L272 TraceCheckUtils]: 4: Hoare triple {119121#true} call #t~ret13 := main(); {119121#true} is VALID [2022-04-08 10:09:43,714 INFO L290 TraceCheckUtils]: 5: Hoare triple {119121#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {119126#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-08 10:09:43,715 INFO L290 TraceCheckUtils]: 6: Hoare triple {119126#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119127#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:43,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {119127#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119128#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-08 10:09:43,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {119128#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119172#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:09:43,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {119172#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119176#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-08 10:09:43,725 INFO L290 TraceCheckUtils]: 10: Hoare triple {119176#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= (+ main_~x~0 4) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119180#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~x~0 (+ 4294967290 (* (div (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:43,727 INFO L290 TraceCheckUtils]: 11: Hoare triple {119180#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~x~0 (+ 4294967290 (* (div (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119184#(and (<= main_~y~0 6) (<= main_~x~0 (+ (* (div (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967289)) (<= (+ main_~x~0 6) main_~n~0))} is VALID [2022-04-08 10:09:43,727 INFO L290 TraceCheckUtils]: 12: Hoare triple {119184#(and (<= main_~y~0 6) (<= main_~x~0 (+ (* (div (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967289)) (<= (+ main_~x~0 6) main_~n~0))} assume !(~x~0 % 4294967296 > 0); {119188#(and (<= main_~y~0 6) (not (< 0 (mod main_~x~0 4294967296))) (<= main_~x~0 (+ (* (div (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967289)) (<= (+ main_~x~0 6) main_~n~0))} is VALID [2022-04-08 10:09:43,728 INFO L290 TraceCheckUtils]: 13: Hoare triple {119188#(and (<= main_~y~0 6) (not (< 0 (mod main_~x~0 4294967296))) (<= main_~x~0 (+ (* (div (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967289)) (<= (+ main_~x~0 6) main_~n~0))} ~z~0 := ~y~0; {119188#(and (<= main_~y~0 6) (not (< 0 (mod main_~x~0 4294967296))) (<= main_~x~0 (+ (* (div (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967289)) (<= (+ main_~x~0 6) main_~n~0))} is VALID [2022-04-08 10:09:43,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {119188#(and (<= main_~y~0 6) (not (< 0 (mod main_~x~0 4294967296))) (<= main_~x~0 (+ (* (div (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967289)) (<= (+ main_~x~0 6) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {119195#(and (<= main_~y~0 6) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= (+ 5 main_~x~0) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div (+ (- 1) (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296)) 4294967290)))} is VALID [2022-04-08 10:09:43,733 INFO L290 TraceCheckUtils]: 15: Hoare triple {119195#(and (<= main_~y~0 6) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= (+ 5 main_~x~0) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div (+ (- 1) (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296)) 4294967290)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {119199#(and (<= main_~y~0 6) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= main_~x~0 (+ 4294967291 (* (div (+ (- 2) main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-08 10:09:43,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {119199#(and (<= main_~y~0 6) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= main_~x~0 (+ 4294967291 (* (div (+ (- 2) main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 4) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {119203#(and (<= main_~y~0 6) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (- 3) (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= (+ main_~x~0 3) main_~n~0))} is VALID [2022-04-08 10:09:43,736 INFO L290 TraceCheckUtils]: 17: Hoare triple {119203#(and (<= main_~y~0 6) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (- 3) (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (<= (+ main_~x~0 3) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {119207#(and (<= (+ main_~x~0 2) main_~n~0) (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~y~0 6) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~y~0 main_~x~0 (- 4) (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296)) 4294967293)))} is VALID [2022-04-08 10:09:43,738 INFO L290 TraceCheckUtils]: 18: Hoare triple {119207#(and (<= (+ main_~x~0 2) main_~n~0) (not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296))) (<= main_~y~0 6) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~y~0 main_~x~0 (- 4) (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296)) 4294967293)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {119211#(and (<= main_~y~0 6) (not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296))) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (- 5) (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967294)) (<= (+ main_~x~0 1) main_~n~0))} is VALID [2022-04-08 10:09:43,740 INFO L290 TraceCheckUtils]: 19: Hoare triple {119211#(and (<= main_~y~0 6) (not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296))) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (- 5) (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967294)) (<= (+ main_~x~0 1) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {119215#(and (<= main_~y~0 6) (not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296))) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (- 6) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)) (<= main_~x~0 main_~n~0))} is VALID [2022-04-08 10:09:43,740 INFO L290 TraceCheckUtils]: 20: Hoare triple {119215#(and (<= main_~y~0 6) (not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296))) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (- 6) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)) (<= main_~x~0 main_~n~0))} assume !(~z~0 % 4294967296 > 0); {119215#(and (<= main_~y~0 6) (not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296))) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (- 6) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)) (<= main_~x~0 main_~n~0))} is VALID [2022-04-08 10:09:43,746 INFO L290 TraceCheckUtils]: 21: Hoare triple {119215#(and (<= main_~y~0 6) (not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296))) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (- 6) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)) (<= main_~x~0 main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {119222#(and (not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296))) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (- 5) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)) (<= main_~x~0 main_~n~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:43,750 INFO L290 TraceCheckUtils]: 22: Hoare triple {119222#(and (not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296))) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (- 5) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)) (<= main_~x~0 main_~n~0) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {119226#(and (<= main_~x~0 (+ 4294967295 (* (div (+ main_~y~0 main_~x~0 (- 4) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296))) (<= main_~y~0 4) (<= main_~x~0 main_~n~0))} is VALID [2022-04-08 10:09:43,752 INFO L290 TraceCheckUtils]: 23: Hoare triple {119226#(and (<= main_~x~0 (+ 4294967295 (* (div (+ main_~y~0 main_~x~0 (- 4) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296))) (<= main_~y~0 4) (<= main_~x~0 main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {119230#(and (not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296))) (<= main_~y~0 3) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~y~0 main_~x~0 (- 3) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:09:43,753 INFO L290 TraceCheckUtils]: 24: Hoare triple {119230#(and (not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296))) (<= main_~y~0 3) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~y~0 main_~x~0 (- 3) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {119234#(and (<= main_~x~0 (+ (* (div (+ (- 2) main_~y~0 main_~x~0 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)) (not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296))) (<= main_~y~0 2) (<= main_~x~0 main_~n~0))} is VALID [2022-04-08 10:09:43,755 INFO L290 TraceCheckUtils]: 25: Hoare triple {119234#(and (<= main_~x~0 (+ (* (div (+ (- 2) main_~y~0 main_~x~0 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)) (not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296))) (<= main_~y~0 2) (<= main_~x~0 main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {119238#(and (not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~y~0 main_~x~0 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:43,756 INFO L290 TraceCheckUtils]: 26: Hoare triple {119238#(and (not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~y~0 main_~x~0 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {119242#(and (<= main_~x~0 (+ 4294967295 (* (div (+ main_~y~0 main_~x~0 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~y~0 0))} is VALID [2022-04-08 10:09:43,757 INFO L290 TraceCheckUtils]: 27: Hoare triple {119242#(and (<= main_~x~0 (+ 4294967295 (* (div (+ main_~y~0 main_~x~0 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~y~0 0))} assume !(~y~0 % 4294967296 > 0); {119242#(and (<= main_~x~0 (+ 4294967295 (* (div (+ main_~y~0 main_~x~0 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~y~0 0))} is VALID [2022-04-08 10:09:43,760 INFO L290 TraceCheckUtils]: 28: Hoare triple {119242#(and (<= main_~x~0 (+ 4294967295 (* (div (+ main_~y~0 main_~x~0 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296))) (<= main_~x~0 main_~n~0) (<= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {119139#(and (<= main_~n~0 (+ 5 main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:43,761 INFO L290 TraceCheckUtils]: 29: Hoare triple {119139#(and (<= main_~n~0 (+ 5 main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {119138#(and (<= main_~y~0 2) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296) 4)))} is VALID [2022-04-08 10:09:43,761 INFO L290 TraceCheckUtils]: 30: Hoare triple {119138#(and (<= main_~y~0 2) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296) 4)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {119137#(and (<= main_~y~0 3) (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:09:43,762 INFO L290 TraceCheckUtils]: 31: Hoare triple {119137#(and (<= main_~y~0 3) (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {119136#(and (<= main_~y~0 4) (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:09:43,762 INFO L290 TraceCheckUtils]: 32: Hoare triple {119136#(and (<= main_~y~0 4) (<= main_~n~0 (+ main_~y~0 2 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {119135#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296) 1)) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:43,763 INFO L290 TraceCheckUtils]: 33: Hoare triple {119135#(and (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296) 1)) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {119134#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:09:43,763 INFO L290 TraceCheckUtils]: 34: Hoare triple {119134#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {119134#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:09:43,765 INFO L272 TraceCheckUtils]: 35: Hoare triple {119134#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* (div (+ main_~n~0 (- 6)) 4294967296) 4294967296))))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {119270#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:09:43,765 INFO L290 TraceCheckUtils]: 36: Hoare triple {119270#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {119274#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:09:43,766 INFO L290 TraceCheckUtils]: 37: Hoare triple {119274#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {119122#false} is VALID [2022-04-08 10:09:43,766 INFO L290 TraceCheckUtils]: 38: Hoare triple {119122#false} assume !false; {119122#false} is VALID [2022-04-08 10:09:43,766 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:09:43,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:09:48,743 INFO L290 TraceCheckUtils]: 38: Hoare triple {119122#false} assume !false; {119122#false} is VALID [2022-04-08 10:09:48,743 INFO L290 TraceCheckUtils]: 37: Hoare triple {119274#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {119122#false} is VALID [2022-04-08 10:09:48,744 INFO L290 TraceCheckUtils]: 36: Hoare triple {119270#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {119274#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:09:48,744 INFO L272 TraceCheckUtils]: 35: Hoare triple {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {119270#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:09:48,745 INFO L290 TraceCheckUtils]: 34: Hoare triple {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:09:48,746 INFO L290 TraceCheckUtils]: 33: Hoare triple {119296#(and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:09:48,746 INFO L290 TraceCheckUtils]: 32: Hoare triple {119300#(and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {119296#(and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:09:48,747 INFO L290 TraceCheckUtils]: 31: Hoare triple {119304#(and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {119300#(and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:09:48,748 INFO L290 TraceCheckUtils]: 30: Hoare triple {119308#(and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {119304#(and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4)))} is VALID [2022-04-08 10:09:48,749 INFO L290 TraceCheckUtils]: 29: Hoare triple {119312#(and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {119308#(and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296)))))} is VALID [2022-04-08 10:09:48,749 INFO L290 TraceCheckUtils]: 28: Hoare triple {119316#(and (< (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)) (+ 7 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {119312#(and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:09:48,750 INFO L290 TraceCheckUtils]: 27: Hoare triple {119316#(and (< (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)) (+ 7 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {119316#(and (< (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)) (+ 7 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296))))} is VALID [2022-04-08 10:09:48,751 INFO L290 TraceCheckUtils]: 26: Hoare triple {119312#(and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {119316#(and (< (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)) (+ 7 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296))))} is VALID [2022-04-08 10:09:48,751 INFO L290 TraceCheckUtils]: 25: Hoare triple {119308#(and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296)))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {119312#(and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:09:48,752 INFO L290 TraceCheckUtils]: 24: Hoare triple {119304#(and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {119308#(and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296)))))} is VALID [2022-04-08 10:09:48,753 INFO L290 TraceCheckUtils]: 23: Hoare triple {119300#(and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {119304#(and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4)))} is VALID [2022-04-08 10:09:48,753 INFO L290 TraceCheckUtils]: 22: Hoare triple {119296#(and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {119300#(and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:09:48,754 INFO L290 TraceCheckUtils]: 21: Hoare triple {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {119296#(and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-08 10:09:48,755 INFO L290 TraceCheckUtils]: 20: Hoare triple {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:09:48,755 INFO L290 TraceCheckUtils]: 19: Hoare triple {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:09:48,755 INFO L290 TraceCheckUtils]: 18: Hoare triple {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:09:48,756 INFO L290 TraceCheckUtils]: 17: Hoare triple {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:09:48,756 INFO L290 TraceCheckUtils]: 16: Hoare triple {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:09:48,757 INFO L290 TraceCheckUtils]: 15: Hoare triple {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:09:48,757 INFO L290 TraceCheckUtils]: 14: Hoare triple {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:09:48,757 INFO L290 TraceCheckUtils]: 13: Hoare triple {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} ~z~0 := ~y~0; {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:09:48,758 INFO L290 TraceCheckUtils]: 12: Hoare triple {119365#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} assume !(~x~0 % 4294967296 > 0); {119141#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:09:48,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {119369#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119365#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-08 10:09:48,760 INFO L290 TraceCheckUtils]: 10: Hoare triple {119373#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119369#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-08 10:09:48,762 INFO L290 TraceCheckUtils]: 9: Hoare triple {119377#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119373#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:09:48,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {119381#(or (and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119377#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:09:48,765 INFO L290 TraceCheckUtils]: 7: Hoare triple {119385#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119381#(or (and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:09:48,766 INFO L290 TraceCheckUtils]: 6: Hoare triple {119389#(or (and (< (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)) (+ 7 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {119385#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-08 10:09:48,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {119121#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {119389#(or (and (< (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)) (+ 7 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:09:48,766 INFO L272 TraceCheckUtils]: 4: Hoare triple {119121#true} call #t~ret13 := main(); {119121#true} is VALID [2022-04-08 10:09:48,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {119121#true} {119121#true} #72#return; {119121#true} is VALID [2022-04-08 10:09:48,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {119121#true} assume true; {119121#true} is VALID [2022-04-08 10:09:48,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {119121#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {119121#true} is VALID [2022-04-08 10:09:48,767 INFO L272 TraceCheckUtils]: 0: Hoare triple {119121#true} call ULTIMATE.init(); {119121#true} is VALID [2022-04-08 10:09:48,767 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-08 10:09:48,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826137369] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:09:48,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:09:48,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 30, 18] total 53 [2022-04-08 10:09:48,767 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:09:48,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1010598769] [2022-04-08 10:09:48,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1010598769] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:09:48,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:09:48,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 10:09:48,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796743829] [2022-04-08 10:09:48,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:09:48,768 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 19 states have internal predecessors, (31), 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 39 [2022-04-08 10:09:48,768 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:09:48,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 19 states have internal predecessors, (31), 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-08 10:09:48,804 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:48,804 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 10:09:48,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:48,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 10:09:48,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=2429, Unknown=1, NotChecked=0, Total=2756 [2022-04-08 10:09:48,805 INFO L87 Difference]: Start difference. First operand 438 states and 597 transitions. Second operand has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 19 states have internal predecessors, (31), 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-08 10:09:52,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:52,954 INFO L93 Difference]: Finished difference Result 457 states and 616 transitions. [2022-04-08 10:09:52,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 10:09:52,954 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 19 states have internal predecessors, (31), 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 39 [2022-04-08 10:09:52,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:09:52,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 19 states have internal predecessors, (31), 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-08 10:09:52,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 51 transitions. [2022-04-08 10:09:52,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 19 states have internal predecessors, (31), 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-08 10:09:52,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 51 transitions. [2022-04-08 10:09:52,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 51 transitions. [2022-04-08 10:09:53,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:53,110 INFO L225 Difference]: With dead ends: 457 [2022-04-08 10:09:53,110 INFO L226 Difference]: Without dead ends: 452 [2022-04-08 10:09:53,112 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1058 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=485, Invalid=4484, Unknown=1, NotChecked=0, Total=4970 [2022-04-08 10:09:53,130 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 27 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:09:53,131 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 93 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 10:09:53,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2022-04-08 10:09:54,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 438. [2022-04-08 10:09:54,701 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:09:54,701 INFO L82 GeneralOperation]: Start isEquivalent. First operand 452 states. Second operand has 438 states, 433 states have (on average 1.369515011547344) internal successors, (593), 433 states have internal predecessors, (593), 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-08 10:09:54,701 INFO L74 IsIncluded]: Start isIncluded. First operand 452 states. Second operand has 438 states, 433 states have (on average 1.369515011547344) internal successors, (593), 433 states have internal predecessors, (593), 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-08 10:09:54,702 INFO L87 Difference]: Start difference. First operand 452 states. Second operand has 438 states, 433 states have (on average 1.369515011547344) internal successors, (593), 433 states have internal predecessors, (593), 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-08 10:09:54,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:54,708 INFO L93 Difference]: Finished difference Result 452 states and 611 transitions. [2022-04-08 10:09:54,708 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 611 transitions. [2022-04-08 10:09:54,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:54,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:54,709 INFO L74 IsIncluded]: Start isIncluded. First operand has 438 states, 433 states have (on average 1.369515011547344) internal successors, (593), 433 states have internal predecessors, (593), 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 452 states. [2022-04-08 10:09:54,709 INFO L87 Difference]: Start difference. First operand has 438 states, 433 states have (on average 1.369515011547344) internal successors, (593), 433 states have internal predecessors, (593), 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 452 states. [2022-04-08 10:09:54,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:09:54,715 INFO L93 Difference]: Finished difference Result 452 states and 611 transitions. [2022-04-08 10:09:54,716 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 611 transitions. [2022-04-08 10:09:54,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:09:54,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:09:54,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:09:54,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:09:54,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 433 states have (on average 1.369515011547344) internal successors, (593), 433 states have internal predecessors, (593), 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-08 10:09:54,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 597 transitions. [2022-04-08 10:09:54,724 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 597 transitions. Word has length 39 [2022-04-08 10:09:54,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:09:54,724 INFO L478 AbstractCegarLoop]: Abstraction has 438 states and 597 transitions. [2022-04-08 10:09:54,724 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 19 states have internal predecessors, (31), 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-08 10:09:54,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 438 states and 597 transitions. [2022-04-08 10:09:57,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 597 edges. 597 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:09:57,681 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 597 transitions. [2022-04-08 10:09:57,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 10:09:57,682 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:09:57,682 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:09:57,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Forceful destruction successful, exit code 0 [2022-04-08 10:09:57,882 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:57,882 INFO L403 AbstractCegarLoop]: === Iteration 73 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:09:57,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:09:57,883 INFO L85 PathProgramCache]: Analyzing trace with hash -731553192, now seen corresponding path program 65 times [2022-04-08 10:09:57,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:57,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1286580087] [2022-04-08 10:09:57,885 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:09:57,885 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:09:57,885 INFO L85 PathProgramCache]: Analyzing trace with hash -731553192, now seen corresponding path program 66 times [2022-04-08 10:09:57,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:09:57,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121875856] [2022-04-08 10:09:57,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:09:57,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:09:57,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:58,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:09:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:58,109 INFO L290 TraceCheckUtils]: 0: Hoare triple {122159#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {122140#true} is VALID [2022-04-08 10:09:58,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {122140#true} assume true; {122140#true} is VALID [2022-04-08 10:09:58,109 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {122140#true} {122140#true} #72#return; {122140#true} is VALID [2022-04-08 10:09:58,109 INFO L272 TraceCheckUtils]: 0: Hoare triple {122140#true} call ULTIMATE.init(); {122159#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:09:58,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {122159#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {122140#true} is VALID [2022-04-08 10:09:58,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {122140#true} assume true; {122140#true} is VALID [2022-04-08 10:09:58,109 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {122140#true} {122140#true} #72#return; {122140#true} is VALID [2022-04-08 10:09:58,109 INFO L272 TraceCheckUtils]: 4: Hoare triple {122140#true} call #t~ret13 := main(); {122140#true} is VALID [2022-04-08 10:09:58,110 INFO L290 TraceCheckUtils]: 5: Hoare triple {122140#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {122145#(= main_~y~0 0)} is VALID [2022-04-08 10:09:58,110 INFO L290 TraceCheckUtils]: 6: Hoare triple {122145#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122146#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:58,111 INFO L290 TraceCheckUtils]: 7: Hoare triple {122146#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122147#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:58,111 INFO L290 TraceCheckUtils]: 8: Hoare triple {122147#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122148#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:58,112 INFO L290 TraceCheckUtils]: 9: Hoare triple {122148#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122149#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:58,112 INFO L290 TraceCheckUtils]: 10: Hoare triple {122149#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122150#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:58,113 INFO L290 TraceCheckUtils]: 11: Hoare triple {122150#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122151#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:58,113 INFO L290 TraceCheckUtils]: 12: Hoare triple {122151#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122152#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:58,114 INFO L290 TraceCheckUtils]: 13: Hoare triple {122152#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122153#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:58,114 INFO L290 TraceCheckUtils]: 14: Hoare triple {122153#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {122153#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:58,114 INFO L290 TraceCheckUtils]: 15: Hoare triple {122153#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {122154#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:09:58,115 INFO L290 TraceCheckUtils]: 16: Hoare triple {122154#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {122155#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:09:58,115 INFO L290 TraceCheckUtils]: 17: Hoare triple {122155#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {122156#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:09:58,116 INFO L290 TraceCheckUtils]: 18: Hoare triple {122156#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {122157#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:09:58,116 INFO L290 TraceCheckUtils]: 19: Hoare triple {122157#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {122158#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:09:58,117 INFO L290 TraceCheckUtils]: 20: Hoare triple {122158#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {122141#false} is VALID [2022-04-08 10:09:58,117 INFO L290 TraceCheckUtils]: 21: Hoare triple {122141#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122141#false} is VALID [2022-04-08 10:09:58,117 INFO L290 TraceCheckUtils]: 22: Hoare triple {122141#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122141#false} is VALID [2022-04-08 10:09:58,117 INFO L290 TraceCheckUtils]: 23: Hoare triple {122141#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122141#false} is VALID [2022-04-08 10:09:58,117 INFO L290 TraceCheckUtils]: 24: Hoare triple {122141#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122141#false} is VALID [2022-04-08 10:09:58,117 INFO L290 TraceCheckUtils]: 25: Hoare triple {122141#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122141#false} is VALID [2022-04-08 10:09:58,117 INFO L290 TraceCheckUtils]: 26: Hoare triple {122141#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122141#false} is VALID [2022-04-08 10:09:58,117 INFO L290 TraceCheckUtils]: 27: Hoare triple {122141#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122141#false} is VALID [2022-04-08 10:09:58,117 INFO L290 TraceCheckUtils]: 28: Hoare triple {122141#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122141#false} is VALID [2022-04-08 10:09:58,117 INFO L290 TraceCheckUtils]: 29: Hoare triple {122141#false} assume !(~y~0 % 4294967296 > 0); {122141#false} is VALID [2022-04-08 10:09:58,117 INFO L290 TraceCheckUtils]: 30: Hoare triple {122141#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122141#false} is VALID [2022-04-08 10:09:58,117 INFO L290 TraceCheckUtils]: 31: Hoare triple {122141#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122141#false} is VALID [2022-04-08 10:09:58,117 INFO L290 TraceCheckUtils]: 32: Hoare triple {122141#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122141#false} is VALID [2022-04-08 10:09:58,117 INFO L290 TraceCheckUtils]: 33: Hoare triple {122141#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122141#false} is VALID [2022-04-08 10:09:58,117 INFO L290 TraceCheckUtils]: 34: Hoare triple {122141#false} assume !(~x~0 % 4294967296 > 0); {122141#false} is VALID [2022-04-08 10:09:58,118 INFO L272 TraceCheckUtils]: 35: Hoare triple {122141#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {122141#false} is VALID [2022-04-08 10:09:58,118 INFO L290 TraceCheckUtils]: 36: Hoare triple {122141#false} ~cond := #in~cond; {122141#false} is VALID [2022-04-08 10:09:58,118 INFO L290 TraceCheckUtils]: 37: Hoare triple {122141#false} assume 0 == ~cond; {122141#false} is VALID [2022-04-08 10:09:58,118 INFO L290 TraceCheckUtils]: 38: Hoare triple {122141#false} assume !false; {122141#false} is VALID [2022-04-08 10:09:58,118 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-08 10:09:58,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:09:58,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121875856] [2022-04-08 10:09:58,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121875856] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:09:58,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562486498] [2022-04-08 10:09:58,118 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:09:58,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:09:58,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:09:58,119 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:09:58,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2022-04-08 10:09:58,202 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 10:09:58,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:09:58,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 10:09:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:09:58,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:09:58,477 INFO L272 TraceCheckUtils]: 0: Hoare triple {122140#true} call ULTIMATE.init(); {122140#true} is VALID [2022-04-08 10:09:58,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {122140#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {122140#true} is VALID [2022-04-08 10:09:58,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {122140#true} assume true; {122140#true} is VALID [2022-04-08 10:09:58,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {122140#true} {122140#true} #72#return; {122140#true} is VALID [2022-04-08 10:09:58,478 INFO L272 TraceCheckUtils]: 4: Hoare triple {122140#true} call #t~ret13 := main(); {122140#true} is VALID [2022-04-08 10:09:58,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {122140#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {122145#(= main_~y~0 0)} is VALID [2022-04-08 10:09:58,478 INFO L290 TraceCheckUtils]: 6: Hoare triple {122145#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122146#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:09:58,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {122146#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122147#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:09:58,479 INFO L290 TraceCheckUtils]: 8: Hoare triple {122147#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122148#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:09:58,480 INFO L290 TraceCheckUtils]: 9: Hoare triple {122148#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122149#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:09:58,480 INFO L290 TraceCheckUtils]: 10: Hoare triple {122149#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122150#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:09:58,481 INFO L290 TraceCheckUtils]: 11: Hoare triple {122150#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122151#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:09:58,481 INFO L290 TraceCheckUtils]: 12: Hoare triple {122151#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122152#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:09:58,481 INFO L290 TraceCheckUtils]: 13: Hoare triple {122152#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122153#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:58,482 INFO L290 TraceCheckUtils]: 14: Hoare triple {122153#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {122153#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:09:58,482 INFO L290 TraceCheckUtils]: 15: Hoare triple {122153#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {122154#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:09:58,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {122154#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {122155#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:09:58,483 INFO L290 TraceCheckUtils]: 17: Hoare triple {122155#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {122156#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:09:58,483 INFO L290 TraceCheckUtils]: 18: Hoare triple {122156#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {122157#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:09:58,484 INFO L290 TraceCheckUtils]: 19: Hoare triple {122157#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {122220#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:09:58,484 INFO L290 TraceCheckUtils]: 20: Hoare triple {122220#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {122141#false} is VALID [2022-04-08 10:09:58,484 INFO L290 TraceCheckUtils]: 21: Hoare triple {122141#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122141#false} is VALID [2022-04-08 10:09:58,484 INFO L290 TraceCheckUtils]: 22: Hoare triple {122141#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122141#false} is VALID [2022-04-08 10:09:58,484 INFO L290 TraceCheckUtils]: 23: Hoare triple {122141#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122141#false} is VALID [2022-04-08 10:09:58,484 INFO L290 TraceCheckUtils]: 24: Hoare triple {122141#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122141#false} is VALID [2022-04-08 10:09:58,484 INFO L290 TraceCheckUtils]: 25: Hoare triple {122141#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122141#false} is VALID [2022-04-08 10:09:58,484 INFO L290 TraceCheckUtils]: 26: Hoare triple {122141#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122141#false} is VALID [2022-04-08 10:09:58,484 INFO L290 TraceCheckUtils]: 27: Hoare triple {122141#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122141#false} is VALID [2022-04-08 10:09:58,485 INFO L290 TraceCheckUtils]: 28: Hoare triple {122141#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122141#false} is VALID [2022-04-08 10:09:58,485 INFO L290 TraceCheckUtils]: 29: Hoare triple {122141#false} assume !(~y~0 % 4294967296 > 0); {122141#false} is VALID [2022-04-08 10:09:58,485 INFO L290 TraceCheckUtils]: 30: Hoare triple {122141#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122141#false} is VALID [2022-04-08 10:09:58,485 INFO L290 TraceCheckUtils]: 31: Hoare triple {122141#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122141#false} is VALID [2022-04-08 10:09:58,485 INFO L290 TraceCheckUtils]: 32: Hoare triple {122141#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122141#false} is VALID [2022-04-08 10:09:58,485 INFO L290 TraceCheckUtils]: 33: Hoare triple {122141#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122141#false} is VALID [2022-04-08 10:09:58,485 INFO L290 TraceCheckUtils]: 34: Hoare triple {122141#false} assume !(~x~0 % 4294967296 > 0); {122141#false} is VALID [2022-04-08 10:09:58,485 INFO L272 TraceCheckUtils]: 35: Hoare triple {122141#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {122141#false} is VALID [2022-04-08 10:09:58,485 INFO L290 TraceCheckUtils]: 36: Hoare triple {122141#false} ~cond := #in~cond; {122141#false} is VALID [2022-04-08 10:09:58,485 INFO L290 TraceCheckUtils]: 37: Hoare triple {122141#false} assume 0 == ~cond; {122141#false} is VALID [2022-04-08 10:09:58,485 INFO L290 TraceCheckUtils]: 38: Hoare triple {122141#false} assume !false; {122141#false} is VALID [2022-04-08 10:09:58,485 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-08 10:09:58,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:09:58,791 INFO L290 TraceCheckUtils]: 38: Hoare triple {122141#false} assume !false; {122141#false} is VALID [2022-04-08 10:09:58,792 INFO L290 TraceCheckUtils]: 37: Hoare triple {122141#false} assume 0 == ~cond; {122141#false} is VALID [2022-04-08 10:09:58,792 INFO L290 TraceCheckUtils]: 36: Hoare triple {122141#false} ~cond := #in~cond; {122141#false} is VALID [2022-04-08 10:09:58,792 INFO L272 TraceCheckUtils]: 35: Hoare triple {122141#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {122141#false} is VALID [2022-04-08 10:09:58,792 INFO L290 TraceCheckUtils]: 34: Hoare triple {122141#false} assume !(~x~0 % 4294967296 > 0); {122141#false} is VALID [2022-04-08 10:09:58,792 INFO L290 TraceCheckUtils]: 33: Hoare triple {122141#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122141#false} is VALID [2022-04-08 10:09:58,792 INFO L290 TraceCheckUtils]: 32: Hoare triple {122141#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122141#false} is VALID [2022-04-08 10:09:58,792 INFO L290 TraceCheckUtils]: 31: Hoare triple {122141#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122141#false} is VALID [2022-04-08 10:09:58,792 INFO L290 TraceCheckUtils]: 30: Hoare triple {122141#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {122141#false} is VALID [2022-04-08 10:09:58,792 INFO L290 TraceCheckUtils]: 29: Hoare triple {122141#false} assume !(~y~0 % 4294967296 > 0); {122141#false} is VALID [2022-04-08 10:09:58,792 INFO L290 TraceCheckUtils]: 28: Hoare triple {122141#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122141#false} is VALID [2022-04-08 10:09:58,792 INFO L290 TraceCheckUtils]: 27: Hoare triple {122141#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122141#false} is VALID [2022-04-08 10:09:58,792 INFO L290 TraceCheckUtils]: 26: Hoare triple {122141#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122141#false} is VALID [2022-04-08 10:09:58,792 INFO L290 TraceCheckUtils]: 25: Hoare triple {122141#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122141#false} is VALID [2022-04-08 10:09:58,792 INFO L290 TraceCheckUtils]: 24: Hoare triple {122141#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122141#false} is VALID [2022-04-08 10:09:58,792 INFO L290 TraceCheckUtils]: 23: Hoare triple {122141#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122141#false} is VALID [2022-04-08 10:09:58,792 INFO L290 TraceCheckUtils]: 22: Hoare triple {122141#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122141#false} is VALID [2022-04-08 10:09:58,792 INFO L290 TraceCheckUtils]: 21: Hoare triple {122141#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {122141#false} is VALID [2022-04-08 10:09:58,793 INFO L290 TraceCheckUtils]: 20: Hoare triple {122332#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {122141#false} is VALID [2022-04-08 10:09:58,794 INFO L290 TraceCheckUtils]: 19: Hoare triple {122336#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {122332#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:09:58,795 INFO L290 TraceCheckUtils]: 18: Hoare triple {122340#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {122336#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:58,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {122344#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {122340#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:09:58,798 INFO L290 TraceCheckUtils]: 16: Hoare triple {122348#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {122344#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:09:58,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {122352#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {122348#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:09:58,798 INFO L290 TraceCheckUtils]: 14: Hoare triple {122352#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {122352#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:58,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {122359#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122352#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:09:58,799 INFO L290 TraceCheckUtils]: 12: Hoare triple {122363#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122359#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:09:58,800 INFO L290 TraceCheckUtils]: 11: Hoare triple {122367#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122363#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:09:58,800 INFO L290 TraceCheckUtils]: 10: Hoare triple {122371#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122367#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:09:58,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {122375#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122371#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:09:58,801 INFO L290 TraceCheckUtils]: 8: Hoare triple {122379#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122375#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:09:58,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {122383#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122379#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:09:58,802 INFO L290 TraceCheckUtils]: 6: Hoare triple {122387#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {122383#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:09:58,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {122140#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {122387#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:09:58,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {122140#true} call #t~ret13 := main(); {122140#true} is VALID [2022-04-08 10:09:58,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {122140#true} {122140#true} #72#return; {122140#true} is VALID [2022-04-08 10:09:58,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {122140#true} assume true; {122140#true} is VALID [2022-04-08 10:09:58,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {122140#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {122140#true} is VALID [2022-04-08 10:09:58,803 INFO L272 TraceCheckUtils]: 0: Hoare triple {122140#true} call ULTIMATE.init(); {122140#true} is VALID [2022-04-08 10:09:58,803 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-08 10:09:58,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562486498] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:09:58,803 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:09:58,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-08 10:09:58,803 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:09:58,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1286580087] [2022-04-08 10:09:58,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1286580087] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:09:58,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:09:58,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 10:09:58,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200952481] [2022-04-08 10:09:58,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:09:58,804 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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 39 [2022-04-08 10:09:58,804 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:09:58,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-08 10:09:58,819 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-08 10:09:58,819 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 10:09:58,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:09:58,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 10:09:58,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=822, Unknown=0, NotChecked=0, Total=992 [2022-04-08 10:09:58,820 INFO L87 Difference]: Start difference. First operand 438 states and 597 transitions. Second operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-08 10:10:02,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:02,941 INFO L93 Difference]: Finished difference Result 530 states and 697 transitions. [2022-04-08 10:10:02,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-08 10:10:02,942 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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 39 [2022-04-08 10:10:02,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:10:02,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-08 10:10:02,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 97 transitions. [2022-04-08 10:10:02,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-08 10:10:02,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 97 transitions. [2022-04-08 10:10:02,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 97 transitions. [2022-04-08 10:10:02,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:03,006 INFO L225 Difference]: With dead ends: 530 [2022-04-08 10:10:03,006 INFO L226 Difference]: Without dead ends: 511 [2022-04-08 10:10:03,007 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=537, Invalid=2219, Unknown=0, NotChecked=0, Total=2756 [2022-04-08 10:10:03,007 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 44 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:10:03,007 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 95 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:10:03,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2022-04-08 10:10:04,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 438. [2022-04-08 10:10:04,367 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:10:04,367 INFO L82 GeneralOperation]: Start isEquivalent. First operand 511 states. Second operand has 438 states, 433 states have (on average 1.3672055427251733) internal successors, (592), 433 states have internal predecessors, (592), 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-08 10:10:04,367 INFO L74 IsIncluded]: Start isIncluded. First operand 511 states. Second operand has 438 states, 433 states have (on average 1.3672055427251733) internal successors, (592), 433 states have internal predecessors, (592), 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-08 10:10:04,368 INFO L87 Difference]: Start difference. First operand 511 states. Second operand has 438 states, 433 states have (on average 1.3672055427251733) internal successors, (592), 433 states have internal predecessors, (592), 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-08 10:10:04,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:04,375 INFO L93 Difference]: Finished difference Result 511 states and 678 transitions. [2022-04-08 10:10:04,375 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 678 transitions. [2022-04-08 10:10:04,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:04,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:04,376 INFO L74 IsIncluded]: Start isIncluded. First operand has 438 states, 433 states have (on average 1.3672055427251733) internal successors, (592), 433 states have internal predecessors, (592), 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 511 states. [2022-04-08 10:10:04,376 INFO L87 Difference]: Start difference. First operand has 438 states, 433 states have (on average 1.3672055427251733) internal successors, (592), 433 states have internal predecessors, (592), 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 511 states. [2022-04-08 10:10:04,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:04,383 INFO L93 Difference]: Finished difference Result 511 states and 678 transitions. [2022-04-08 10:10:04,384 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 678 transitions. [2022-04-08 10:10:04,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:04,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:04,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:10:04,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:10:04,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 433 states have (on average 1.3672055427251733) internal successors, (592), 433 states have internal predecessors, (592), 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-08 10:10:04,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 596 transitions. [2022-04-08 10:10:04,392 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 596 transitions. Word has length 39 [2022-04-08 10:10:04,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:10:04,392 INFO L478 AbstractCegarLoop]: Abstraction has 438 states and 596 transitions. [2022-04-08 10:10:04,392 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-08 10:10:04,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 438 states and 596 transitions. [2022-04-08 10:10:07,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 596 edges. 596 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:07,690 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 596 transitions. [2022-04-08 10:10:07,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 10:10:07,690 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:10:07,690 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:10:07,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Forceful destruction successful, exit code 0 [2022-04-08 10:10:07,890 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:07,891 INFO L403 AbstractCegarLoop]: === Iteration 74 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:10:07,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:10:07,891 INFO L85 PathProgramCache]: Analyzing trace with hash -73295272, now seen corresponding path program 29 times [2022-04-08 10:10:07,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:07,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1678045732] [2022-04-08 10:10:07,893 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:10:07,893 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:10:07,893 INFO L85 PathProgramCache]: Analyzing trace with hash -73295272, now seen corresponding path program 30 times [2022-04-08 10:10:07,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:10:07,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383890898] [2022-04-08 10:10:07,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:10:07,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:10:07,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:08,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:10:08,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:08,188 INFO L290 TraceCheckUtils]: 0: Hoare triple {125429#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {125408#true} is VALID [2022-04-08 10:10:08,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {125408#true} assume true; {125408#true} is VALID [2022-04-08 10:10:08,188 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {125408#true} {125408#true} #72#return; {125408#true} is VALID [2022-04-08 10:10:08,189 INFO L272 TraceCheckUtils]: 0: Hoare triple {125408#true} call ULTIMATE.init(); {125429#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:10:08,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {125429#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {125408#true} is VALID [2022-04-08 10:10:08,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {125408#true} assume true; {125408#true} is VALID [2022-04-08 10:10:08,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {125408#true} {125408#true} #72#return; {125408#true} is VALID [2022-04-08 10:10:08,189 INFO L272 TraceCheckUtils]: 4: Hoare triple {125408#true} call #t~ret13 := main(); {125408#true} is VALID [2022-04-08 10:10:08,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {125408#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {125408#true} is VALID [2022-04-08 10:10:08,190 INFO L290 TraceCheckUtils]: 6: Hoare triple {125408#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125413#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:10:08,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {125413#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125414#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-08 10:10:08,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {125414#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125415#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:10:08,192 INFO L290 TraceCheckUtils]: 9: Hoare triple {125415#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125416#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:10:08,193 INFO L290 TraceCheckUtils]: 10: Hoare triple {125416#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125417#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:10:08,196 INFO L290 TraceCheckUtils]: 11: Hoare triple {125417#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125418#(<= main_~x~0 (+ 4294967289 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:10:08,197 INFO L290 TraceCheckUtils]: 12: Hoare triple {125418#(<= main_~x~0 (+ 4294967289 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125419#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:10:08,197 INFO L290 TraceCheckUtils]: 13: Hoare triple {125419#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125420#(<= (* (div (+ main_~x~0 8) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:10:08,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {125420#(<= (* (div (+ main_~x~0 8) 4294967296) 4294967296) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {125420#(<= (* (div (+ main_~x~0 8) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:10:08,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {125420#(<= (* (div (+ main_~x~0 8) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {125420#(<= (* (div (+ main_~x~0 8) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-08 10:10:08,199 INFO L290 TraceCheckUtils]: 16: Hoare triple {125420#(<= (* (div (+ main_~x~0 8) 4294967296) 4294967296) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {125421#(<= (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-08 10:10:08,199 INFO L290 TraceCheckUtils]: 17: Hoare triple {125421#(<= (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {125422#(<= (+ 2 (* 4294967296 (div (+ main_~x~0 6) 4294967296))) main_~x~0)} is VALID [2022-04-08 10:10:08,200 INFO L290 TraceCheckUtils]: 18: Hoare triple {125422#(<= (+ 2 (* 4294967296 (div (+ main_~x~0 6) 4294967296))) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {125423#(<= (+ 3 (* (div (+ 5 main_~x~0) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:10:08,201 INFO L290 TraceCheckUtils]: 19: Hoare triple {125423#(<= (+ 3 (* (div (+ 5 main_~x~0) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {125424#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-08 10:10:08,201 INFO L290 TraceCheckUtils]: 20: Hoare triple {125424#(<= (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) 4) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {125425#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 5) main_~x~0)} is VALID [2022-04-08 10:10:08,202 INFO L290 TraceCheckUtils]: 21: Hoare triple {125425#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 5) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {125426#(<= (+ 6 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:10:08,203 INFO L290 TraceCheckUtils]: 22: Hoare triple {125426#(<= (+ 6 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {125427#(<= (+ 7 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:10:08,203 INFO L290 TraceCheckUtils]: 23: Hoare triple {125427#(<= (+ 7 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {125428#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:10:08,204 INFO L290 TraceCheckUtils]: 24: Hoare triple {125428#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {125428#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:10:08,204 INFO L290 TraceCheckUtils]: 25: Hoare triple {125428#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {125428#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:10:08,204 INFO L290 TraceCheckUtils]: 26: Hoare triple {125428#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {125428#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:10:08,205 INFO L290 TraceCheckUtils]: 27: Hoare triple {125428#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {125428#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:10:08,205 INFO L290 TraceCheckUtils]: 28: Hoare triple {125428#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {125428#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:10:08,205 INFO L290 TraceCheckUtils]: 29: Hoare triple {125428#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {125428#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:10:08,206 INFO L290 TraceCheckUtils]: 30: Hoare triple {125428#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {125428#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:10:08,206 INFO L290 TraceCheckUtils]: 31: Hoare triple {125428#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {125428#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:10:08,206 INFO L290 TraceCheckUtils]: 32: Hoare triple {125428#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {125428#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:10:08,207 INFO L290 TraceCheckUtils]: 33: Hoare triple {125428#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {125428#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:10:08,207 INFO L290 TraceCheckUtils]: 34: Hoare triple {125428#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {125409#false} is VALID [2022-04-08 10:10:08,207 INFO L272 TraceCheckUtils]: 35: Hoare triple {125409#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {125409#false} is VALID [2022-04-08 10:10:08,207 INFO L290 TraceCheckUtils]: 36: Hoare triple {125409#false} ~cond := #in~cond; {125409#false} is VALID [2022-04-08 10:10:08,207 INFO L290 TraceCheckUtils]: 37: Hoare triple {125409#false} assume 0 == ~cond; {125409#false} is VALID [2022-04-08 10:10:08,207 INFO L290 TraceCheckUtils]: 38: Hoare triple {125409#false} assume !false; {125409#false} is VALID [2022-04-08 10:10:08,208 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 10:10:08,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:10:08,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383890898] [2022-04-08 10:10:08,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383890898] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:10:08,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019788631] [2022-04-08 10:10:08,208 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:10:08,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:08,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:10:08,209 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:10:08,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2022-04-08 10:10:08,325 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 10:10:08,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:10:08,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 10:10:08,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:08,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:10:08,761 INFO L272 TraceCheckUtils]: 0: Hoare triple {125408#true} call ULTIMATE.init(); {125408#true} is VALID [2022-04-08 10:10:08,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {125408#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {125408#true} is VALID [2022-04-08 10:10:08,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {125408#true} assume true; {125408#true} is VALID [2022-04-08 10:10:08,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {125408#true} {125408#true} #72#return; {125408#true} is VALID [2022-04-08 10:10:08,761 INFO L272 TraceCheckUtils]: 4: Hoare triple {125408#true} call #t~ret13 := main(); {125408#true} is VALID [2022-04-08 10:10:08,761 INFO L290 TraceCheckUtils]: 5: Hoare triple {125408#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {125408#true} is VALID [2022-04-08 10:10:08,761 INFO L290 TraceCheckUtils]: 6: Hoare triple {125408#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125408#true} is VALID [2022-04-08 10:10:08,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {125408#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125408#true} is VALID [2022-04-08 10:10:08,762 INFO L290 TraceCheckUtils]: 8: Hoare triple {125408#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125408#true} is VALID [2022-04-08 10:10:08,762 INFO L290 TraceCheckUtils]: 9: Hoare triple {125408#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125408#true} is VALID [2022-04-08 10:10:08,762 INFO L290 TraceCheckUtils]: 10: Hoare triple {125408#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125408#true} is VALID [2022-04-08 10:10:08,762 INFO L290 TraceCheckUtils]: 11: Hoare triple {125408#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125408#true} is VALID [2022-04-08 10:10:08,762 INFO L290 TraceCheckUtils]: 12: Hoare triple {125408#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125408#true} is VALID [2022-04-08 10:10:08,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {125408#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125408#true} is VALID [2022-04-08 10:10:08,764 INFO L290 TraceCheckUtils]: 14: Hoare triple {125408#true} assume !(~x~0 % 4294967296 > 0); {125475#(not (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-08 10:10:08,764 INFO L290 TraceCheckUtils]: 15: Hoare triple {125475#(not (< 0 (mod main_~x~0 4294967296)))} ~z~0 := ~y~0; {125475#(not (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-08 10:10:08,765 INFO L290 TraceCheckUtils]: 16: Hoare triple {125475#(not (< 0 (mod main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {125482#(not (< 0 (mod (+ main_~x~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:10:08,765 INFO L290 TraceCheckUtils]: 17: Hoare triple {125482#(not (< 0 (mod (+ main_~x~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {125486#(not (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-08 10:10:08,766 INFO L290 TraceCheckUtils]: 18: Hoare triple {125486#(not (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {125490#(not (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:10:08,767 INFO L290 TraceCheckUtils]: 19: Hoare triple {125490#(not (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {125494#(not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:10:08,767 INFO L290 TraceCheckUtils]: 20: Hoare triple {125494#(not (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {125498#(not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:10:08,768 INFO L290 TraceCheckUtils]: 21: Hoare triple {125498#(not (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {125502#(not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:10:08,769 INFO L290 TraceCheckUtils]: 22: Hoare triple {125502#(not (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {125506#(not (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} is VALID [2022-04-08 10:10:08,769 INFO L290 TraceCheckUtils]: 23: Hoare triple {125506#(not (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {125510#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:10:08,770 INFO L290 TraceCheckUtils]: 24: Hoare triple {125510#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {125510#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:10:08,770 INFO L290 TraceCheckUtils]: 25: Hoare triple {125510#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {125510#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:10:08,770 INFO L290 TraceCheckUtils]: 26: Hoare triple {125510#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {125510#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:10:08,770 INFO L290 TraceCheckUtils]: 27: Hoare triple {125510#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {125510#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:10:08,771 INFO L290 TraceCheckUtils]: 28: Hoare triple {125510#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {125510#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:10:08,771 INFO L290 TraceCheckUtils]: 29: Hoare triple {125510#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {125510#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:10:08,771 INFO L290 TraceCheckUtils]: 30: Hoare triple {125510#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {125510#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:10:08,772 INFO L290 TraceCheckUtils]: 31: Hoare triple {125510#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {125510#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:10:08,772 INFO L290 TraceCheckUtils]: 32: Hoare triple {125510#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {125510#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:10:08,772 INFO L290 TraceCheckUtils]: 33: Hoare triple {125510#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {125510#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:10:08,772 INFO L290 TraceCheckUtils]: 34: Hoare triple {125510#(not (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {125409#false} is VALID [2022-04-08 10:10:08,773 INFO L272 TraceCheckUtils]: 35: Hoare triple {125409#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {125409#false} is VALID [2022-04-08 10:10:08,773 INFO L290 TraceCheckUtils]: 36: Hoare triple {125409#false} ~cond := #in~cond; {125409#false} is VALID [2022-04-08 10:10:08,773 INFO L290 TraceCheckUtils]: 37: Hoare triple {125409#false} assume 0 == ~cond; {125409#false} is VALID [2022-04-08 10:10:08,773 INFO L290 TraceCheckUtils]: 38: Hoare triple {125409#false} assume !false; {125409#false} is VALID [2022-04-08 10:10:08,773 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-08 10:10:08,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:10:08,986 INFO L290 TraceCheckUtils]: 38: Hoare triple {125409#false} assume !false; {125409#false} is VALID [2022-04-08 10:10:08,986 INFO L290 TraceCheckUtils]: 37: Hoare triple {125409#false} assume 0 == ~cond; {125409#false} is VALID [2022-04-08 10:10:08,986 INFO L290 TraceCheckUtils]: 36: Hoare triple {125409#false} ~cond := #in~cond; {125409#false} is VALID [2022-04-08 10:10:08,986 INFO L272 TraceCheckUtils]: 35: Hoare triple {125409#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {125409#false} is VALID [2022-04-08 10:10:08,986 INFO L290 TraceCheckUtils]: 34: Hoare triple {125568#(< 0 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {125409#false} is VALID [2022-04-08 10:10:08,987 INFO L290 TraceCheckUtils]: 33: Hoare triple {125568#(< 0 (mod main_~x~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {125568#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:08,987 INFO L290 TraceCheckUtils]: 32: Hoare triple {125568#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {125568#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:08,987 INFO L290 TraceCheckUtils]: 31: Hoare triple {125568#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {125568#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:08,988 INFO L290 TraceCheckUtils]: 30: Hoare triple {125568#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {125568#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:08,989 INFO L290 TraceCheckUtils]: 29: Hoare triple {125568#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {125568#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:08,989 INFO L290 TraceCheckUtils]: 28: Hoare triple {125568#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {125568#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:08,990 INFO L290 TraceCheckUtils]: 27: Hoare triple {125568#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {125568#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:08,990 INFO L290 TraceCheckUtils]: 26: Hoare triple {125568#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {125568#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:08,990 INFO L290 TraceCheckUtils]: 25: Hoare triple {125568#(< 0 (mod main_~x~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {125568#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:08,990 INFO L290 TraceCheckUtils]: 24: Hoare triple {125568#(< 0 (mod main_~x~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {125568#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:08,991 INFO L290 TraceCheckUtils]: 23: Hoare triple {125413#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {125568#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-08 10:10:08,992 INFO L290 TraceCheckUtils]: 22: Hoare triple {125605#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {125413#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:10:08,993 INFO L290 TraceCheckUtils]: 21: Hoare triple {125609#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {125605#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:10:08,993 INFO L290 TraceCheckUtils]: 20: Hoare triple {125613#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {125609#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:08,994 INFO L290 TraceCheckUtils]: 19: Hoare triple {125617#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {125613#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:10:08,995 INFO L290 TraceCheckUtils]: 18: Hoare triple {125621#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {125617#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:10:08,995 INFO L290 TraceCheckUtils]: 17: Hoare triple {125625#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {125621#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-08 10:10:08,996 INFO L290 TraceCheckUtils]: 16: Hoare triple {125629#(<= main_~x~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967287))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {125625#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-08 10:10:08,996 INFO L290 TraceCheckUtils]: 15: Hoare triple {125629#(<= main_~x~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967287))} ~z~0 := ~y~0; {125629#(<= main_~x~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967287))} is VALID [2022-04-08 10:10:08,997 INFO L290 TraceCheckUtils]: 14: Hoare triple {125408#true} assume !(~x~0 % 4294967296 > 0); {125629#(<= main_~x~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967287))} is VALID [2022-04-08 10:10:08,997 INFO L290 TraceCheckUtils]: 13: Hoare triple {125408#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125408#true} is VALID [2022-04-08 10:10:08,997 INFO L290 TraceCheckUtils]: 12: Hoare triple {125408#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125408#true} is VALID [2022-04-08 10:10:08,997 INFO L290 TraceCheckUtils]: 11: Hoare triple {125408#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125408#true} is VALID [2022-04-08 10:10:08,997 INFO L290 TraceCheckUtils]: 10: Hoare triple {125408#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125408#true} is VALID [2022-04-08 10:10:08,997 INFO L290 TraceCheckUtils]: 9: Hoare triple {125408#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125408#true} is VALID [2022-04-08 10:10:08,997 INFO L290 TraceCheckUtils]: 8: Hoare triple {125408#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125408#true} is VALID [2022-04-08 10:10:08,997 INFO L290 TraceCheckUtils]: 7: Hoare triple {125408#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125408#true} is VALID [2022-04-08 10:10:08,997 INFO L290 TraceCheckUtils]: 6: Hoare triple {125408#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {125408#true} is VALID [2022-04-08 10:10:08,998 INFO L290 TraceCheckUtils]: 5: Hoare triple {125408#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {125408#true} is VALID [2022-04-08 10:10:08,998 INFO L272 TraceCheckUtils]: 4: Hoare triple {125408#true} call #t~ret13 := main(); {125408#true} is VALID [2022-04-08 10:10:08,998 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {125408#true} {125408#true} #72#return; {125408#true} is VALID [2022-04-08 10:10:08,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {125408#true} assume true; {125408#true} is VALID [2022-04-08 10:10:08,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {125408#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {125408#true} is VALID [2022-04-08 10:10:08,998 INFO L272 TraceCheckUtils]: 0: Hoare triple {125408#true} call ULTIMATE.init(); {125408#true} is VALID [2022-04-08 10:10:08,998 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-08 10:10:08,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019788631] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:10:08,998 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:10:08,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11, 11] total 36 [2022-04-08 10:10:08,998 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:10:08,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1678045732] [2022-04-08 10:10:08,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1678045732] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:10:08,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:10:08,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 10:10:08,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669939021] [2022-04-08 10:10:08,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:10:08,999 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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 39 [2022-04-08 10:10:08,999 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:10:08,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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-08 10:10:09,026 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:09,026 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 10:10:09,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:09,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 10:10:09,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=899, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 10:10:09,026 INFO L87 Difference]: Start difference. First operand 438 states and 596 transitions. Second operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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-08 10:10:12,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:12,712 INFO L93 Difference]: Finished difference Result 515 states and 706 transitions. [2022-04-08 10:10:12,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 10:10:12,712 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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 39 [2022-04-08 10:10:12,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:10:12,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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-08 10:10:12,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 101 transitions. [2022-04-08 10:10:12,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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-08 10:10:12,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 101 transitions. [2022-04-08 10:10:12,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 101 transitions. [2022-04-08 10:10:12,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:12,809 INFO L225 Difference]: With dead ends: 515 [2022-04-08 10:10:12,809 INFO L226 Difference]: Without dead ends: 510 [2022-04-08 10:10:12,809 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=594, Invalid=2058, Unknown=0, NotChecked=0, Total=2652 [2022-04-08 10:10:12,812 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 102 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:10:12,812 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 51 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 10:10:12,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-04-08 10:10:15,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 481. [2022-04-08 10:10:15,017 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:10:15,017 INFO L82 GeneralOperation]: Start isEquivalent. First operand 510 states. Second operand has 481 states, 476 states have (on average 1.3718487394957983) internal successors, (653), 476 states have internal predecessors, (653), 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-08 10:10:15,018 INFO L74 IsIncluded]: Start isIncluded. First operand 510 states. Second operand has 481 states, 476 states have (on average 1.3718487394957983) internal successors, (653), 476 states have internal predecessors, (653), 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-08 10:10:15,018 INFO L87 Difference]: Start difference. First operand 510 states. Second operand has 481 states, 476 states have (on average 1.3718487394957983) internal successors, (653), 476 states have internal predecessors, (653), 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-08 10:10:15,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:15,026 INFO L93 Difference]: Finished difference Result 510 states and 694 transitions. [2022-04-08 10:10:15,026 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 694 transitions. [2022-04-08 10:10:15,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:15,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:15,027 INFO L74 IsIncluded]: Start isIncluded. First operand has 481 states, 476 states have (on average 1.3718487394957983) internal successors, (653), 476 states have internal predecessors, (653), 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 510 states. [2022-04-08 10:10:15,027 INFO L87 Difference]: Start difference. First operand has 481 states, 476 states have (on average 1.3718487394957983) internal successors, (653), 476 states have internal predecessors, (653), 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 510 states. [2022-04-08 10:10:15,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:15,034 INFO L93 Difference]: Finished difference Result 510 states and 694 transitions. [2022-04-08 10:10:15,034 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 694 transitions. [2022-04-08 10:10:15,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:15,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:15,035 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:10:15,035 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:10:15,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 476 states have (on average 1.3718487394957983) internal successors, (653), 476 states have internal predecessors, (653), 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-08 10:10:15,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 657 transitions. [2022-04-08 10:10:15,044 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 657 transitions. Word has length 39 [2022-04-08 10:10:15,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:10:15,044 INFO L478 AbstractCegarLoop]: Abstraction has 481 states and 657 transitions. [2022-04-08 10:10:15,044 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 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-08 10:10:15,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 481 states and 657 transitions. [2022-04-08 10:10:18,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 657 edges. 657 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:18,264 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 657 transitions. [2022-04-08 10:10:18,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 10:10:18,264 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:10:18,264 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:10:18,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Forceful destruction successful, exit code 0 [2022-04-08 10:10:18,481 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,72 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:18,482 INFO L403 AbstractCegarLoop]: === Iteration 75 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:10:18,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:10:18,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1172865272, now seen corresponding path program 67 times [2022-04-08 10:10:18,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:18,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [279533335] [2022-04-08 10:10:18,484 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:10:18,484 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:10:18,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1172865272, now seen corresponding path program 68 times [2022-04-08 10:10:18,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:10:18,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83097819] [2022-04-08 10:10:18,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:10:18,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:10:18,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:18,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:10:18,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:18,675 INFO L290 TraceCheckUtils]: 0: Hoare triple {128743#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {128724#true} is VALID [2022-04-08 10:10:18,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {128724#true} assume true; {128724#true} is VALID [2022-04-08 10:10:18,675 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {128724#true} {128724#true} #72#return; {128724#true} is VALID [2022-04-08 10:10:18,676 INFO L272 TraceCheckUtils]: 0: Hoare triple {128724#true} call ULTIMATE.init(); {128743#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:10:18,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {128743#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {128724#true} is VALID [2022-04-08 10:10:18,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {128724#true} assume true; {128724#true} is VALID [2022-04-08 10:10:18,676 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {128724#true} {128724#true} #72#return; {128724#true} is VALID [2022-04-08 10:10:18,676 INFO L272 TraceCheckUtils]: 4: Hoare triple {128724#true} call #t~ret13 := main(); {128724#true} is VALID [2022-04-08 10:10:18,676 INFO L290 TraceCheckUtils]: 5: Hoare triple {128724#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {128729#(= main_~y~0 0)} is VALID [2022-04-08 10:10:18,677 INFO L290 TraceCheckUtils]: 6: Hoare triple {128729#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128730#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:18,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {128730#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128731#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:18,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {128731#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128732#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:18,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {128732#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128733#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:18,679 INFO L290 TraceCheckUtils]: 10: Hoare triple {128733#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128734#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:18,679 INFO L290 TraceCheckUtils]: 11: Hoare triple {128734#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128735#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:18,680 INFO L290 TraceCheckUtils]: 12: Hoare triple {128735#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128736#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:18,680 INFO L290 TraceCheckUtils]: 13: Hoare triple {128736#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128737#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:10:18,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {128737#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128738#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:10:18,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {128738#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {128738#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:10:18,681 INFO L290 TraceCheckUtils]: 16: Hoare triple {128738#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {128739#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:10:18,682 INFO L290 TraceCheckUtils]: 17: Hoare triple {128739#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {128740#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:10:18,682 INFO L290 TraceCheckUtils]: 18: Hoare triple {128740#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {128741#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:10:18,683 INFO L290 TraceCheckUtils]: 19: Hoare triple {128741#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {128742#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-08 10:10:18,683 INFO L290 TraceCheckUtils]: 20: Hoare triple {128742#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {128725#false} is VALID [2022-04-08 10:10:18,683 INFO L290 TraceCheckUtils]: 21: Hoare triple {128725#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {128725#false} is VALID [2022-04-08 10:10:18,683 INFO L290 TraceCheckUtils]: 22: Hoare triple {128725#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {128725#false} is VALID [2022-04-08 10:10:18,683 INFO L290 TraceCheckUtils]: 23: Hoare triple {128725#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {128725#false} is VALID [2022-04-08 10:10:18,684 INFO L290 TraceCheckUtils]: 24: Hoare triple {128725#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {128725#false} is VALID [2022-04-08 10:10:18,684 INFO L290 TraceCheckUtils]: 25: Hoare triple {128725#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {128725#false} is VALID [2022-04-08 10:10:18,684 INFO L290 TraceCheckUtils]: 26: Hoare triple {128725#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {128725#false} is VALID [2022-04-08 10:10:18,684 INFO L290 TraceCheckUtils]: 27: Hoare triple {128725#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {128725#false} is VALID [2022-04-08 10:10:18,684 INFO L290 TraceCheckUtils]: 28: Hoare triple {128725#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {128725#false} is VALID [2022-04-08 10:10:18,684 INFO L290 TraceCheckUtils]: 29: Hoare triple {128725#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {128725#false} is VALID [2022-04-08 10:10:18,684 INFO L290 TraceCheckUtils]: 30: Hoare triple {128725#false} assume !(~y~0 % 4294967296 > 0); {128725#false} is VALID [2022-04-08 10:10:18,684 INFO L290 TraceCheckUtils]: 31: Hoare triple {128725#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {128725#false} is VALID [2022-04-08 10:10:18,684 INFO L290 TraceCheckUtils]: 32: Hoare triple {128725#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {128725#false} is VALID [2022-04-08 10:10:18,684 INFO L290 TraceCheckUtils]: 33: Hoare triple {128725#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {128725#false} is VALID [2022-04-08 10:10:18,684 INFO L290 TraceCheckUtils]: 34: Hoare triple {128725#false} assume !(~x~0 % 4294967296 > 0); {128725#false} is VALID [2022-04-08 10:10:18,684 INFO L272 TraceCheckUtils]: 35: Hoare triple {128725#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {128725#false} is VALID [2022-04-08 10:10:18,684 INFO L290 TraceCheckUtils]: 36: Hoare triple {128725#false} ~cond := #in~cond; {128725#false} is VALID [2022-04-08 10:10:18,684 INFO L290 TraceCheckUtils]: 37: Hoare triple {128725#false} assume 0 == ~cond; {128725#false} is VALID [2022-04-08 10:10:18,684 INFO L290 TraceCheckUtils]: 38: Hoare triple {128725#false} assume !false; {128725#false} is VALID [2022-04-08 10:10:18,684 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-04-08 10:10:18,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:10:18,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83097819] [2022-04-08 10:10:18,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83097819] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:10:18,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469934798] [2022-04-08 10:10:18,685 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:10:18,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:18,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:10:18,686 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:10:18,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2022-04-08 10:10:18,731 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:10:18,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:10:18,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 10:10:18,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:18,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:10:19,013 INFO L272 TraceCheckUtils]: 0: Hoare triple {128724#true} call ULTIMATE.init(); {128724#true} is VALID [2022-04-08 10:10:19,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {128724#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {128724#true} is VALID [2022-04-08 10:10:19,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {128724#true} assume true; {128724#true} is VALID [2022-04-08 10:10:19,013 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {128724#true} {128724#true} #72#return; {128724#true} is VALID [2022-04-08 10:10:19,013 INFO L272 TraceCheckUtils]: 4: Hoare triple {128724#true} call #t~ret13 := main(); {128724#true} is VALID [2022-04-08 10:10:19,014 INFO L290 TraceCheckUtils]: 5: Hoare triple {128724#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {128729#(= main_~y~0 0)} is VALID [2022-04-08 10:10:19,014 INFO L290 TraceCheckUtils]: 6: Hoare triple {128729#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128730#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:19,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {128730#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128731#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:19,015 INFO L290 TraceCheckUtils]: 8: Hoare triple {128731#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128732#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:19,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {128732#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128733#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:19,016 INFO L290 TraceCheckUtils]: 10: Hoare triple {128733#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128734#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:19,017 INFO L290 TraceCheckUtils]: 11: Hoare triple {128734#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128735#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:19,017 INFO L290 TraceCheckUtils]: 12: Hoare triple {128735#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128736#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:19,018 INFO L290 TraceCheckUtils]: 13: Hoare triple {128736#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128737#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:10:19,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {128737#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128738#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:10:19,019 INFO L290 TraceCheckUtils]: 15: Hoare triple {128738#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {128738#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:10:19,019 INFO L290 TraceCheckUtils]: 16: Hoare triple {128738#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {128739#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:10:19,019 INFO L290 TraceCheckUtils]: 17: Hoare triple {128739#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {128740#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:10:19,020 INFO L290 TraceCheckUtils]: 18: Hoare triple {128740#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {128741#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:10:19,020 INFO L290 TraceCheckUtils]: 19: Hoare triple {128741#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {128804#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:10:19,021 INFO L290 TraceCheckUtils]: 20: Hoare triple {128804#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {128725#false} is VALID [2022-04-08 10:10:19,021 INFO L290 TraceCheckUtils]: 21: Hoare triple {128725#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {128725#false} is VALID [2022-04-08 10:10:19,021 INFO L290 TraceCheckUtils]: 22: Hoare triple {128725#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {128725#false} is VALID [2022-04-08 10:10:19,021 INFO L290 TraceCheckUtils]: 23: Hoare triple {128725#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {128725#false} is VALID [2022-04-08 10:10:19,021 INFO L290 TraceCheckUtils]: 24: Hoare triple {128725#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {128725#false} is VALID [2022-04-08 10:10:19,021 INFO L290 TraceCheckUtils]: 25: Hoare triple {128725#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {128725#false} is VALID [2022-04-08 10:10:19,021 INFO L290 TraceCheckUtils]: 26: Hoare triple {128725#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {128725#false} is VALID [2022-04-08 10:10:19,021 INFO L290 TraceCheckUtils]: 27: Hoare triple {128725#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {128725#false} is VALID [2022-04-08 10:10:19,021 INFO L290 TraceCheckUtils]: 28: Hoare triple {128725#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {128725#false} is VALID [2022-04-08 10:10:19,021 INFO L290 TraceCheckUtils]: 29: Hoare triple {128725#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {128725#false} is VALID [2022-04-08 10:10:19,021 INFO L290 TraceCheckUtils]: 30: Hoare triple {128725#false} assume !(~y~0 % 4294967296 > 0); {128725#false} is VALID [2022-04-08 10:10:19,021 INFO L290 TraceCheckUtils]: 31: Hoare triple {128725#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {128725#false} is VALID [2022-04-08 10:10:19,021 INFO L290 TraceCheckUtils]: 32: Hoare triple {128725#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {128725#false} is VALID [2022-04-08 10:10:19,021 INFO L290 TraceCheckUtils]: 33: Hoare triple {128725#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {128725#false} is VALID [2022-04-08 10:10:19,021 INFO L290 TraceCheckUtils]: 34: Hoare triple {128725#false} assume !(~x~0 % 4294967296 > 0); {128725#false} is VALID [2022-04-08 10:10:19,022 INFO L272 TraceCheckUtils]: 35: Hoare triple {128725#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {128725#false} is VALID [2022-04-08 10:10:19,022 INFO L290 TraceCheckUtils]: 36: Hoare triple {128725#false} ~cond := #in~cond; {128725#false} is VALID [2022-04-08 10:10:19,022 INFO L290 TraceCheckUtils]: 37: Hoare triple {128725#false} assume 0 == ~cond; {128725#false} is VALID [2022-04-08 10:10:19,022 INFO L290 TraceCheckUtils]: 38: Hoare triple {128725#false} assume !false; {128725#false} is VALID [2022-04-08 10:10:19,022 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-04-08 10:10:19,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:10:19,390 INFO L290 TraceCheckUtils]: 38: Hoare triple {128725#false} assume !false; {128725#false} is VALID [2022-04-08 10:10:19,390 INFO L290 TraceCheckUtils]: 37: Hoare triple {128725#false} assume 0 == ~cond; {128725#false} is VALID [2022-04-08 10:10:19,390 INFO L290 TraceCheckUtils]: 36: Hoare triple {128725#false} ~cond := #in~cond; {128725#false} is VALID [2022-04-08 10:10:19,390 INFO L272 TraceCheckUtils]: 35: Hoare triple {128725#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {128725#false} is VALID [2022-04-08 10:10:19,390 INFO L290 TraceCheckUtils]: 34: Hoare triple {128725#false} assume !(~x~0 % 4294967296 > 0); {128725#false} is VALID [2022-04-08 10:10:19,390 INFO L290 TraceCheckUtils]: 33: Hoare triple {128725#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {128725#false} is VALID [2022-04-08 10:10:19,390 INFO L290 TraceCheckUtils]: 32: Hoare triple {128725#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {128725#false} is VALID [2022-04-08 10:10:19,390 INFO L290 TraceCheckUtils]: 31: Hoare triple {128725#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {128725#false} is VALID [2022-04-08 10:10:19,390 INFO L290 TraceCheckUtils]: 30: Hoare triple {128725#false} assume !(~y~0 % 4294967296 > 0); {128725#false} is VALID [2022-04-08 10:10:19,390 INFO L290 TraceCheckUtils]: 29: Hoare triple {128725#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {128725#false} is VALID [2022-04-08 10:10:19,390 INFO L290 TraceCheckUtils]: 28: Hoare triple {128725#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {128725#false} is VALID [2022-04-08 10:10:19,390 INFO L290 TraceCheckUtils]: 27: Hoare triple {128725#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {128725#false} is VALID [2022-04-08 10:10:19,390 INFO L290 TraceCheckUtils]: 26: Hoare triple {128725#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {128725#false} is VALID [2022-04-08 10:10:19,391 INFO L290 TraceCheckUtils]: 25: Hoare triple {128725#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {128725#false} is VALID [2022-04-08 10:10:19,391 INFO L290 TraceCheckUtils]: 24: Hoare triple {128725#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {128725#false} is VALID [2022-04-08 10:10:19,391 INFO L290 TraceCheckUtils]: 23: Hoare triple {128725#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {128725#false} is VALID [2022-04-08 10:10:19,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {128725#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {128725#false} is VALID [2022-04-08 10:10:19,391 INFO L290 TraceCheckUtils]: 21: Hoare triple {128725#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {128725#false} is VALID [2022-04-08 10:10:19,391 INFO L290 TraceCheckUtils]: 20: Hoare triple {128916#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {128725#false} is VALID [2022-04-08 10:10:19,392 INFO L290 TraceCheckUtils]: 19: Hoare triple {128920#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {128916#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:10:19,392 INFO L290 TraceCheckUtils]: 18: Hoare triple {128924#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {128920#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:10:19,393 INFO L290 TraceCheckUtils]: 17: Hoare triple {128928#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {128924#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:10:19,393 INFO L290 TraceCheckUtils]: 16: Hoare triple {128932#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {128928#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:10:19,394 INFO L290 TraceCheckUtils]: 15: Hoare triple {128932#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {128932#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:10:19,394 INFO L290 TraceCheckUtils]: 14: Hoare triple {128939#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128932#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:10:19,395 INFO L290 TraceCheckUtils]: 13: Hoare triple {128943#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128939#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:10:19,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {128947#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128943#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:10:19,396 INFO L290 TraceCheckUtils]: 11: Hoare triple {128951#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128947#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:10:19,397 INFO L290 TraceCheckUtils]: 10: Hoare triple {128955#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128951#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:10:19,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {128959#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128955#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:10:19,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {128963#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128959#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:10:19,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {128967#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128963#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:10:19,399 INFO L290 TraceCheckUtils]: 6: Hoare triple {128971#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {128967#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:19,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {128724#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {128971#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:10:19,400 INFO L272 TraceCheckUtils]: 4: Hoare triple {128724#true} call #t~ret13 := main(); {128724#true} is VALID [2022-04-08 10:10:19,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {128724#true} {128724#true} #72#return; {128724#true} is VALID [2022-04-08 10:10:19,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {128724#true} assume true; {128724#true} is VALID [2022-04-08 10:10:19,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {128724#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {128724#true} is VALID [2022-04-08 10:10:19,400 INFO L272 TraceCheckUtils]: 0: Hoare triple {128724#true} call ULTIMATE.init(); {128724#true} is VALID [2022-04-08 10:10:19,400 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-04-08 10:10:19,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469934798] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:10:19,400 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:10:19,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-08 10:10:19,400 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:10:19,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [279533335] [2022-04-08 10:10:19,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [279533335] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:10:19,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:10:19,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 10:10:19,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760078694] [2022-04-08 10:10:19,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:10:19,401 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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 39 [2022-04-08 10:10:19,401 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:10:19,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-08 10:10:19,420 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-08 10:10:19,420 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 10:10:19,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:19,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 10:10:19,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=811, Unknown=0, NotChecked=0, Total=992 [2022-04-08 10:10:19,420 INFO L87 Difference]: Start difference. First operand 481 states and 657 transitions. Second operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-08 10:10:25,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:25,289 INFO L93 Difference]: Finished difference Result 612 states and 797 transitions. [2022-04-08 10:10:25,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-08 10:10:25,289 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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 39 [2022-04-08 10:10:25,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:10:25,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-08 10:10:25,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 104 transitions. [2022-04-08 10:10:25,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-08 10:10:25,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 104 transitions. [2022-04-08 10:10:25,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 104 transitions. [2022-04-08 10:10:25,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:25,385 INFO L225 Difference]: With dead ends: 612 [2022-04-08 10:10:25,386 INFO L226 Difference]: Without dead ends: 593 [2022-04-08 10:10:25,386 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=529, Invalid=2123, Unknown=0, NotChecked=0, Total=2652 [2022-04-08 10:10:25,386 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 51 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:10:25,386 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 101 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 10:10:25,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2022-04-08 10:10:27,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 481. [2022-04-08 10:10:27,585 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:10:27,585 INFO L82 GeneralOperation]: Start isEquivalent. First operand 593 states. Second operand has 481 states, 476 states have (on average 1.3697478991596639) internal successors, (652), 476 states have internal predecessors, (652), 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-08 10:10:27,586 INFO L74 IsIncluded]: Start isIncluded. First operand 593 states. Second operand has 481 states, 476 states have (on average 1.3697478991596639) internal successors, (652), 476 states have internal predecessors, (652), 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-08 10:10:27,586 INFO L87 Difference]: Start difference. First operand 593 states. Second operand has 481 states, 476 states have (on average 1.3697478991596639) internal successors, (652), 476 states have internal predecessors, (652), 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-08 10:10:27,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:27,595 INFO L93 Difference]: Finished difference Result 593 states and 778 transitions. [2022-04-08 10:10:27,595 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 778 transitions. [2022-04-08 10:10:27,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:27,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:27,596 INFO L74 IsIncluded]: Start isIncluded. First operand has 481 states, 476 states have (on average 1.3697478991596639) internal successors, (652), 476 states have internal predecessors, (652), 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 593 states. [2022-04-08 10:10:27,596 INFO L87 Difference]: Start difference. First operand has 481 states, 476 states have (on average 1.3697478991596639) internal successors, (652), 476 states have internal predecessors, (652), 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 593 states. [2022-04-08 10:10:27,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:27,606 INFO L93 Difference]: Finished difference Result 593 states and 778 transitions. [2022-04-08 10:10:27,606 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 778 transitions. [2022-04-08 10:10:27,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:27,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:27,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:10:27,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:10:27,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 476 states have (on average 1.3697478991596639) internal successors, (652), 476 states have internal predecessors, (652), 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-08 10:10:27,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 656 transitions. [2022-04-08 10:10:27,615 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 656 transitions. Word has length 39 [2022-04-08 10:10:27,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:10:27,615 INFO L478 AbstractCegarLoop]: Abstraction has 481 states and 656 transitions. [2022-04-08 10:10:27,615 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-08 10:10:27,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 481 states and 656 transitions. [2022-04-08 10:10:33,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 656 edges. 655 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:33,428 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 656 transitions. [2022-04-08 10:10:33,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 10:10:33,429 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:10:33,429 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:10:33,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Forceful destruction successful, exit code 0 [2022-04-08 10:10:33,629 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable74 [2022-04-08 10:10:33,630 INFO L403 AbstractCegarLoop]: === Iteration 76 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:10:33,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:10:33,630 INFO L85 PathProgramCache]: Analyzing trace with hash 475466840, now seen corresponding path program 69 times [2022-04-08 10:10:33,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:33,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [456139861] [2022-04-08 10:10:33,632 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:10:33,632 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:10:33,632 INFO L85 PathProgramCache]: Analyzing trace with hash 475466840, now seen corresponding path program 70 times [2022-04-08 10:10:33,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:10:33,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48393109] [2022-04-08 10:10:33,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:10:33,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:10:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:33,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:10:33,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:33,855 INFO L290 TraceCheckUtils]: 0: Hoare triple {132423#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {132404#true} is VALID [2022-04-08 10:10:33,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {132404#true} assume true; {132404#true} is VALID [2022-04-08 10:10:33,855 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {132404#true} {132404#true} #72#return; {132404#true} is VALID [2022-04-08 10:10:33,856 INFO L272 TraceCheckUtils]: 0: Hoare triple {132404#true} call ULTIMATE.init(); {132423#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:10:33,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {132423#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {132404#true} is VALID [2022-04-08 10:10:33,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {132404#true} assume true; {132404#true} is VALID [2022-04-08 10:10:33,856 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {132404#true} {132404#true} #72#return; {132404#true} is VALID [2022-04-08 10:10:33,856 INFO L272 TraceCheckUtils]: 4: Hoare triple {132404#true} call #t~ret13 := main(); {132404#true} is VALID [2022-04-08 10:10:33,856 INFO L290 TraceCheckUtils]: 5: Hoare triple {132404#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {132409#(= main_~y~0 0)} is VALID [2022-04-08 10:10:33,857 INFO L290 TraceCheckUtils]: 6: Hoare triple {132409#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132410#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:33,857 INFO L290 TraceCheckUtils]: 7: Hoare triple {132410#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132411#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:33,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {132411#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132412#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:33,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {132412#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132413#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:33,859 INFO L290 TraceCheckUtils]: 10: Hoare triple {132413#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132414#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:33,859 INFO L290 TraceCheckUtils]: 11: Hoare triple {132414#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132415#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:33,860 INFO L290 TraceCheckUtils]: 12: Hoare triple {132415#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132416#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:33,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {132416#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132417#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:10:33,861 INFO L290 TraceCheckUtils]: 14: Hoare triple {132417#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132418#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:10:33,861 INFO L290 TraceCheckUtils]: 15: Hoare triple {132418#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132419#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:10:33,862 INFO L290 TraceCheckUtils]: 16: Hoare triple {132419#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {132419#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:10:33,862 INFO L290 TraceCheckUtils]: 17: Hoare triple {132419#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {132420#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:10:33,862 INFO L290 TraceCheckUtils]: 18: Hoare triple {132420#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {132421#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:10:33,863 INFO L290 TraceCheckUtils]: 19: Hoare triple {132421#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {132422#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:10:33,863 INFO L290 TraceCheckUtils]: 20: Hoare triple {132422#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {132405#false} is VALID [2022-04-08 10:10:33,864 INFO L290 TraceCheckUtils]: 21: Hoare triple {132405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {132405#false} is VALID [2022-04-08 10:10:33,864 INFO L290 TraceCheckUtils]: 22: Hoare triple {132405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {132405#false} is VALID [2022-04-08 10:10:33,864 INFO L290 TraceCheckUtils]: 23: Hoare triple {132405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {132405#false} is VALID [2022-04-08 10:10:33,864 INFO L290 TraceCheckUtils]: 24: Hoare triple {132405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {132405#false} is VALID [2022-04-08 10:10:33,864 INFO L290 TraceCheckUtils]: 25: Hoare triple {132405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {132405#false} is VALID [2022-04-08 10:10:33,864 INFO L290 TraceCheckUtils]: 26: Hoare triple {132405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {132405#false} is VALID [2022-04-08 10:10:33,864 INFO L290 TraceCheckUtils]: 27: Hoare triple {132405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {132405#false} is VALID [2022-04-08 10:10:33,864 INFO L290 TraceCheckUtils]: 28: Hoare triple {132405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {132405#false} is VALID [2022-04-08 10:10:33,864 INFO L290 TraceCheckUtils]: 29: Hoare triple {132405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {132405#false} is VALID [2022-04-08 10:10:33,864 INFO L290 TraceCheckUtils]: 30: Hoare triple {132405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {132405#false} is VALID [2022-04-08 10:10:33,864 INFO L290 TraceCheckUtils]: 31: Hoare triple {132405#false} assume !(~y~0 % 4294967296 > 0); {132405#false} is VALID [2022-04-08 10:10:33,864 INFO L290 TraceCheckUtils]: 32: Hoare triple {132405#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {132405#false} is VALID [2022-04-08 10:10:33,864 INFO L290 TraceCheckUtils]: 33: Hoare triple {132405#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {132405#false} is VALID [2022-04-08 10:10:33,864 INFO L290 TraceCheckUtils]: 34: Hoare triple {132405#false} assume !(~x~0 % 4294967296 > 0); {132405#false} is VALID [2022-04-08 10:10:33,864 INFO L272 TraceCheckUtils]: 35: Hoare triple {132405#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {132405#false} is VALID [2022-04-08 10:10:33,864 INFO L290 TraceCheckUtils]: 36: Hoare triple {132405#false} ~cond := #in~cond; {132405#false} is VALID [2022-04-08 10:10:33,864 INFO L290 TraceCheckUtils]: 37: Hoare triple {132405#false} assume 0 == ~cond; {132405#false} is VALID [2022-04-08 10:10:33,864 INFO L290 TraceCheckUtils]: 38: Hoare triple {132405#false} assume !false; {132405#false} is VALID [2022-04-08 10:10:33,865 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-04-08 10:10:33,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:10:33,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48393109] [2022-04-08 10:10:33,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48393109] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:10:33,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964034757] [2022-04-08 10:10:33,865 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:10:33,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:33,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:10:33,875 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:10:33,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2022-04-08 10:10:33,939 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:10:33,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:10:33,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 10:10:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:33,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:10:34,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {132404#true} call ULTIMATE.init(); {132404#true} is VALID [2022-04-08 10:10:34,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {132404#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {132404#true} is VALID [2022-04-08 10:10:34,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {132404#true} assume true; {132404#true} is VALID [2022-04-08 10:10:34,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {132404#true} {132404#true} #72#return; {132404#true} is VALID [2022-04-08 10:10:34,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {132404#true} call #t~ret13 := main(); {132404#true} is VALID [2022-04-08 10:10:34,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {132404#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {132409#(= main_~y~0 0)} is VALID [2022-04-08 10:10:34,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {132409#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132410#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:34,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {132410#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132411#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:34,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {132411#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132412#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:34,227 INFO L290 TraceCheckUtils]: 9: Hoare triple {132412#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132413#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:34,228 INFO L290 TraceCheckUtils]: 10: Hoare triple {132413#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132414#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:34,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {132414#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132415#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:34,229 INFO L290 TraceCheckUtils]: 12: Hoare triple {132415#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132416#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:34,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {132416#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132417#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:10:34,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {132417#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132418#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:10:34,230 INFO L290 TraceCheckUtils]: 15: Hoare triple {132418#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132419#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:10:34,230 INFO L290 TraceCheckUtils]: 16: Hoare triple {132419#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {132419#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:10:34,231 INFO L290 TraceCheckUtils]: 17: Hoare triple {132419#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {132420#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:10:34,231 INFO L290 TraceCheckUtils]: 18: Hoare triple {132420#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {132421#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:10:34,232 INFO L290 TraceCheckUtils]: 19: Hoare triple {132421#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {132484#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:10:34,232 INFO L290 TraceCheckUtils]: 20: Hoare triple {132484#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {132405#false} is VALID [2022-04-08 10:10:34,232 INFO L290 TraceCheckUtils]: 21: Hoare triple {132405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {132405#false} is VALID [2022-04-08 10:10:34,232 INFO L290 TraceCheckUtils]: 22: Hoare triple {132405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {132405#false} is VALID [2022-04-08 10:10:34,232 INFO L290 TraceCheckUtils]: 23: Hoare triple {132405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {132405#false} is VALID [2022-04-08 10:10:34,232 INFO L290 TraceCheckUtils]: 24: Hoare triple {132405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {132405#false} is VALID [2022-04-08 10:10:34,232 INFO L290 TraceCheckUtils]: 25: Hoare triple {132405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {132405#false} is VALID [2022-04-08 10:10:34,233 INFO L290 TraceCheckUtils]: 26: Hoare triple {132405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {132405#false} is VALID [2022-04-08 10:10:34,233 INFO L290 TraceCheckUtils]: 27: Hoare triple {132405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {132405#false} is VALID [2022-04-08 10:10:34,233 INFO L290 TraceCheckUtils]: 28: Hoare triple {132405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {132405#false} is VALID [2022-04-08 10:10:34,233 INFO L290 TraceCheckUtils]: 29: Hoare triple {132405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {132405#false} is VALID [2022-04-08 10:10:34,233 INFO L290 TraceCheckUtils]: 30: Hoare triple {132405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {132405#false} is VALID [2022-04-08 10:10:34,233 INFO L290 TraceCheckUtils]: 31: Hoare triple {132405#false} assume !(~y~0 % 4294967296 > 0); {132405#false} is VALID [2022-04-08 10:10:34,233 INFO L290 TraceCheckUtils]: 32: Hoare triple {132405#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {132405#false} is VALID [2022-04-08 10:10:34,233 INFO L290 TraceCheckUtils]: 33: Hoare triple {132405#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {132405#false} is VALID [2022-04-08 10:10:34,233 INFO L290 TraceCheckUtils]: 34: Hoare triple {132405#false} assume !(~x~0 % 4294967296 > 0); {132405#false} is VALID [2022-04-08 10:10:34,233 INFO L272 TraceCheckUtils]: 35: Hoare triple {132405#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {132405#false} is VALID [2022-04-08 10:10:34,233 INFO L290 TraceCheckUtils]: 36: Hoare triple {132405#false} ~cond := #in~cond; {132405#false} is VALID [2022-04-08 10:10:34,233 INFO L290 TraceCheckUtils]: 37: Hoare triple {132405#false} assume 0 == ~cond; {132405#false} is VALID [2022-04-08 10:10:34,233 INFO L290 TraceCheckUtils]: 38: Hoare triple {132405#false} assume !false; {132405#false} is VALID [2022-04-08 10:10:34,233 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-04-08 10:10:34,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:10:34,604 INFO L290 TraceCheckUtils]: 38: Hoare triple {132405#false} assume !false; {132405#false} is VALID [2022-04-08 10:10:34,604 INFO L290 TraceCheckUtils]: 37: Hoare triple {132405#false} assume 0 == ~cond; {132405#false} is VALID [2022-04-08 10:10:34,604 INFO L290 TraceCheckUtils]: 36: Hoare triple {132405#false} ~cond := #in~cond; {132405#false} is VALID [2022-04-08 10:10:34,604 INFO L272 TraceCheckUtils]: 35: Hoare triple {132405#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {132405#false} is VALID [2022-04-08 10:10:34,604 INFO L290 TraceCheckUtils]: 34: Hoare triple {132405#false} assume !(~x~0 % 4294967296 > 0); {132405#false} is VALID [2022-04-08 10:10:34,604 INFO L290 TraceCheckUtils]: 33: Hoare triple {132405#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {132405#false} is VALID [2022-04-08 10:10:34,604 INFO L290 TraceCheckUtils]: 32: Hoare triple {132405#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {132405#false} is VALID [2022-04-08 10:10:34,604 INFO L290 TraceCheckUtils]: 31: Hoare triple {132405#false} assume !(~y~0 % 4294967296 > 0); {132405#false} is VALID [2022-04-08 10:10:34,605 INFO L290 TraceCheckUtils]: 30: Hoare triple {132405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {132405#false} is VALID [2022-04-08 10:10:34,605 INFO L290 TraceCheckUtils]: 29: Hoare triple {132405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {132405#false} is VALID [2022-04-08 10:10:34,605 INFO L290 TraceCheckUtils]: 28: Hoare triple {132405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {132405#false} is VALID [2022-04-08 10:10:34,605 INFO L290 TraceCheckUtils]: 27: Hoare triple {132405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {132405#false} is VALID [2022-04-08 10:10:34,605 INFO L290 TraceCheckUtils]: 26: Hoare triple {132405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {132405#false} is VALID [2022-04-08 10:10:34,605 INFO L290 TraceCheckUtils]: 25: Hoare triple {132405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {132405#false} is VALID [2022-04-08 10:10:34,605 INFO L290 TraceCheckUtils]: 24: Hoare triple {132405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {132405#false} is VALID [2022-04-08 10:10:34,605 INFO L290 TraceCheckUtils]: 23: Hoare triple {132405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {132405#false} is VALID [2022-04-08 10:10:34,605 INFO L290 TraceCheckUtils]: 22: Hoare triple {132405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {132405#false} is VALID [2022-04-08 10:10:34,605 INFO L290 TraceCheckUtils]: 21: Hoare triple {132405#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {132405#false} is VALID [2022-04-08 10:10:34,605 INFO L290 TraceCheckUtils]: 20: Hoare triple {132596#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {132405#false} is VALID [2022-04-08 10:10:34,606 INFO L290 TraceCheckUtils]: 19: Hoare triple {132600#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {132596#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:10:34,607 INFO L290 TraceCheckUtils]: 18: Hoare triple {132604#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {132600#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:10:34,607 INFO L290 TraceCheckUtils]: 17: Hoare triple {132608#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {132604#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:10:34,607 INFO L290 TraceCheckUtils]: 16: Hoare triple {132608#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {132608#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:10:34,608 INFO L290 TraceCheckUtils]: 15: Hoare triple {132615#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132608#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:10:34,609 INFO L290 TraceCheckUtils]: 14: Hoare triple {132619#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132615#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:10:34,609 INFO L290 TraceCheckUtils]: 13: Hoare triple {132623#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132619#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:10:34,610 INFO L290 TraceCheckUtils]: 12: Hoare triple {132627#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132623#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:10:34,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {132631#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132627#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:10:34,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {132635#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132631#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:10:34,612 INFO L290 TraceCheckUtils]: 9: Hoare triple {132639#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132635#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:10:34,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {132643#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132639#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:34,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {132647#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132643#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:10:34,614 INFO L290 TraceCheckUtils]: 6: Hoare triple {132651#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {132647#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:10:34,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {132404#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {132651#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:10:34,614 INFO L272 TraceCheckUtils]: 4: Hoare triple {132404#true} call #t~ret13 := main(); {132404#true} is VALID [2022-04-08 10:10:34,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {132404#true} {132404#true} #72#return; {132404#true} is VALID [2022-04-08 10:10:34,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {132404#true} assume true; {132404#true} is VALID [2022-04-08 10:10:34,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {132404#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {132404#true} is VALID [2022-04-08 10:10:34,614 INFO L272 TraceCheckUtils]: 0: Hoare triple {132404#true} call ULTIMATE.init(); {132404#true} is VALID [2022-04-08 10:10:34,614 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-04-08 10:10:34,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964034757] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:10:34,615 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:10:34,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-08 10:10:34,615 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:10:34,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [456139861] [2022-04-08 10:10:34,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [456139861] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:10:34,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:10:34,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 10:10:34,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505421246] [2022-04-08 10:10:34,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:10:34,615 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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 39 [2022-04-08 10:10:34,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:10:34,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-08 10:10:34,634 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-08 10:10:34,634 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 10:10:34,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:34,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 10:10:34,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=798, Unknown=0, NotChecked=0, Total=992 [2022-04-08 10:10:34,635 INFO L87 Difference]: Start difference. First operand 481 states and 656 transitions. Second operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-08 10:10:40,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:40,633 INFO L93 Difference]: Finished difference Result 635 states and 820 transitions. [2022-04-08 10:10:40,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 10:10:40,633 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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 39 [2022-04-08 10:10:40,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:10:40,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-08 10:10:40,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 109 transitions. [2022-04-08 10:10:40,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-08 10:10:40,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 109 transitions. [2022-04-08 10:10:40,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 109 transitions. [2022-04-08 10:10:40,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:40,713 INFO L225 Difference]: With dead ends: 635 [2022-04-08 10:10:40,713 INFO L226 Difference]: Without dead ends: 616 [2022-04-08 10:10:40,713 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=482, Invalid=1870, Unknown=0, NotChecked=0, Total=2352 [2022-04-08 10:10:40,715 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 60 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:10:40,715 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 112 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 10:10:40,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2022-04-08 10:10:42,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 481. [2022-04-08 10:10:42,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:10:42,592 INFO L82 GeneralOperation]: Start isEquivalent. First operand 616 states. Second operand has 481 states, 476 states have (on average 1.3676470588235294) internal successors, (651), 476 states have internal predecessors, (651), 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-08 10:10:42,593 INFO L74 IsIncluded]: Start isIncluded. First operand 616 states. Second operand has 481 states, 476 states have (on average 1.3676470588235294) internal successors, (651), 476 states have internal predecessors, (651), 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-08 10:10:42,593 INFO L87 Difference]: Start difference. First operand 616 states. Second operand has 481 states, 476 states have (on average 1.3676470588235294) internal successors, (651), 476 states have internal predecessors, (651), 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-08 10:10:42,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:42,609 INFO L93 Difference]: Finished difference Result 616 states and 801 transitions. [2022-04-08 10:10:42,609 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 801 transitions. [2022-04-08 10:10:42,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:42,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:42,610 INFO L74 IsIncluded]: Start isIncluded. First operand has 481 states, 476 states have (on average 1.3676470588235294) internal successors, (651), 476 states have internal predecessors, (651), 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 616 states. [2022-04-08 10:10:42,610 INFO L87 Difference]: Start difference. First operand has 481 states, 476 states have (on average 1.3676470588235294) internal successors, (651), 476 states have internal predecessors, (651), 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 616 states. [2022-04-08 10:10:42,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:42,620 INFO L93 Difference]: Finished difference Result 616 states and 801 transitions. [2022-04-08 10:10:42,620 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 801 transitions. [2022-04-08 10:10:42,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:42,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:42,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:10:42,621 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:10:42,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 476 states have (on average 1.3676470588235294) internal successors, (651), 476 states have internal predecessors, (651), 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-08 10:10:42,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 655 transitions. [2022-04-08 10:10:42,630 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 655 transitions. Word has length 39 [2022-04-08 10:10:42,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:10:42,630 INFO L478 AbstractCegarLoop]: Abstraction has 481 states and 655 transitions. [2022-04-08 10:10:42,630 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-08 10:10:42,630 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 481 states and 655 transitions. [2022-04-08 10:10:46,286 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 655 edges. 655 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:46,287 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 655 transitions. [2022-04-08 10:10:46,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 10:10:46,287 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:10:46,287 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:10:46,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Forceful destruction successful, exit code 0 [2022-04-08 10:10:46,503 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75,74 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:46,503 INFO L403 AbstractCegarLoop]: === Iteration 77 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:10:46,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:10:46,503 INFO L85 PathProgramCache]: Analyzing trace with hash 944280840, now seen corresponding path program 71 times [2022-04-08 10:10:46,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:46,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [798078282] [2022-04-08 10:10:46,505 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:10:46,505 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:10:46,505 INFO L85 PathProgramCache]: Analyzing trace with hash 944280840, now seen corresponding path program 72 times [2022-04-08 10:10:46,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:10:46,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133852455] [2022-04-08 10:10:46,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:10:46,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:10:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:46,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:10:46,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:46,723 INFO L290 TraceCheckUtils]: 0: Hoare triple {136189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {136170#true} is VALID [2022-04-08 10:10:46,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {136170#true} assume true; {136170#true} is VALID [2022-04-08 10:10:46,724 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {136170#true} {136170#true} #72#return; {136170#true} is VALID [2022-04-08 10:10:46,724 INFO L272 TraceCheckUtils]: 0: Hoare triple {136170#true} call ULTIMATE.init(); {136189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:10:46,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {136189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {136170#true} is VALID [2022-04-08 10:10:46,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {136170#true} assume true; {136170#true} is VALID [2022-04-08 10:10:46,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {136170#true} {136170#true} #72#return; {136170#true} is VALID [2022-04-08 10:10:46,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {136170#true} call #t~ret13 := main(); {136170#true} is VALID [2022-04-08 10:10:46,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {136170#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {136175#(= main_~y~0 0)} is VALID [2022-04-08 10:10:46,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {136175#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136176#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:10:46,725 INFO L290 TraceCheckUtils]: 7: Hoare triple {136176#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136177#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:10:46,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {136177#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136178#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:10:46,726 INFO L290 TraceCheckUtils]: 9: Hoare triple {136178#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136179#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:10:46,727 INFO L290 TraceCheckUtils]: 10: Hoare triple {136179#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136180#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:10:46,727 INFO L290 TraceCheckUtils]: 11: Hoare triple {136180#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136181#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:10:46,728 INFO L290 TraceCheckUtils]: 12: Hoare triple {136181#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136182#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:10:46,728 INFO L290 TraceCheckUtils]: 13: Hoare triple {136182#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136183#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:10:46,729 INFO L290 TraceCheckUtils]: 14: Hoare triple {136183#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136184#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:10:46,729 INFO L290 TraceCheckUtils]: 15: Hoare triple {136184#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136185#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:10:46,730 INFO L290 TraceCheckUtils]: 16: Hoare triple {136185#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136186#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:10:46,730 INFO L290 TraceCheckUtils]: 17: Hoare triple {136186#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {136186#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:10:46,730 INFO L290 TraceCheckUtils]: 18: Hoare triple {136186#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {136187#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:10:46,731 INFO L290 TraceCheckUtils]: 19: Hoare triple {136187#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {136188#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:10:46,731 INFO L290 TraceCheckUtils]: 20: Hoare triple {136188#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {136171#false} is VALID [2022-04-08 10:10:46,731 INFO L290 TraceCheckUtils]: 21: Hoare triple {136171#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {136171#false} is VALID [2022-04-08 10:10:46,731 INFO L290 TraceCheckUtils]: 22: Hoare triple {136171#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {136171#false} is VALID [2022-04-08 10:10:46,731 INFO L290 TraceCheckUtils]: 23: Hoare triple {136171#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {136171#false} is VALID [2022-04-08 10:10:46,731 INFO L290 TraceCheckUtils]: 24: Hoare triple {136171#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {136171#false} is VALID [2022-04-08 10:10:46,731 INFO L290 TraceCheckUtils]: 25: Hoare triple {136171#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {136171#false} is VALID [2022-04-08 10:10:46,731 INFO L290 TraceCheckUtils]: 26: Hoare triple {136171#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {136171#false} is VALID [2022-04-08 10:10:46,731 INFO L290 TraceCheckUtils]: 27: Hoare triple {136171#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {136171#false} is VALID [2022-04-08 10:10:46,731 INFO L290 TraceCheckUtils]: 28: Hoare triple {136171#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {136171#false} is VALID [2022-04-08 10:10:46,731 INFO L290 TraceCheckUtils]: 29: Hoare triple {136171#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {136171#false} is VALID [2022-04-08 10:10:46,732 INFO L290 TraceCheckUtils]: 30: Hoare triple {136171#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {136171#false} is VALID [2022-04-08 10:10:46,732 INFO L290 TraceCheckUtils]: 31: Hoare triple {136171#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {136171#false} is VALID [2022-04-08 10:10:46,732 INFO L290 TraceCheckUtils]: 32: Hoare triple {136171#false} assume !(~y~0 % 4294967296 > 0); {136171#false} is VALID [2022-04-08 10:10:46,732 INFO L290 TraceCheckUtils]: 33: Hoare triple {136171#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {136171#false} is VALID [2022-04-08 10:10:46,732 INFO L290 TraceCheckUtils]: 34: Hoare triple {136171#false} assume !(~x~0 % 4294967296 > 0); {136171#false} is VALID [2022-04-08 10:10:46,732 INFO L272 TraceCheckUtils]: 35: Hoare triple {136171#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {136171#false} is VALID [2022-04-08 10:10:46,732 INFO L290 TraceCheckUtils]: 36: Hoare triple {136171#false} ~cond := #in~cond; {136171#false} is VALID [2022-04-08 10:10:46,732 INFO L290 TraceCheckUtils]: 37: Hoare triple {136171#false} assume 0 == ~cond; {136171#false} is VALID [2022-04-08 10:10:46,732 INFO L290 TraceCheckUtils]: 38: Hoare triple {136171#false} assume !false; {136171#false} is VALID [2022-04-08 10:10:46,732 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-04-08 10:10:46,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:10:46,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133852455] [2022-04-08 10:10:46,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133852455] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:10:46,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982621898] [2022-04-08 10:10:46,732 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:10:46,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:10:46,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:10:46,733 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:10:46,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2022-04-08 10:10:46,810 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 10:10:46,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:10:46,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 10:10:46,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:10:46,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:10:46,943 INFO L272 TraceCheckUtils]: 0: Hoare triple {136170#true} call ULTIMATE.init(); {136170#true} is VALID [2022-04-08 10:10:46,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {136170#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {136170#true} is VALID [2022-04-08 10:10:46,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {136170#true} assume true; {136170#true} is VALID [2022-04-08 10:10:46,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {136170#true} {136170#true} #72#return; {136170#true} is VALID [2022-04-08 10:10:46,943 INFO L272 TraceCheckUtils]: 4: Hoare triple {136170#true} call #t~ret13 := main(); {136170#true} is VALID [2022-04-08 10:10:46,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {136170#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {136170#true} is VALID [2022-04-08 10:10:46,943 INFO L290 TraceCheckUtils]: 6: Hoare triple {136170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136170#true} is VALID [2022-04-08 10:10:46,943 INFO L290 TraceCheckUtils]: 7: Hoare triple {136170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136170#true} is VALID [2022-04-08 10:10:46,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {136170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136170#true} is VALID [2022-04-08 10:10:46,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {136170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136170#true} is VALID [2022-04-08 10:10:46,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {136170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136170#true} is VALID [2022-04-08 10:10:46,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {136170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136170#true} is VALID [2022-04-08 10:10:46,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {136170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136170#true} is VALID [2022-04-08 10:10:46,944 INFO L290 TraceCheckUtils]: 13: Hoare triple {136170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136170#true} is VALID [2022-04-08 10:10:46,944 INFO L290 TraceCheckUtils]: 14: Hoare triple {136170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136170#true} is VALID [2022-04-08 10:10:46,944 INFO L290 TraceCheckUtils]: 15: Hoare triple {136170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136170#true} is VALID [2022-04-08 10:10:46,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {136170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136170#true} is VALID [2022-04-08 10:10:46,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {136170#true} assume !(~x~0 % 4294967296 > 0); {136170#true} is VALID [2022-04-08 10:10:46,944 INFO L290 TraceCheckUtils]: 18: Hoare triple {136170#true} ~z~0 := ~y~0; {136247#(= main_~z~0 main_~y~0)} is VALID [2022-04-08 10:10:46,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {136247#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {136251#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-08 10:10:46,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {136251#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {136255#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:10:46,946 INFO L290 TraceCheckUtils]: 21: Hoare triple {136255#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {136259#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:10:46,946 INFO L290 TraceCheckUtils]: 22: Hoare triple {136259#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {136171#false} is VALID [2022-04-08 10:10:46,946 INFO L290 TraceCheckUtils]: 23: Hoare triple {136171#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {136171#false} is VALID [2022-04-08 10:10:46,947 INFO L290 TraceCheckUtils]: 24: Hoare triple {136171#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {136171#false} is VALID [2022-04-08 10:10:46,947 INFO L290 TraceCheckUtils]: 25: Hoare triple {136171#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {136171#false} is VALID [2022-04-08 10:10:46,947 INFO L290 TraceCheckUtils]: 26: Hoare triple {136171#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {136171#false} is VALID [2022-04-08 10:10:46,947 INFO L290 TraceCheckUtils]: 27: Hoare triple {136171#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {136171#false} is VALID [2022-04-08 10:10:46,947 INFO L290 TraceCheckUtils]: 28: Hoare triple {136171#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {136171#false} is VALID [2022-04-08 10:10:46,947 INFO L290 TraceCheckUtils]: 29: Hoare triple {136171#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {136171#false} is VALID [2022-04-08 10:10:46,947 INFO L290 TraceCheckUtils]: 30: Hoare triple {136171#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {136171#false} is VALID [2022-04-08 10:10:46,947 INFO L290 TraceCheckUtils]: 31: Hoare triple {136171#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {136171#false} is VALID [2022-04-08 10:10:46,962 INFO L290 TraceCheckUtils]: 32: Hoare triple {136171#false} assume !(~y~0 % 4294967296 > 0); {136171#false} is VALID [2022-04-08 10:10:46,962 INFO L290 TraceCheckUtils]: 33: Hoare triple {136171#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {136171#false} is VALID [2022-04-08 10:10:46,962 INFO L290 TraceCheckUtils]: 34: Hoare triple {136171#false} assume !(~x~0 % 4294967296 > 0); {136171#false} is VALID [2022-04-08 10:10:46,962 INFO L272 TraceCheckUtils]: 35: Hoare triple {136171#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {136171#false} is VALID [2022-04-08 10:10:46,962 INFO L290 TraceCheckUtils]: 36: Hoare triple {136171#false} ~cond := #in~cond; {136171#false} is VALID [2022-04-08 10:10:46,962 INFO L290 TraceCheckUtils]: 37: Hoare triple {136171#false} assume 0 == ~cond; {136171#false} is VALID [2022-04-08 10:10:46,962 INFO L290 TraceCheckUtils]: 38: Hoare triple {136171#false} assume !false; {136171#false} is VALID [2022-04-08 10:10:46,963 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-08 10:10:46,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:10:47,098 INFO L290 TraceCheckUtils]: 38: Hoare triple {136171#false} assume !false; {136171#false} is VALID [2022-04-08 10:10:47,098 INFO L290 TraceCheckUtils]: 37: Hoare triple {136171#false} assume 0 == ~cond; {136171#false} is VALID [2022-04-08 10:10:47,098 INFO L290 TraceCheckUtils]: 36: Hoare triple {136171#false} ~cond := #in~cond; {136171#false} is VALID [2022-04-08 10:10:47,098 INFO L272 TraceCheckUtils]: 35: Hoare triple {136171#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {136171#false} is VALID [2022-04-08 10:10:47,098 INFO L290 TraceCheckUtils]: 34: Hoare triple {136171#false} assume !(~x~0 % 4294967296 > 0); {136171#false} is VALID [2022-04-08 10:10:47,098 INFO L290 TraceCheckUtils]: 33: Hoare triple {136171#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {136171#false} is VALID [2022-04-08 10:10:47,098 INFO L290 TraceCheckUtils]: 32: Hoare triple {136171#false} assume !(~y~0 % 4294967296 > 0); {136171#false} is VALID [2022-04-08 10:10:47,098 INFO L290 TraceCheckUtils]: 31: Hoare triple {136171#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {136171#false} is VALID [2022-04-08 10:10:47,098 INFO L290 TraceCheckUtils]: 30: Hoare triple {136171#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {136171#false} is VALID [2022-04-08 10:10:47,098 INFO L290 TraceCheckUtils]: 29: Hoare triple {136171#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {136171#false} is VALID [2022-04-08 10:10:47,098 INFO L290 TraceCheckUtils]: 28: Hoare triple {136171#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {136171#false} is VALID [2022-04-08 10:10:47,098 INFO L290 TraceCheckUtils]: 27: Hoare triple {136171#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {136171#false} is VALID [2022-04-08 10:10:47,099 INFO L290 TraceCheckUtils]: 26: Hoare triple {136171#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {136171#false} is VALID [2022-04-08 10:10:47,099 INFO L290 TraceCheckUtils]: 25: Hoare triple {136171#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {136171#false} is VALID [2022-04-08 10:10:47,099 INFO L290 TraceCheckUtils]: 24: Hoare triple {136171#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {136171#false} is VALID [2022-04-08 10:10:47,099 INFO L290 TraceCheckUtils]: 23: Hoare triple {136171#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {136171#false} is VALID [2022-04-08 10:10:47,099 INFO L290 TraceCheckUtils]: 22: Hoare triple {136259#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {136171#false} is VALID [2022-04-08 10:10:47,100 INFO L290 TraceCheckUtils]: 21: Hoare triple {136255#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {136259#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:10:47,100 INFO L290 TraceCheckUtils]: 20: Hoare triple {136365#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {136255#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-08 10:10:47,101 INFO L290 TraceCheckUtils]: 19: Hoare triple {136369#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {136365#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:10:47,101 INFO L290 TraceCheckUtils]: 18: Hoare triple {136170#true} ~z~0 := ~y~0; {136369#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:10:47,101 INFO L290 TraceCheckUtils]: 17: Hoare triple {136170#true} assume !(~x~0 % 4294967296 > 0); {136170#true} is VALID [2022-04-08 10:10:47,101 INFO L290 TraceCheckUtils]: 16: Hoare triple {136170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136170#true} is VALID [2022-04-08 10:10:47,102 INFO L290 TraceCheckUtils]: 15: Hoare triple {136170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136170#true} is VALID [2022-04-08 10:10:47,102 INFO L290 TraceCheckUtils]: 14: Hoare triple {136170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136170#true} is VALID [2022-04-08 10:10:47,102 INFO L290 TraceCheckUtils]: 13: Hoare triple {136170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136170#true} is VALID [2022-04-08 10:10:47,102 INFO L290 TraceCheckUtils]: 12: Hoare triple {136170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136170#true} is VALID [2022-04-08 10:10:47,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {136170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136170#true} is VALID [2022-04-08 10:10:47,102 INFO L290 TraceCheckUtils]: 10: Hoare triple {136170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136170#true} is VALID [2022-04-08 10:10:47,102 INFO L290 TraceCheckUtils]: 9: Hoare triple {136170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136170#true} is VALID [2022-04-08 10:10:47,102 INFO L290 TraceCheckUtils]: 8: Hoare triple {136170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136170#true} is VALID [2022-04-08 10:10:47,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {136170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136170#true} is VALID [2022-04-08 10:10:47,102 INFO L290 TraceCheckUtils]: 6: Hoare triple {136170#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {136170#true} is VALID [2022-04-08 10:10:47,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {136170#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {136170#true} is VALID [2022-04-08 10:10:47,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {136170#true} call #t~ret13 := main(); {136170#true} is VALID [2022-04-08 10:10:47,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {136170#true} {136170#true} #72#return; {136170#true} is VALID [2022-04-08 10:10:47,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {136170#true} assume true; {136170#true} is VALID [2022-04-08 10:10:47,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {136170#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {136170#true} is VALID [2022-04-08 10:10:47,102 INFO L272 TraceCheckUtils]: 0: Hoare triple {136170#true} call ULTIMATE.init(); {136170#true} is VALID [2022-04-08 10:10:47,102 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-08 10:10:47,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982621898] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:10:47,103 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:10:47,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 6, 6] total 23 [2022-04-08 10:10:47,103 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:10:47,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [798078282] [2022-04-08 10:10:47,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [798078282] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:10:47,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:10:47,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 10:10:47,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838769815] [2022-04-08 10:10:47,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:10:47,103 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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 39 [2022-04-08 10:10:47,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:10:47,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-08 10:10:47,121 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-08 10:10:47,121 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 10:10:47,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:10:47,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 10:10:47,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2022-04-08 10:10:47,121 INFO L87 Difference]: Start difference. First operand 481 states and 655 transitions. Second operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-08 10:10:54,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:54,002 INFO L93 Difference]: Finished difference Result 659 states and 844 transitions. [2022-04-08 10:10:54,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 10:10:54,002 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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 39 [2022-04-08 10:10:54,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:10:54,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-08 10:10:54,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 115 transitions. [2022-04-08 10:10:54,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-08 10:10:54,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 115 transitions. [2022-04-08 10:10:54,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 115 transitions. [2022-04-08 10:10:54,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:10:54,078 INFO L225 Difference]: With dead ends: 659 [2022-04-08 10:10:54,078 INFO L226 Difference]: Without dead ends: 640 [2022-04-08 10:10:54,078 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=1271, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 10:10:54,078 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 72 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:10:54,078 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 118 Invalid, 1203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1145 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 10:10:54,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2022-04-08 10:10:55,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 481. [2022-04-08 10:10:55,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:10:55,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 640 states. Second operand has 481 states, 476 states have (on average 1.365546218487395) internal successors, (650), 476 states have internal predecessors, (650), 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-08 10:10:55,921 INFO L74 IsIncluded]: Start isIncluded. First operand 640 states. Second operand has 481 states, 476 states have (on average 1.365546218487395) internal successors, (650), 476 states have internal predecessors, (650), 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-08 10:10:55,921 INFO L87 Difference]: Start difference. First operand 640 states. Second operand has 481 states, 476 states have (on average 1.365546218487395) internal successors, (650), 476 states have internal predecessors, (650), 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-08 10:10:55,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:55,932 INFO L93 Difference]: Finished difference Result 640 states and 825 transitions. [2022-04-08 10:10:55,932 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 825 transitions. [2022-04-08 10:10:55,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:55,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:55,932 INFO L74 IsIncluded]: Start isIncluded. First operand has 481 states, 476 states have (on average 1.365546218487395) internal successors, (650), 476 states have internal predecessors, (650), 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 640 states. [2022-04-08 10:10:55,933 INFO L87 Difference]: Start difference. First operand has 481 states, 476 states have (on average 1.365546218487395) internal successors, (650), 476 states have internal predecessors, (650), 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 640 states. [2022-04-08 10:10:55,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:10:55,943 INFO L93 Difference]: Finished difference Result 640 states and 825 transitions. [2022-04-08 10:10:55,943 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 825 transitions. [2022-04-08 10:10:55,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:10:55,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:10:55,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:10:55,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:10:55,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 476 states have (on average 1.365546218487395) internal successors, (650), 476 states have internal predecessors, (650), 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-08 10:10:55,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 654 transitions. [2022-04-08 10:10:55,953 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 654 transitions. Word has length 39 [2022-04-08 10:10:55,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:10:55,953 INFO L478 AbstractCegarLoop]: Abstraction has 481 states and 654 transitions. [2022-04-08 10:10:55,953 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 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-08 10:10:55,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 481 states and 654 transitions. [2022-04-08 10:11:01,521 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 654 edges. 654 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:01,521 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 654 transitions. [2022-04-08 10:11:01,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 10:11:01,522 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:11:01,522 INFO L499 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:11:01,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Ended with exit code 0 [2022-04-08 10:11:01,722 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76,75 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:11:01,722 INFO L403 AbstractCegarLoop]: === Iteration 78 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:11:01,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:11:01,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1122018264, now seen corresponding path program 47 times [2022-04-08 10:11:01,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:01,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [99155542] [2022-04-08 10:11:01,725 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:11:01,725 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:11:01,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1122018264, now seen corresponding path program 48 times [2022-04-08 10:11:01,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:11:01,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473981400] [2022-04-08 10:11:01,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:11:01,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:11:01,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:02,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:11:02,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:02,233 INFO L290 TraceCheckUtils]: 0: Hoare triple {140050#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {140019#true} is VALID [2022-04-08 10:11:02,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {140019#true} assume true; {140019#true} is VALID [2022-04-08 10:11:02,233 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {140019#true} {140019#true} #72#return; {140019#true} is VALID [2022-04-08 10:11:02,233 INFO L272 TraceCheckUtils]: 0: Hoare triple {140019#true} call ULTIMATE.init(); {140050#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:11:02,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {140050#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {140019#true} is VALID [2022-04-08 10:11:02,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {140019#true} assume true; {140019#true} is VALID [2022-04-08 10:11:02,233 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {140019#true} {140019#true} #72#return; {140019#true} is VALID [2022-04-08 10:11:02,234 INFO L272 TraceCheckUtils]: 4: Hoare triple {140019#true} call #t~ret13 := main(); {140019#true} is VALID [2022-04-08 10:11:02,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {140019#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {140024#(= main_~y~0 0)} is VALID [2022-04-08 10:11:02,234 INFO L290 TraceCheckUtils]: 6: Hoare triple {140024#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140025#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:11:02,235 INFO L290 TraceCheckUtils]: 7: Hoare triple {140025#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140026#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:11:02,235 INFO L290 TraceCheckUtils]: 8: Hoare triple {140026#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140027#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:11:02,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {140027#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140028#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:11:02,236 INFO L290 TraceCheckUtils]: 10: Hoare triple {140028#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140029#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:11:02,237 INFO L290 TraceCheckUtils]: 11: Hoare triple {140029#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140030#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:11:02,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {140030#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140031#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:11:02,238 INFO L290 TraceCheckUtils]: 13: Hoare triple {140031#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140032#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:02,238 INFO L290 TraceCheckUtils]: 14: Hoare triple {140032#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140033#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:11:02,239 INFO L290 TraceCheckUtils]: 15: Hoare triple {140033#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140034#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:11:02,239 INFO L290 TraceCheckUtils]: 16: Hoare triple {140034#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140035#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:11:02,240 INFO L290 TraceCheckUtils]: 17: Hoare triple {140035#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140036#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:11:02,240 INFO L290 TraceCheckUtils]: 18: Hoare triple {140036#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140037#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:11:02,241 INFO L290 TraceCheckUtils]: 19: Hoare triple {140037#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140038#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:11:02,241 INFO L290 TraceCheckUtils]: 20: Hoare triple {140038#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140039#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:11:02,242 INFO L290 TraceCheckUtils]: 21: Hoare triple {140039#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140040#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:11:02,242 INFO L290 TraceCheckUtils]: 22: Hoare triple {140040#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140041#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:11:02,243 INFO L290 TraceCheckUtils]: 23: Hoare triple {140041#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140042#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:11:02,243 INFO L290 TraceCheckUtils]: 24: Hoare triple {140042#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140043#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:11:02,244 INFO L290 TraceCheckUtils]: 25: Hoare triple {140043#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140044#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:11:02,244 INFO L290 TraceCheckUtils]: 26: Hoare triple {140044#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140045#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:11:02,245 INFO L290 TraceCheckUtils]: 27: Hoare triple {140045#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140046#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:11:02,245 INFO L290 TraceCheckUtils]: 28: Hoare triple {140046#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140047#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:11:02,246 INFO L290 TraceCheckUtils]: 29: Hoare triple {140047#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140048#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-08 10:11:02,246 INFO L290 TraceCheckUtils]: 30: Hoare triple {140048#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !(~x~0 % 4294967296 > 0); {140048#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-08 10:11:02,246 INFO L290 TraceCheckUtils]: 31: Hoare triple {140048#(and (<= 24 main_~y~0) (<= main_~y~0 24))} ~z~0 := ~y~0; {140049#(and (<= (div main_~z~0 4294967296) 0) (<= 24 main_~z~0))} is VALID [2022-04-08 10:11:02,247 INFO L290 TraceCheckUtils]: 32: Hoare triple {140049#(and (<= (div main_~z~0 4294967296) 0) (<= 24 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {140020#false} is VALID [2022-04-08 10:11:02,247 INFO L290 TraceCheckUtils]: 33: Hoare triple {140020#false} assume !(~y~0 % 4294967296 > 0); {140020#false} is VALID [2022-04-08 10:11:02,247 INFO L290 TraceCheckUtils]: 34: Hoare triple {140020#false} assume !(~x~0 % 4294967296 > 0); {140020#false} is VALID [2022-04-08 10:11:02,247 INFO L272 TraceCheckUtils]: 35: Hoare triple {140020#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {140020#false} is VALID [2022-04-08 10:11:02,247 INFO L290 TraceCheckUtils]: 36: Hoare triple {140020#false} ~cond := #in~cond; {140020#false} is VALID [2022-04-08 10:11:02,247 INFO L290 TraceCheckUtils]: 37: Hoare triple {140020#false} assume 0 == ~cond; {140020#false} is VALID [2022-04-08 10:11:02,247 INFO L290 TraceCheckUtils]: 38: Hoare triple {140020#false} assume !false; {140020#false} is VALID [2022-04-08 10:11:02,247 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:11:02,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:11:02,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473981400] [2022-04-08 10:11:02,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473981400] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:11:02,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263123251] [2022-04-08 10:11:02,248 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:11:02,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:11:02,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:11:02,255 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:11:02,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2022-04-08 10:11:02,853 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-08 10:11:02,853 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:11:02,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 53 conjunts are in the unsatisfiable core [2022-04-08 10:11:02,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:02,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:11:03,234 INFO L272 TraceCheckUtils]: 0: Hoare triple {140019#true} call ULTIMATE.init(); {140019#true} is VALID [2022-04-08 10:11:03,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {140019#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {140019#true} is VALID [2022-04-08 10:11:03,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {140019#true} assume true; {140019#true} is VALID [2022-04-08 10:11:03,234 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {140019#true} {140019#true} #72#return; {140019#true} is VALID [2022-04-08 10:11:03,234 INFO L272 TraceCheckUtils]: 4: Hoare triple {140019#true} call #t~ret13 := main(); {140019#true} is VALID [2022-04-08 10:11:03,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {140019#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {140024#(= main_~y~0 0)} is VALID [2022-04-08 10:11:03,235 INFO L290 TraceCheckUtils]: 6: Hoare triple {140024#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140025#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:11:03,235 INFO L290 TraceCheckUtils]: 7: Hoare triple {140025#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140026#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:11:03,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {140026#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140027#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:11:03,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {140027#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140028#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:11:03,237 INFO L290 TraceCheckUtils]: 10: Hoare triple {140028#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140029#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:11:03,237 INFO L290 TraceCheckUtils]: 11: Hoare triple {140029#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140030#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:11:03,238 INFO L290 TraceCheckUtils]: 12: Hoare triple {140030#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140031#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:11:03,239 INFO L290 TraceCheckUtils]: 13: Hoare triple {140031#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140032#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:03,239 INFO L290 TraceCheckUtils]: 14: Hoare triple {140032#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140033#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:11:03,240 INFO L290 TraceCheckUtils]: 15: Hoare triple {140033#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140034#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:11:03,240 INFO L290 TraceCheckUtils]: 16: Hoare triple {140034#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140035#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:11:03,241 INFO L290 TraceCheckUtils]: 17: Hoare triple {140035#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140036#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:11:03,241 INFO L290 TraceCheckUtils]: 18: Hoare triple {140036#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140037#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:11:03,242 INFO L290 TraceCheckUtils]: 19: Hoare triple {140037#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140038#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:11:03,242 INFO L290 TraceCheckUtils]: 20: Hoare triple {140038#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140039#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:11:03,243 INFO L290 TraceCheckUtils]: 21: Hoare triple {140039#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140040#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:11:03,243 INFO L290 TraceCheckUtils]: 22: Hoare triple {140040#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140041#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:11:03,244 INFO L290 TraceCheckUtils]: 23: Hoare triple {140041#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140042#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:11:03,244 INFO L290 TraceCheckUtils]: 24: Hoare triple {140042#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140043#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:11:03,245 INFO L290 TraceCheckUtils]: 25: Hoare triple {140043#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140044#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:11:03,245 INFO L290 TraceCheckUtils]: 26: Hoare triple {140044#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140045#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:11:03,246 INFO L290 TraceCheckUtils]: 27: Hoare triple {140045#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140046#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:11:03,246 INFO L290 TraceCheckUtils]: 28: Hoare triple {140046#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140047#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:11:03,247 INFO L290 TraceCheckUtils]: 29: Hoare triple {140047#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140048#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-08 10:11:03,247 INFO L290 TraceCheckUtils]: 30: Hoare triple {140048#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !(~x~0 % 4294967296 > 0); {140048#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-08 10:11:03,247 INFO L290 TraceCheckUtils]: 31: Hoare triple {140048#(and (<= 24 main_~y~0) (<= main_~y~0 24))} ~z~0 := ~y~0; {140147#(and (<= main_~z~0 24) (<= 24 main_~z~0))} is VALID [2022-04-08 10:11:03,248 INFO L290 TraceCheckUtils]: 32: Hoare triple {140147#(and (<= main_~z~0 24) (<= 24 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {140020#false} is VALID [2022-04-08 10:11:03,248 INFO L290 TraceCheckUtils]: 33: Hoare triple {140020#false} assume !(~y~0 % 4294967296 > 0); {140020#false} is VALID [2022-04-08 10:11:03,248 INFO L290 TraceCheckUtils]: 34: Hoare triple {140020#false} assume !(~x~0 % 4294967296 > 0); {140020#false} is VALID [2022-04-08 10:11:03,248 INFO L272 TraceCheckUtils]: 35: Hoare triple {140020#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {140020#false} is VALID [2022-04-08 10:11:03,248 INFO L290 TraceCheckUtils]: 36: Hoare triple {140020#false} ~cond := #in~cond; {140020#false} is VALID [2022-04-08 10:11:03,248 INFO L290 TraceCheckUtils]: 37: Hoare triple {140020#false} assume 0 == ~cond; {140020#false} is VALID [2022-04-08 10:11:03,248 INFO L290 TraceCheckUtils]: 38: Hoare triple {140020#false} assume !false; {140020#false} is VALID [2022-04-08 10:11:03,248 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:11:03,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:11:04,321 INFO L290 TraceCheckUtils]: 38: Hoare triple {140020#false} assume !false; {140020#false} is VALID [2022-04-08 10:11:04,321 INFO L290 TraceCheckUtils]: 37: Hoare triple {140020#false} assume 0 == ~cond; {140020#false} is VALID [2022-04-08 10:11:04,321 INFO L290 TraceCheckUtils]: 36: Hoare triple {140020#false} ~cond := #in~cond; {140020#false} is VALID [2022-04-08 10:11:04,321 INFO L272 TraceCheckUtils]: 35: Hoare triple {140020#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {140020#false} is VALID [2022-04-08 10:11:04,321 INFO L290 TraceCheckUtils]: 34: Hoare triple {140020#false} assume !(~x~0 % 4294967296 > 0); {140020#false} is VALID [2022-04-08 10:11:04,321 INFO L290 TraceCheckUtils]: 33: Hoare triple {140020#false} assume !(~y~0 % 4294967296 > 0); {140020#false} is VALID [2022-04-08 10:11:04,322 INFO L290 TraceCheckUtils]: 32: Hoare triple {140187#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {140020#false} is VALID [2022-04-08 10:11:04,322 INFO L290 TraceCheckUtils]: 31: Hoare triple {140191#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {140187#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:11:04,322 INFO L290 TraceCheckUtils]: 30: Hoare triple {140191#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {140191#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:11:04,323 INFO L290 TraceCheckUtils]: 29: Hoare triple {140198#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140191#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:11:04,324 INFO L290 TraceCheckUtils]: 28: Hoare triple {140202#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140198#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:11:04,324 INFO L290 TraceCheckUtils]: 27: Hoare triple {140206#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140202#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:11:04,325 INFO L290 TraceCheckUtils]: 26: Hoare triple {140210#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140206#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:11:04,326 INFO L290 TraceCheckUtils]: 25: Hoare triple {140214#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140210#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:11:04,326 INFO L290 TraceCheckUtils]: 24: Hoare triple {140218#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140214#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:04,327 INFO L290 TraceCheckUtils]: 23: Hoare triple {140222#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140218#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:11:04,327 INFO L290 TraceCheckUtils]: 22: Hoare triple {140226#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140222#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:04,328 INFO L290 TraceCheckUtils]: 21: Hoare triple {140230#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140226#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:11:04,329 INFO L290 TraceCheckUtils]: 20: Hoare triple {140234#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140230#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:11:04,329 INFO L290 TraceCheckUtils]: 19: Hoare triple {140238#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140234#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:11:04,330 INFO L290 TraceCheckUtils]: 18: Hoare triple {140242#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140238#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:11:04,331 INFO L290 TraceCheckUtils]: 17: Hoare triple {140246#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140242#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:11:04,331 INFO L290 TraceCheckUtils]: 16: Hoare triple {140250#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140246#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:11:04,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {140254#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140250#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:11:04,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {140258#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140254#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:11:04,333 INFO L290 TraceCheckUtils]: 13: Hoare triple {140262#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140258#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:11:04,334 INFO L290 TraceCheckUtils]: 12: Hoare triple {140266#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140262#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:11:04,334 INFO L290 TraceCheckUtils]: 11: Hoare triple {140270#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140266#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-08 10:11:04,335 INFO L290 TraceCheckUtils]: 10: Hoare triple {140274#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140270#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:04,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {140278#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140274#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-08 10:11:04,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {140282#(< 0 (mod (+ main_~y~0 22) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140278#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-08 10:11:04,337 INFO L290 TraceCheckUtils]: 7: Hoare triple {140286#(< 0 (mod (+ 23 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140282#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-08 10:11:04,337 INFO L290 TraceCheckUtils]: 6: Hoare triple {140290#(< 0 (mod (+ main_~y~0 24) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {140286#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:04,338 INFO L290 TraceCheckUtils]: 5: Hoare triple {140019#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {140290#(< 0 (mod (+ main_~y~0 24) 4294967296))} is VALID [2022-04-08 10:11:04,338 INFO L272 TraceCheckUtils]: 4: Hoare triple {140019#true} call #t~ret13 := main(); {140019#true} is VALID [2022-04-08 10:11:04,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {140019#true} {140019#true} #72#return; {140019#true} is VALID [2022-04-08 10:11:04,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {140019#true} assume true; {140019#true} is VALID [2022-04-08 10:11:04,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {140019#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {140019#true} is VALID [2022-04-08 10:11:04,338 INFO L272 TraceCheckUtils]: 0: Hoare triple {140019#true} call ULTIMATE.init(); {140019#true} is VALID [2022-04-08 10:11:04,338 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:11:04,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263123251] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:11:04,338 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:11:04,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 56 [2022-04-08 10:11:04,339 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:11:04,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [99155542] [2022-04-08 10:11:04,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [99155542] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:11:04,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:11:04,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-08 10:11:04,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448155456] [2022-04-08 10:11:04,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:11:04,339 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 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 39 [2022-04-08 10:11:04,339 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:11:04,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 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-08 10:11:04,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:04,362 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-08 10:11:04,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:04,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-08 10:11:04,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=736, Invalid=2344, Unknown=0, NotChecked=0, Total=3080 [2022-04-08 10:11:04,363 INFO L87 Difference]: Start difference. First operand 481 states and 654 transitions. Second operand has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 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-08 10:11:15,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:15,894 INFO L93 Difference]: Finished difference Result 839 states and 1283 transitions. [2022-04-08 10:11:15,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-08 10:11:15,894 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 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 39 [2022-04-08 10:11:15,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:11:15,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 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-08 10:11:15,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 255 transitions. [2022-04-08 10:11:15,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 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-08 10:11:15,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 255 transitions. [2022-04-08 10:11:15,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 255 transitions. [2022-04-08 10:11:16,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 255 edges. 255 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:16,092 INFO L225 Difference]: With dead ends: 839 [2022-04-08 10:11:16,092 INFO L226 Difference]: Without dead ends: 809 [2022-04-08 10:11:16,092 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1492, Invalid=5150, Unknown=0, NotChecked=0, Total=6642 [2022-04-08 10:11:16,092 INFO L913 BasicCegarLoop]: 115 mSDtfsCounter, 193 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 5251 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 5388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 5251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:11:16,092 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 247 Invalid, 5388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 5251 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-08 10:11:16,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2022-04-08 10:11:19,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 502. [2022-04-08 10:11:19,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:11:19,043 INFO L82 GeneralOperation]: Start isEquivalent. First operand 809 states. Second operand has 502 states, 497 states have (on average 1.3702213279678068) internal successors, (681), 497 states have internal predecessors, (681), 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-08 10:11:19,043 INFO L74 IsIncluded]: Start isIncluded. First operand 809 states. Second operand has 502 states, 497 states have (on average 1.3702213279678068) internal successors, (681), 497 states have internal predecessors, (681), 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-08 10:11:19,044 INFO L87 Difference]: Start difference. First operand 809 states. Second operand has 502 states, 497 states have (on average 1.3702213279678068) internal successors, (681), 497 states have internal predecessors, (681), 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-08 10:11:19,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:19,061 INFO L93 Difference]: Finished difference Result 809 states and 1017 transitions. [2022-04-08 10:11:19,061 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1017 transitions. [2022-04-08 10:11:19,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:19,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:19,063 INFO L74 IsIncluded]: Start isIncluded. First operand has 502 states, 497 states have (on average 1.3702213279678068) internal successors, (681), 497 states have internal predecessors, (681), 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 809 states. [2022-04-08 10:11:19,063 INFO L87 Difference]: Start difference. First operand has 502 states, 497 states have (on average 1.3702213279678068) internal successors, (681), 497 states have internal predecessors, (681), 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 809 states. [2022-04-08 10:11:19,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:19,081 INFO L93 Difference]: Finished difference Result 809 states and 1017 transitions. [2022-04-08 10:11:19,081 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1017 transitions. [2022-04-08 10:11:19,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:19,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:19,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:11:19,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:11:19,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 497 states have (on average 1.3702213279678068) internal successors, (681), 497 states have internal predecessors, (681), 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-08 10:11:19,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 685 transitions. [2022-04-08 10:11:19,091 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 685 transitions. Word has length 39 [2022-04-08 10:11:19,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:11:19,092 INFO L478 AbstractCegarLoop]: Abstraction has 502 states and 685 transitions. [2022-04-08 10:11:19,092 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 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-08 10:11:19,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 502 states and 685 transitions. [2022-04-08 10:11:23,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 685 edges. 685 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:23,021 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 685 transitions. [2022-04-08 10:11:23,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-08 10:11:23,021 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:11:23,021 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:11:23,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Forceful destruction successful, exit code 0 [2022-04-08 10:11:23,222 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable77 [2022-04-08 10:11:23,222 INFO L403 AbstractCegarLoop]: === Iteration 79 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:11:23,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:11:23,222 INFO L85 PathProgramCache]: Analyzing trace with hash -2036388576, now seen corresponding path program 73 times [2022-04-08 10:11:23,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:23,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1399393073] [2022-04-08 10:11:23,224 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:11:23,224 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:11:23,224 INFO L85 PathProgramCache]: Analyzing trace with hash -2036388576, now seen corresponding path program 74 times [2022-04-08 10:11:23,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:11:23,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157430574] [2022-04-08 10:11:23,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:11:23,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:11:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:23,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:11:23,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:23,387 INFO L290 TraceCheckUtils]: 0: Hoare triple {144675#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {144663#true} is VALID [2022-04-08 10:11:23,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {144663#true} assume true; {144663#true} is VALID [2022-04-08 10:11:23,387 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {144663#true} {144663#true} #72#return; {144663#true} is VALID [2022-04-08 10:11:23,388 INFO L272 TraceCheckUtils]: 0: Hoare triple {144663#true} call ULTIMATE.init(); {144675#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:11:23,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {144675#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {144663#true} is VALID [2022-04-08 10:11:23,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {144663#true} assume true; {144663#true} is VALID [2022-04-08 10:11:23,388 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {144663#true} {144663#true} #72#return; {144663#true} is VALID [2022-04-08 10:11:23,388 INFO L272 TraceCheckUtils]: 4: Hoare triple {144663#true} call #t~ret13 := main(); {144663#true} is VALID [2022-04-08 10:11:23,388 INFO L290 TraceCheckUtils]: 5: Hoare triple {144663#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {144663#true} is VALID [2022-04-08 10:11:23,388 INFO L290 TraceCheckUtils]: 6: Hoare triple {144663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144663#true} is VALID [2022-04-08 10:11:23,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {144663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144663#true} is VALID [2022-04-08 10:11:23,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {144663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144663#true} is VALID [2022-04-08 10:11:23,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {144663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144663#true} is VALID [2022-04-08 10:11:23,388 INFO L290 TraceCheckUtils]: 10: Hoare triple {144663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144663#true} is VALID [2022-04-08 10:11:23,388 INFO L290 TraceCheckUtils]: 11: Hoare triple {144663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144663#true} is VALID [2022-04-08 10:11:23,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {144663#true} assume !(~x~0 % 4294967296 > 0); {144668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:11:23,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {144668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {144668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:11:23,390 INFO L290 TraceCheckUtils]: 14: Hoare triple {144668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144669#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:11:23,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {144669#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144670#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:11:23,391 INFO L290 TraceCheckUtils]: 16: Hoare triple {144670#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144671#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:11:23,392 INFO L290 TraceCheckUtils]: 17: Hoare triple {144671#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144672#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:11:23,393 INFO L290 TraceCheckUtils]: 18: Hoare triple {144672#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144673#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:11:23,393 INFO L290 TraceCheckUtils]: 19: Hoare triple {144673#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:11:23,394 INFO L290 TraceCheckUtils]: 20: Hoare triple {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:11:23,394 INFO L290 TraceCheckUtils]: 21: Hoare triple {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:11:23,394 INFO L290 TraceCheckUtils]: 22: Hoare triple {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:11:23,395 INFO L290 TraceCheckUtils]: 23: Hoare triple {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:11:23,395 INFO L290 TraceCheckUtils]: 24: Hoare triple {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:11:23,396 INFO L290 TraceCheckUtils]: 25: Hoare triple {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:11:23,396 INFO L290 TraceCheckUtils]: 26: Hoare triple {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:11:23,396 INFO L290 TraceCheckUtils]: 27: Hoare triple {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:11:23,397 INFO L290 TraceCheckUtils]: 28: Hoare triple {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {144673#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:11:23,398 INFO L290 TraceCheckUtils]: 29: Hoare triple {144673#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {144672#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:11:23,399 INFO L290 TraceCheckUtils]: 30: Hoare triple {144672#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {144671#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:11:23,400 INFO L290 TraceCheckUtils]: 31: Hoare triple {144671#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {144670#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:11:23,401 INFO L290 TraceCheckUtils]: 32: Hoare triple {144670#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {144669#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:11:23,402 INFO L290 TraceCheckUtils]: 33: Hoare triple {144669#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {144668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:11:23,402 INFO L290 TraceCheckUtils]: 34: Hoare triple {144668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {144664#false} is VALID [2022-04-08 10:11:23,402 INFO L290 TraceCheckUtils]: 35: Hoare triple {144664#false} assume !(~x~0 % 4294967296 > 0); {144664#false} is VALID [2022-04-08 10:11:23,402 INFO L272 TraceCheckUtils]: 36: Hoare triple {144664#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {144664#false} is VALID [2022-04-08 10:11:23,402 INFO L290 TraceCheckUtils]: 37: Hoare triple {144664#false} ~cond := #in~cond; {144664#false} is VALID [2022-04-08 10:11:23,402 INFO L290 TraceCheckUtils]: 38: Hoare triple {144664#false} assume 0 == ~cond; {144664#false} is VALID [2022-04-08 10:11:23,403 INFO L290 TraceCheckUtils]: 39: Hoare triple {144664#false} assume !false; {144664#false} is VALID [2022-04-08 10:11:23,403 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-08 10:11:23,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:11:23,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157430574] [2022-04-08 10:11:23,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157430574] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:11:23,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856164701] [2022-04-08 10:11:23,403 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:11:23,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:11:23,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:11:23,416 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:11:23,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2022-04-08 10:11:23,464 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:11:23,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:11:23,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-08 10:11:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:23,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:11:23,716 INFO L272 TraceCheckUtils]: 0: Hoare triple {144663#true} call ULTIMATE.init(); {144663#true} is VALID [2022-04-08 10:11:23,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {144663#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {144663#true} is VALID [2022-04-08 10:11:23,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {144663#true} assume true; {144663#true} is VALID [2022-04-08 10:11:23,717 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {144663#true} {144663#true} #72#return; {144663#true} is VALID [2022-04-08 10:11:23,717 INFO L272 TraceCheckUtils]: 4: Hoare triple {144663#true} call #t~ret13 := main(); {144663#true} is VALID [2022-04-08 10:11:23,717 INFO L290 TraceCheckUtils]: 5: Hoare triple {144663#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {144663#true} is VALID [2022-04-08 10:11:23,717 INFO L290 TraceCheckUtils]: 6: Hoare triple {144663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144663#true} is VALID [2022-04-08 10:11:23,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {144663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144663#true} is VALID [2022-04-08 10:11:23,717 INFO L290 TraceCheckUtils]: 8: Hoare triple {144663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144663#true} is VALID [2022-04-08 10:11:23,717 INFO L290 TraceCheckUtils]: 9: Hoare triple {144663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144663#true} is VALID [2022-04-08 10:11:23,717 INFO L290 TraceCheckUtils]: 10: Hoare triple {144663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144663#true} is VALID [2022-04-08 10:11:23,717 INFO L290 TraceCheckUtils]: 11: Hoare triple {144663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144663#true} is VALID [2022-04-08 10:11:23,718 INFO L290 TraceCheckUtils]: 12: Hoare triple {144663#true} assume !(~x~0 % 4294967296 > 0); {144668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:11:23,718 INFO L290 TraceCheckUtils]: 13: Hoare triple {144668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {144668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:11:23,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {144668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144669#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:11:23,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {144669#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144670#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:11:23,720 INFO L290 TraceCheckUtils]: 16: Hoare triple {144670#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144671#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:11:23,721 INFO L290 TraceCheckUtils]: 17: Hoare triple {144671#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144672#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:11:23,721 INFO L290 TraceCheckUtils]: 18: Hoare triple {144672#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144673#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:11:23,722 INFO L290 TraceCheckUtils]: 19: Hoare triple {144673#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:11:23,722 INFO L290 TraceCheckUtils]: 20: Hoare triple {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:11:23,723 INFO L290 TraceCheckUtils]: 21: Hoare triple {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:11:23,723 INFO L290 TraceCheckUtils]: 22: Hoare triple {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:11:23,724 INFO L290 TraceCheckUtils]: 23: Hoare triple {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:11:23,724 INFO L290 TraceCheckUtils]: 24: Hoare triple {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:11:23,724 INFO L290 TraceCheckUtils]: 25: Hoare triple {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:11:23,725 INFO L290 TraceCheckUtils]: 26: Hoare triple {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:11:23,725 INFO L290 TraceCheckUtils]: 27: Hoare triple {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:11:23,726 INFO L290 TraceCheckUtils]: 28: Hoare triple {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {144673#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:11:23,726 INFO L290 TraceCheckUtils]: 29: Hoare triple {144673#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {144672#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:11:23,727 INFO L290 TraceCheckUtils]: 30: Hoare triple {144672#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {144671#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:11:23,728 INFO L290 TraceCheckUtils]: 31: Hoare triple {144671#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {144670#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:11:23,729 INFO L290 TraceCheckUtils]: 32: Hoare triple {144670#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {144669#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:11:23,730 INFO L290 TraceCheckUtils]: 33: Hoare triple {144669#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {144668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:11:23,730 INFO L290 TraceCheckUtils]: 34: Hoare triple {144668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {144664#false} is VALID [2022-04-08 10:11:23,730 INFO L290 TraceCheckUtils]: 35: Hoare triple {144664#false} assume !(~x~0 % 4294967296 > 0); {144664#false} is VALID [2022-04-08 10:11:23,730 INFO L272 TraceCheckUtils]: 36: Hoare triple {144664#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {144664#false} is VALID [2022-04-08 10:11:23,730 INFO L290 TraceCheckUtils]: 37: Hoare triple {144664#false} ~cond := #in~cond; {144664#false} is VALID [2022-04-08 10:11:23,730 INFO L290 TraceCheckUtils]: 38: Hoare triple {144664#false} assume 0 == ~cond; {144664#false} is VALID [2022-04-08 10:11:23,730 INFO L290 TraceCheckUtils]: 39: Hoare triple {144664#false} assume !false; {144664#false} is VALID [2022-04-08 10:11:23,730 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-08 10:11:23,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:11:23,976 INFO L290 TraceCheckUtils]: 39: Hoare triple {144664#false} assume !false; {144664#false} is VALID [2022-04-08 10:11:23,976 INFO L290 TraceCheckUtils]: 38: Hoare triple {144664#false} assume 0 == ~cond; {144664#false} is VALID [2022-04-08 10:11:23,976 INFO L290 TraceCheckUtils]: 37: Hoare triple {144664#false} ~cond := #in~cond; {144664#false} is VALID [2022-04-08 10:11:23,976 INFO L272 TraceCheckUtils]: 36: Hoare triple {144664#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {144664#false} is VALID [2022-04-08 10:11:23,976 INFO L290 TraceCheckUtils]: 35: Hoare triple {144664#false} assume !(~x~0 % 4294967296 > 0); {144664#false} is VALID [2022-04-08 10:11:23,977 INFO L290 TraceCheckUtils]: 34: Hoare triple {144668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {144664#false} is VALID [2022-04-08 10:11:23,978 INFO L290 TraceCheckUtils]: 33: Hoare triple {144669#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {144668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:11:23,978 INFO L290 TraceCheckUtils]: 32: Hoare triple {144670#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {144669#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:11:23,979 INFO L290 TraceCheckUtils]: 31: Hoare triple {144671#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {144670#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:11:23,980 INFO L290 TraceCheckUtils]: 30: Hoare triple {144672#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {144671#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:11:23,981 INFO L290 TraceCheckUtils]: 29: Hoare triple {144673#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {144672#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:11:23,981 INFO L290 TraceCheckUtils]: 28: Hoare triple {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {144673#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:11:23,982 INFO L290 TraceCheckUtils]: 27: Hoare triple {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:11:23,982 INFO L290 TraceCheckUtils]: 26: Hoare triple {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:11:23,982 INFO L290 TraceCheckUtils]: 25: Hoare triple {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:11:23,983 INFO L290 TraceCheckUtils]: 24: Hoare triple {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:11:23,983 INFO L290 TraceCheckUtils]: 23: Hoare triple {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:11:23,984 INFO L290 TraceCheckUtils]: 22: Hoare triple {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:11:23,984 INFO L290 TraceCheckUtils]: 21: Hoare triple {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:11:23,984 INFO L290 TraceCheckUtils]: 20: Hoare triple {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:11:23,985 INFO L290 TraceCheckUtils]: 19: Hoare triple {144673#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144674#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:11:23,986 INFO L290 TraceCheckUtils]: 18: Hoare triple {144672#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144673#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:11:23,986 INFO L290 TraceCheckUtils]: 17: Hoare triple {144671#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144672#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:11:23,987 INFO L290 TraceCheckUtils]: 16: Hoare triple {144670#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144671#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:11:23,988 INFO L290 TraceCheckUtils]: 15: Hoare triple {144669#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144670#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:11:23,988 INFO L290 TraceCheckUtils]: 14: Hoare triple {144668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {144669#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:11:23,989 INFO L290 TraceCheckUtils]: 13: Hoare triple {144668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {144668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:11:23,989 INFO L290 TraceCheckUtils]: 12: Hoare triple {144663#true} assume !(~x~0 % 4294967296 > 0); {144668#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:11:23,989 INFO L290 TraceCheckUtils]: 11: Hoare triple {144663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144663#true} is VALID [2022-04-08 10:11:23,989 INFO L290 TraceCheckUtils]: 10: Hoare triple {144663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144663#true} is VALID [2022-04-08 10:11:23,989 INFO L290 TraceCheckUtils]: 9: Hoare triple {144663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144663#true} is VALID [2022-04-08 10:11:23,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {144663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144663#true} is VALID [2022-04-08 10:11:23,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {144663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144663#true} is VALID [2022-04-08 10:11:23,990 INFO L290 TraceCheckUtils]: 6: Hoare triple {144663#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {144663#true} is VALID [2022-04-08 10:11:23,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {144663#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {144663#true} is VALID [2022-04-08 10:11:23,990 INFO L272 TraceCheckUtils]: 4: Hoare triple {144663#true} call #t~ret13 := main(); {144663#true} is VALID [2022-04-08 10:11:23,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {144663#true} {144663#true} #72#return; {144663#true} is VALID [2022-04-08 10:11:23,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {144663#true} assume true; {144663#true} is VALID [2022-04-08 10:11:23,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {144663#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {144663#true} is VALID [2022-04-08 10:11:23,990 INFO L272 TraceCheckUtils]: 0: Hoare triple {144663#true} call ULTIMATE.init(); {144663#true} is VALID [2022-04-08 10:11:23,990 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-08 10:11:23,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856164701] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:11:23,990 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:11:23,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 10 [2022-04-08 10:11:23,990 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:11:23,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1399393073] [2022-04-08 10:11:23,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1399393073] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:11:23,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:11:23,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 10:11:23,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778140407] [2022-04-08 10:11:23,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:11:23,991 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 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 40 [2022-04-08 10:11:23,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:11:23,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 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-08 10:11:24,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:24,016 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 10:11:24,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:24,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 10:11:24,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-04-08 10:11:24,017 INFO L87 Difference]: Start difference. First operand 502 states and 685 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 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-08 10:11:27,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:27,029 INFO L93 Difference]: Finished difference Result 529 states and 713 transitions. [2022-04-08 10:11:27,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 10:11:27,029 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 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 40 [2022-04-08 10:11:27,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:11:27,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 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-08 10:11:27,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 61 transitions. [2022-04-08 10:11:27,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 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-08 10:11:27,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 61 transitions. [2022-04-08 10:11:27,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 61 transitions. [2022-04-08 10:11:27,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:27,074 INFO L225 Difference]: With dead ends: 529 [2022-04-08 10:11:27,074 INFO L226 Difference]: Without dead ends: 501 [2022-04-08 10:11:27,074 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-08 10:11:27,074 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 44 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:11:27,075 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 72 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 10:11:27,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2022-04-08 10:11:28,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 495. [2022-04-08 10:11:28,763 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:11:28,764 INFO L82 GeneralOperation]: Start isEquivalent. First operand 501 states. Second operand has 495 states, 490 states have (on average 1.373469387755102) internal successors, (673), 490 states have internal predecessors, (673), 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-08 10:11:28,764 INFO L74 IsIncluded]: Start isIncluded. First operand 501 states. Second operand has 495 states, 490 states have (on average 1.373469387755102) internal successors, (673), 490 states have internal predecessors, (673), 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-08 10:11:28,765 INFO L87 Difference]: Start difference. First operand 501 states. Second operand has 495 states, 490 states have (on average 1.373469387755102) internal successors, (673), 490 states have internal predecessors, (673), 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-08 10:11:28,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:28,772 INFO L93 Difference]: Finished difference Result 501 states and 683 transitions. [2022-04-08 10:11:28,772 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 683 transitions. [2022-04-08 10:11:28,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:28,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:28,773 INFO L74 IsIncluded]: Start isIncluded. First operand has 495 states, 490 states have (on average 1.373469387755102) internal successors, (673), 490 states have internal predecessors, (673), 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 501 states. [2022-04-08 10:11:28,773 INFO L87 Difference]: Start difference. First operand has 495 states, 490 states have (on average 1.373469387755102) internal successors, (673), 490 states have internal predecessors, (673), 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 501 states. [2022-04-08 10:11:28,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:28,781 INFO L93 Difference]: Finished difference Result 501 states and 683 transitions. [2022-04-08 10:11:28,781 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 683 transitions. [2022-04-08 10:11:28,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:28,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:28,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:11:28,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:11:28,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 490 states have (on average 1.373469387755102) internal successors, (673), 490 states have internal predecessors, (673), 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-08 10:11:28,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 677 transitions. [2022-04-08 10:11:28,791 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 677 transitions. Word has length 40 [2022-04-08 10:11:28,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:11:28,791 INFO L478 AbstractCegarLoop]: Abstraction has 495 states and 677 transitions. [2022-04-08 10:11:28,791 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 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-08 10:11:28,791 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 495 states and 677 transitions. [2022-04-08 10:11:32,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 677 edges. 677 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:32,238 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 677 transitions. [2022-04-08 10:11:32,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-08 10:11:32,239 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:11:32,239 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:11:32,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Forceful destruction successful, exit code 0 [2022-04-08 10:11:32,452 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 77 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable78 [2022-04-08 10:11:32,452 INFO L403 AbstractCegarLoop]: === Iteration 80 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:11:32,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:11:32,452 INFO L85 PathProgramCache]: Analyzing trace with hash 20764672, now seen corresponding path program 31 times [2022-04-08 10:11:32,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:32,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [420423835] [2022-04-08 10:11:32,454 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:11:32,454 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:11:32,454 INFO L85 PathProgramCache]: Analyzing trace with hash 20764672, now seen corresponding path program 32 times [2022-04-08 10:11:32,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:11:32,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071752568] [2022-04-08 10:11:32,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:11:32,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:11:32,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:32,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:11:32,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:32,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {148002#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {147979#true} is VALID [2022-04-08 10:11:32,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {147979#true} assume true; {147979#true} is VALID [2022-04-08 10:11:32,690 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {147979#true} {147979#true} #72#return; {147979#true} is VALID [2022-04-08 10:11:32,691 INFO L272 TraceCheckUtils]: 0: Hoare triple {147979#true} call ULTIMATE.init(); {148002#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:11:32,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {148002#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {147979#true} is VALID [2022-04-08 10:11:32,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {147979#true} assume true; {147979#true} is VALID [2022-04-08 10:11:32,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {147979#true} {147979#true} #72#return; {147979#true} is VALID [2022-04-08 10:11:32,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {147979#true} call #t~ret13 := main(); {147979#true} is VALID [2022-04-08 10:11:32,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {147979#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {147984#(= main_~y~0 0)} is VALID [2022-04-08 10:11:32,692 INFO L290 TraceCheckUtils]: 6: Hoare triple {147984#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147985#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:11:32,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {147985#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147986#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:11:32,692 INFO L290 TraceCheckUtils]: 8: Hoare triple {147986#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147987#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:11:32,693 INFO L290 TraceCheckUtils]: 9: Hoare triple {147987#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147988#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:11:32,693 INFO L290 TraceCheckUtils]: 10: Hoare triple {147988#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147989#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:11:32,694 INFO L290 TraceCheckUtils]: 11: Hoare triple {147989#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147990#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:11:32,694 INFO L290 TraceCheckUtils]: 12: Hoare triple {147990#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147991#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:11:32,695 INFO L290 TraceCheckUtils]: 13: Hoare triple {147991#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147992#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:32,695 INFO L290 TraceCheckUtils]: 14: Hoare triple {147992#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {147992#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:32,695 INFO L290 TraceCheckUtils]: 15: Hoare triple {147992#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {147993#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:11:32,696 INFO L290 TraceCheckUtils]: 16: Hoare triple {147993#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {147994#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:11:32,696 INFO L290 TraceCheckUtils]: 17: Hoare triple {147994#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {147995#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:11:32,697 INFO L290 TraceCheckUtils]: 18: Hoare triple {147995#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {147996#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:11:32,697 INFO L290 TraceCheckUtils]: 19: Hoare triple {147996#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {147997#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:11:32,697 INFO L290 TraceCheckUtils]: 20: Hoare triple {147997#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {147998#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:11:32,698 INFO L290 TraceCheckUtils]: 21: Hoare triple {147998#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {147999#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:11:32,698 INFO L290 TraceCheckUtils]: 22: Hoare triple {147999#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {148000#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:11:32,699 INFO L290 TraceCheckUtils]: 23: Hoare triple {148000#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {148001#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:11:32,699 INFO L290 TraceCheckUtils]: 24: Hoare triple {148001#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {147980#false} is VALID [2022-04-08 10:11:32,699 INFO L290 TraceCheckUtils]: 25: Hoare triple {147980#false} assume !(~z~0 % 4294967296 > 0); {147980#false} is VALID [2022-04-08 10:11:32,699 INFO L290 TraceCheckUtils]: 26: Hoare triple {147980#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147980#false} is VALID [2022-04-08 10:11:32,699 INFO L290 TraceCheckUtils]: 27: Hoare triple {147980#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147980#false} is VALID [2022-04-08 10:11:32,699 INFO L290 TraceCheckUtils]: 28: Hoare triple {147980#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147980#false} is VALID [2022-04-08 10:11:32,699 INFO L290 TraceCheckUtils]: 29: Hoare triple {147980#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147980#false} is VALID [2022-04-08 10:11:32,699 INFO L290 TraceCheckUtils]: 30: Hoare triple {147980#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147980#false} is VALID [2022-04-08 10:11:32,699 INFO L290 TraceCheckUtils]: 31: Hoare triple {147980#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147980#false} is VALID [2022-04-08 10:11:32,699 INFO L290 TraceCheckUtils]: 32: Hoare triple {147980#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147980#false} is VALID [2022-04-08 10:11:32,700 INFO L290 TraceCheckUtils]: 33: Hoare triple {147980#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147980#false} is VALID [2022-04-08 10:11:32,700 INFO L290 TraceCheckUtils]: 34: Hoare triple {147980#false} assume !(~y~0 % 4294967296 > 0); {147980#false} is VALID [2022-04-08 10:11:32,700 INFO L290 TraceCheckUtils]: 35: Hoare triple {147980#false} assume !(~x~0 % 4294967296 > 0); {147980#false} is VALID [2022-04-08 10:11:32,700 INFO L272 TraceCheckUtils]: 36: Hoare triple {147980#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {147980#false} is VALID [2022-04-08 10:11:32,700 INFO L290 TraceCheckUtils]: 37: Hoare triple {147980#false} ~cond := #in~cond; {147980#false} is VALID [2022-04-08 10:11:32,700 INFO L290 TraceCheckUtils]: 38: Hoare triple {147980#false} assume 0 == ~cond; {147980#false} is VALID [2022-04-08 10:11:32,700 INFO L290 TraceCheckUtils]: 39: Hoare triple {147980#false} assume !false; {147980#false} is VALID [2022-04-08 10:11:32,700 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 10:11:32,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:11:32,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071752568] [2022-04-08 10:11:32,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071752568] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:11:32,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319091272] [2022-04-08 10:11:32,700 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:11:32,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:11:32,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:11:32,701 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:11:32,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2022-04-08 10:11:32,754 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:11:32,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:11:32,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 54 conjunts are in the unsatisfiable core [2022-04-08 10:11:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:32,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:11:33,077 INFO L272 TraceCheckUtils]: 0: Hoare triple {147979#true} call ULTIMATE.init(); {147979#true} is VALID [2022-04-08 10:11:33,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {147979#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {147979#true} is VALID [2022-04-08 10:11:33,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {147979#true} assume true; {147979#true} is VALID [2022-04-08 10:11:33,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {147979#true} {147979#true} #72#return; {147979#true} is VALID [2022-04-08 10:11:33,077 INFO L272 TraceCheckUtils]: 4: Hoare triple {147979#true} call #t~ret13 := main(); {147979#true} is VALID [2022-04-08 10:11:33,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {147979#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {147984#(= main_~y~0 0)} is VALID [2022-04-08 10:11:33,078 INFO L290 TraceCheckUtils]: 6: Hoare triple {147984#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147985#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:11:33,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {147985#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147986#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:11:33,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {147986#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147987#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:11:33,079 INFO L290 TraceCheckUtils]: 9: Hoare triple {147987#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147988#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:11:33,080 INFO L290 TraceCheckUtils]: 10: Hoare triple {147988#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147989#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:11:33,080 INFO L290 TraceCheckUtils]: 11: Hoare triple {147989#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147990#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:11:33,081 INFO L290 TraceCheckUtils]: 12: Hoare triple {147990#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147991#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:11:33,081 INFO L290 TraceCheckUtils]: 13: Hoare triple {147991#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147992#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:33,081 INFO L290 TraceCheckUtils]: 14: Hoare triple {147992#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {147992#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:33,082 INFO L290 TraceCheckUtils]: 15: Hoare triple {147992#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {148051#(and (= main_~z~0 main_~y~0) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:33,082 INFO L290 TraceCheckUtils]: 16: Hoare triple {148051#(and (= main_~z~0 main_~y~0) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {148055#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:11:33,082 INFO L290 TraceCheckUtils]: 17: Hoare triple {148055#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {148059#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:33,083 INFO L290 TraceCheckUtils]: 18: Hoare triple {148059#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {148063#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-08 10:11:33,083 INFO L290 TraceCheckUtils]: 19: Hoare triple {148063#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {148067#(and (<= main_~y~0 8) (= main_~y~0 (+ main_~z~0 4)) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:33,084 INFO L290 TraceCheckUtils]: 20: Hoare triple {148067#(and (<= main_~y~0 8) (= main_~y~0 (+ main_~z~0 4)) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {148071#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:33,085 INFO L290 TraceCheckUtils]: 21: Hoare triple {148071#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {148075#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:33,085 INFO L290 TraceCheckUtils]: 22: Hoare triple {148075#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {148079#(and (<= main_~y~0 8) (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:33,086 INFO L290 TraceCheckUtils]: 23: Hoare triple {148079#(and (<= main_~y~0 8) (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {148083#(and (<= main_~y~0 8) (= (+ main_~y~0 (- 6)) (+ main_~z~0 2)) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:33,086 INFO L290 TraceCheckUtils]: 24: Hoare triple {148083#(and (<= main_~y~0 8) (= (+ main_~y~0 (- 6)) (+ main_~z~0 2)) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {147980#false} is VALID [2022-04-08 10:11:33,086 INFO L290 TraceCheckUtils]: 25: Hoare triple {147980#false} assume !(~z~0 % 4294967296 > 0); {147980#false} is VALID [2022-04-08 10:11:33,086 INFO L290 TraceCheckUtils]: 26: Hoare triple {147980#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147980#false} is VALID [2022-04-08 10:11:33,086 INFO L290 TraceCheckUtils]: 27: Hoare triple {147980#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147980#false} is VALID [2022-04-08 10:11:33,086 INFO L290 TraceCheckUtils]: 28: Hoare triple {147980#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147980#false} is VALID [2022-04-08 10:11:33,086 INFO L290 TraceCheckUtils]: 29: Hoare triple {147980#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147980#false} is VALID [2022-04-08 10:11:33,086 INFO L290 TraceCheckUtils]: 30: Hoare triple {147980#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147980#false} is VALID [2022-04-08 10:11:33,086 INFO L290 TraceCheckUtils]: 31: Hoare triple {147980#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147980#false} is VALID [2022-04-08 10:11:33,086 INFO L290 TraceCheckUtils]: 32: Hoare triple {147980#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147980#false} is VALID [2022-04-08 10:11:33,086 INFO L290 TraceCheckUtils]: 33: Hoare triple {147980#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {147980#false} is VALID [2022-04-08 10:11:33,087 INFO L290 TraceCheckUtils]: 34: Hoare triple {147980#false} assume !(~y~0 % 4294967296 > 0); {147980#false} is VALID [2022-04-08 10:11:33,087 INFO L290 TraceCheckUtils]: 35: Hoare triple {147980#false} assume !(~x~0 % 4294967296 > 0); {147980#false} is VALID [2022-04-08 10:11:33,087 INFO L272 TraceCheckUtils]: 36: Hoare triple {147980#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {147980#false} is VALID [2022-04-08 10:11:33,087 INFO L290 TraceCheckUtils]: 37: Hoare triple {147980#false} ~cond := #in~cond; {147980#false} is VALID [2022-04-08 10:11:33,087 INFO L290 TraceCheckUtils]: 38: Hoare triple {147980#false} assume 0 == ~cond; {147980#false} is VALID [2022-04-08 10:11:33,087 INFO L290 TraceCheckUtils]: 39: Hoare triple {147980#false} assume !false; {147980#false} is VALID [2022-04-08 10:11:33,087 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 10:11:33,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:11:33,651 INFO L290 TraceCheckUtils]: 39: Hoare triple {147980#false} assume !false; {147980#false} is VALID [2022-04-08 10:11:33,651 INFO L290 TraceCheckUtils]: 38: Hoare triple {147980#false} assume 0 == ~cond; {147980#false} is VALID [2022-04-08 10:11:33,651 INFO L290 TraceCheckUtils]: 37: Hoare triple {147980#false} ~cond := #in~cond; {147980#false} is VALID [2022-04-08 10:11:33,651 INFO L272 TraceCheckUtils]: 36: Hoare triple {147980#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {147980#false} is VALID [2022-04-08 10:11:33,652 INFO L290 TraceCheckUtils]: 35: Hoare triple {147980#false} assume !(~x~0 % 4294967296 > 0); {147980#false} is VALID [2022-04-08 10:11:33,652 INFO L290 TraceCheckUtils]: 34: Hoare triple {148147#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {147980#false} is VALID [2022-04-08 10:11:33,652 INFO L290 TraceCheckUtils]: 33: Hoare triple {148151#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {148147#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:11:33,653 INFO L290 TraceCheckUtils]: 32: Hoare triple {148155#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {148151#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:11:33,654 INFO L290 TraceCheckUtils]: 31: Hoare triple {148159#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {148155#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:11:33,655 INFO L290 TraceCheckUtils]: 30: Hoare triple {148163#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {148159#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:11:33,656 INFO L290 TraceCheckUtils]: 29: Hoare triple {148167#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {148163#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:33,656 INFO L290 TraceCheckUtils]: 28: Hoare triple {148171#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {148167#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:33,657 INFO L290 TraceCheckUtils]: 27: Hoare triple {148175#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {148171#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:33,657 INFO L290 TraceCheckUtils]: 26: Hoare triple {148179#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {148175#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:11:33,657 INFO L290 TraceCheckUtils]: 25: Hoare triple {148179#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {148179#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:33,658 INFO L290 TraceCheckUtils]: 24: Hoare triple {148186#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {148179#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:33,659 INFO L290 TraceCheckUtils]: 23: Hoare triple {148190#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {148186#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:11:33,659 INFO L290 TraceCheckUtils]: 22: Hoare triple {148194#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {148190#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:11:33,660 INFO L290 TraceCheckUtils]: 21: Hoare triple {148198#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {148194#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:11:33,661 INFO L290 TraceCheckUtils]: 20: Hoare triple {148202#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {148198#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:11:33,661 INFO L290 TraceCheckUtils]: 19: Hoare triple {148206#(or (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {148202#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:11:33,662 INFO L290 TraceCheckUtils]: 18: Hoare triple {148210#(or (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {148206#(or (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-08 10:11:33,663 INFO L290 TraceCheckUtils]: 17: Hoare triple {148214#(or (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {148210#(or (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:11:33,663 INFO L290 TraceCheckUtils]: 16: Hoare triple {148218#(or (not (< 0 (mod (+ 4294967288 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {148214#(or (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:11:33,664 INFO L290 TraceCheckUtils]: 15: Hoare triple {147979#true} ~z~0 := ~y~0; {148218#(or (not (< 0 (mod (+ 4294967288 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-08 10:11:33,664 INFO L290 TraceCheckUtils]: 14: Hoare triple {147979#true} assume !(~x~0 % 4294967296 > 0); {147979#true} is VALID [2022-04-08 10:11:33,664 INFO L290 TraceCheckUtils]: 13: Hoare triple {147979#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147979#true} is VALID [2022-04-08 10:11:33,664 INFO L290 TraceCheckUtils]: 12: Hoare triple {147979#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147979#true} is VALID [2022-04-08 10:11:33,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {147979#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147979#true} is VALID [2022-04-08 10:11:33,664 INFO L290 TraceCheckUtils]: 10: Hoare triple {147979#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147979#true} is VALID [2022-04-08 10:11:33,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {147979#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147979#true} is VALID [2022-04-08 10:11:33,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {147979#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147979#true} is VALID [2022-04-08 10:11:33,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {147979#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147979#true} is VALID [2022-04-08 10:11:33,664 INFO L290 TraceCheckUtils]: 6: Hoare triple {147979#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {147979#true} is VALID [2022-04-08 10:11:33,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {147979#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {147979#true} is VALID [2022-04-08 10:11:33,664 INFO L272 TraceCheckUtils]: 4: Hoare triple {147979#true} call #t~ret13 := main(); {147979#true} is VALID [2022-04-08 10:11:33,664 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {147979#true} {147979#true} #72#return; {147979#true} is VALID [2022-04-08 10:11:33,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {147979#true} assume true; {147979#true} is VALID [2022-04-08 10:11:33,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {147979#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {147979#true} is VALID [2022-04-08 10:11:33,664 INFO L272 TraceCheckUtils]: 0: Hoare triple {147979#true} call ULTIMATE.init(); {147979#true} is VALID [2022-04-08 10:11:33,665 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-08 10:11:33,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319091272] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:11:33,665 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:11:33,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 48 [2022-04-08 10:11:33,665 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:11:33,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [420423835] [2022-04-08 10:11:33,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [420423835] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:11:33,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:11:33,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 10:11:33,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444726524] [2022-04-08 10:11:33,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:11:33,665 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 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 40 [2022-04-08 10:11:33,665 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:11:33,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 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-08 10:11:33,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:33,683 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 10:11:33,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:33,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 10:11:33,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=1902, Unknown=0, NotChecked=0, Total=2256 [2022-04-08 10:11:33,684 INFO L87 Difference]: Start difference. First operand 495 states and 677 transitions. Second operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 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-08 10:11:38,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:38,705 INFO L93 Difference]: Finished difference Result 593 states and 780 transitions. [2022-04-08 10:11:38,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-04-08 10:11:38,705 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 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 40 [2022-04-08 10:11:38,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:11:38,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 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-08 10:11:38,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 110 transitions. [2022-04-08 10:11:38,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 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-08 10:11:38,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 110 transitions. [2022-04-08 10:11:38,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 110 transitions. [2022-04-08 10:11:38,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:38,778 INFO L225 Difference]: With dead ends: 593 [2022-04-08 10:11:38,778 INFO L226 Difference]: Without dead ends: 536 [2022-04-08 10:11:38,779 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2288 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1488, Invalid=8814, Unknown=0, NotChecked=0, Total=10302 [2022-04-08 10:11:38,779 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 39 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1367 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 10:11:38,779 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 113 Invalid, 1468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1367 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 10:11:38,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2022-04-08 10:11:40,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 494. [2022-04-08 10:11:40,470 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:11:40,470 INFO L82 GeneralOperation]: Start isEquivalent. First operand 536 states. Second operand has 494 states, 489 states have (on average 1.3640081799591002) internal successors, (667), 489 states have internal predecessors, (667), 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-08 10:11:40,471 INFO L74 IsIncluded]: Start isIncluded. First operand 536 states. Second operand has 494 states, 489 states have (on average 1.3640081799591002) internal successors, (667), 489 states have internal predecessors, (667), 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-08 10:11:40,471 INFO L87 Difference]: Start difference. First operand 536 states. Second operand has 494 states, 489 states have (on average 1.3640081799591002) internal successors, (667), 489 states have internal predecessors, (667), 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-08 10:11:40,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:40,479 INFO L93 Difference]: Finished difference Result 536 states and 718 transitions. [2022-04-08 10:11:40,479 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 718 transitions. [2022-04-08 10:11:40,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:40,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:40,480 INFO L74 IsIncluded]: Start isIncluded. First operand has 494 states, 489 states have (on average 1.3640081799591002) internal successors, (667), 489 states have internal predecessors, (667), 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 536 states. [2022-04-08 10:11:40,480 INFO L87 Difference]: Start difference. First operand has 494 states, 489 states have (on average 1.3640081799591002) internal successors, (667), 489 states have internal predecessors, (667), 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 536 states. [2022-04-08 10:11:40,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:11:40,488 INFO L93 Difference]: Finished difference Result 536 states and 718 transitions. [2022-04-08 10:11:40,488 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 718 transitions. [2022-04-08 10:11:40,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:11:40,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:11:40,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:11:40,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:11:40,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 489 states have (on average 1.3640081799591002) internal successors, (667), 489 states have internal predecessors, (667), 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-08 10:11:40,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 671 transitions. [2022-04-08 10:11:40,498 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 671 transitions. Word has length 40 [2022-04-08 10:11:40,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:11:40,498 INFO L478 AbstractCegarLoop]: Abstraction has 494 states and 671 transitions. [2022-04-08 10:11:40,498 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 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-08 10:11:40,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 494 states and 671 transitions. [2022-04-08 10:11:44,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 671 edges. 671 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:44,072 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 671 transitions. [2022-04-08 10:11:44,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-08 10:11:44,073 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:11:44,073 INFO L499 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:11:44,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Forceful destruction successful, exit code 0 [2022-04-08 10:11:44,288 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79,78 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:11:44,289 INFO L403 AbstractCegarLoop]: === Iteration 81 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:11:44,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:11:44,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1459532769, now seen corresponding path program 49 times [2022-04-08 10:11:44,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:44,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [65865682] [2022-04-08 10:11:44,291 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:11:44,291 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:11:44,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1459532769, now seen corresponding path program 50 times [2022-04-08 10:11:44,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:11:44,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079695497] [2022-04-08 10:11:44,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:11:44,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:11:44,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:44,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:11:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:44,820 INFO L290 TraceCheckUtils]: 0: Hoare triple {151655#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {151623#true} is VALID [2022-04-08 10:11:44,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {151623#true} assume true; {151623#true} is VALID [2022-04-08 10:11:44,820 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {151623#true} {151623#true} #72#return; {151623#true} is VALID [2022-04-08 10:11:44,821 INFO L272 TraceCheckUtils]: 0: Hoare triple {151623#true} call ULTIMATE.init(); {151655#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:11:44,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {151655#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {151623#true} is VALID [2022-04-08 10:11:44,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {151623#true} assume true; {151623#true} is VALID [2022-04-08 10:11:44,821 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {151623#true} {151623#true} #72#return; {151623#true} is VALID [2022-04-08 10:11:44,821 INFO L272 TraceCheckUtils]: 4: Hoare triple {151623#true} call #t~ret13 := main(); {151623#true} is VALID [2022-04-08 10:11:44,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {151623#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {151628#(= main_~y~0 0)} is VALID [2022-04-08 10:11:44,822 INFO L290 TraceCheckUtils]: 6: Hoare triple {151628#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151629#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:11:44,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {151629#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151630#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:11:44,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {151630#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151631#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:11:44,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {151631#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151632#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:11:44,839 INFO L290 TraceCheckUtils]: 10: Hoare triple {151632#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151633#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:11:44,840 INFO L290 TraceCheckUtils]: 11: Hoare triple {151633#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151634#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:11:44,841 INFO L290 TraceCheckUtils]: 12: Hoare triple {151634#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151635#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:11:44,841 INFO L290 TraceCheckUtils]: 13: Hoare triple {151635#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151636#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:44,842 INFO L290 TraceCheckUtils]: 14: Hoare triple {151636#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151637#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:11:44,842 INFO L290 TraceCheckUtils]: 15: Hoare triple {151637#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151638#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:11:44,843 INFO L290 TraceCheckUtils]: 16: Hoare triple {151638#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151639#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:11:44,843 INFO L290 TraceCheckUtils]: 17: Hoare triple {151639#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151640#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:11:44,844 INFO L290 TraceCheckUtils]: 18: Hoare triple {151640#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151641#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:11:44,844 INFO L290 TraceCheckUtils]: 19: Hoare triple {151641#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151642#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:11:44,845 INFO L290 TraceCheckUtils]: 20: Hoare triple {151642#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151643#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:11:44,845 INFO L290 TraceCheckUtils]: 21: Hoare triple {151643#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151644#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:11:44,846 INFO L290 TraceCheckUtils]: 22: Hoare triple {151644#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151645#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:11:44,846 INFO L290 TraceCheckUtils]: 23: Hoare triple {151645#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151646#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:11:44,847 INFO L290 TraceCheckUtils]: 24: Hoare triple {151646#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151647#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:11:44,847 INFO L290 TraceCheckUtils]: 25: Hoare triple {151647#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151648#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:11:44,848 INFO L290 TraceCheckUtils]: 26: Hoare triple {151648#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151649#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:11:44,848 INFO L290 TraceCheckUtils]: 27: Hoare triple {151649#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151650#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:11:44,849 INFO L290 TraceCheckUtils]: 28: Hoare triple {151650#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151651#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:11:44,849 INFO L290 TraceCheckUtils]: 29: Hoare triple {151651#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151652#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-08 10:11:44,850 INFO L290 TraceCheckUtils]: 30: Hoare triple {151652#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151653#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-08 10:11:44,850 INFO L290 TraceCheckUtils]: 31: Hoare triple {151653#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !(~x~0 % 4294967296 > 0); {151653#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-08 10:11:44,850 INFO L290 TraceCheckUtils]: 32: Hoare triple {151653#(and (<= 25 main_~y~0) (<= main_~y~0 25))} ~z~0 := ~y~0; {151654#(and (<= 25 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:11:44,851 INFO L290 TraceCheckUtils]: 33: Hoare triple {151654#(and (<= 25 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {151624#false} is VALID [2022-04-08 10:11:44,851 INFO L290 TraceCheckUtils]: 34: Hoare triple {151624#false} assume !(~y~0 % 4294967296 > 0); {151624#false} is VALID [2022-04-08 10:11:44,851 INFO L290 TraceCheckUtils]: 35: Hoare triple {151624#false} assume !(~x~0 % 4294967296 > 0); {151624#false} is VALID [2022-04-08 10:11:44,851 INFO L272 TraceCheckUtils]: 36: Hoare triple {151624#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {151624#false} is VALID [2022-04-08 10:11:44,851 INFO L290 TraceCheckUtils]: 37: Hoare triple {151624#false} ~cond := #in~cond; {151624#false} is VALID [2022-04-08 10:11:44,851 INFO L290 TraceCheckUtils]: 38: Hoare triple {151624#false} assume 0 == ~cond; {151624#false} is VALID [2022-04-08 10:11:44,851 INFO L290 TraceCheckUtils]: 39: Hoare triple {151624#false} assume !false; {151624#false} is VALID [2022-04-08 10:11:44,851 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:11:44,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:11:44,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079695497] [2022-04-08 10:11:44,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079695497] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:11:44,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736472620] [2022-04-08 10:11:44,852 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:11:44,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:11:44,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:11:44,853 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:11:44,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2022-04-08 10:11:44,902 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:11:44,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:11:44,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 55 conjunts are in the unsatisfiable core [2022-04-08 10:11:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:11:44,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:11:45,314 INFO L272 TraceCheckUtils]: 0: Hoare triple {151623#true} call ULTIMATE.init(); {151623#true} is VALID [2022-04-08 10:11:45,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {151623#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {151623#true} is VALID [2022-04-08 10:11:45,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {151623#true} assume true; {151623#true} is VALID [2022-04-08 10:11:45,314 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {151623#true} {151623#true} #72#return; {151623#true} is VALID [2022-04-08 10:11:45,314 INFO L272 TraceCheckUtils]: 4: Hoare triple {151623#true} call #t~ret13 := main(); {151623#true} is VALID [2022-04-08 10:11:45,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {151623#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {151628#(= main_~y~0 0)} is VALID [2022-04-08 10:11:45,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {151628#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151629#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:11:45,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {151629#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151630#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:11:45,316 INFO L290 TraceCheckUtils]: 8: Hoare triple {151630#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151631#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:11:45,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {151631#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151632#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:11:45,317 INFO L290 TraceCheckUtils]: 10: Hoare triple {151632#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151633#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:11:45,317 INFO L290 TraceCheckUtils]: 11: Hoare triple {151633#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151634#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:11:45,318 INFO L290 TraceCheckUtils]: 12: Hoare triple {151634#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151635#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:11:45,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {151635#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151636#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:11:45,319 INFO L290 TraceCheckUtils]: 14: Hoare triple {151636#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151637#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:11:45,319 INFO L290 TraceCheckUtils]: 15: Hoare triple {151637#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151638#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:11:45,320 INFO L290 TraceCheckUtils]: 16: Hoare triple {151638#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151639#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:11:45,320 INFO L290 TraceCheckUtils]: 17: Hoare triple {151639#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151640#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:11:45,321 INFO L290 TraceCheckUtils]: 18: Hoare triple {151640#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151641#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:11:45,321 INFO L290 TraceCheckUtils]: 19: Hoare triple {151641#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151642#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:11:45,322 INFO L290 TraceCheckUtils]: 20: Hoare triple {151642#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151643#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:11:45,322 INFO L290 TraceCheckUtils]: 21: Hoare triple {151643#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151644#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:11:45,323 INFO L290 TraceCheckUtils]: 22: Hoare triple {151644#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151645#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:11:45,323 INFO L290 TraceCheckUtils]: 23: Hoare triple {151645#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151646#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:11:45,324 INFO L290 TraceCheckUtils]: 24: Hoare triple {151646#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151647#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:11:45,324 INFO L290 TraceCheckUtils]: 25: Hoare triple {151647#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151648#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:11:45,325 INFO L290 TraceCheckUtils]: 26: Hoare triple {151648#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151649#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:11:45,325 INFO L290 TraceCheckUtils]: 27: Hoare triple {151649#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151650#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:11:45,326 INFO L290 TraceCheckUtils]: 28: Hoare triple {151650#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151651#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:11:45,326 INFO L290 TraceCheckUtils]: 29: Hoare triple {151651#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151652#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-08 10:11:45,327 INFO L290 TraceCheckUtils]: 30: Hoare triple {151652#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151653#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-08 10:11:45,327 INFO L290 TraceCheckUtils]: 31: Hoare triple {151653#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !(~x~0 % 4294967296 > 0); {151653#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-08 10:11:45,328 INFO L290 TraceCheckUtils]: 32: Hoare triple {151653#(and (<= 25 main_~y~0) (<= main_~y~0 25))} ~z~0 := ~y~0; {151755#(and (<= 25 main_~z~0) (<= main_~z~0 25))} is VALID [2022-04-08 10:11:45,328 INFO L290 TraceCheckUtils]: 33: Hoare triple {151755#(and (<= 25 main_~z~0) (<= main_~z~0 25))} assume !(~z~0 % 4294967296 > 0); {151624#false} is VALID [2022-04-08 10:11:45,328 INFO L290 TraceCheckUtils]: 34: Hoare triple {151624#false} assume !(~y~0 % 4294967296 > 0); {151624#false} is VALID [2022-04-08 10:11:45,328 INFO L290 TraceCheckUtils]: 35: Hoare triple {151624#false} assume !(~x~0 % 4294967296 > 0); {151624#false} is VALID [2022-04-08 10:11:45,328 INFO L272 TraceCheckUtils]: 36: Hoare triple {151624#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {151624#false} is VALID [2022-04-08 10:11:45,328 INFO L290 TraceCheckUtils]: 37: Hoare triple {151624#false} ~cond := #in~cond; {151624#false} is VALID [2022-04-08 10:11:45,328 INFO L290 TraceCheckUtils]: 38: Hoare triple {151624#false} assume 0 == ~cond; {151624#false} is VALID [2022-04-08 10:11:45,328 INFO L290 TraceCheckUtils]: 39: Hoare triple {151624#false} assume !false; {151624#false} is VALID [2022-04-08 10:11:45,328 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:11:45,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:11:46,425 INFO L290 TraceCheckUtils]: 39: Hoare triple {151624#false} assume !false; {151624#false} is VALID [2022-04-08 10:11:46,426 INFO L290 TraceCheckUtils]: 38: Hoare triple {151624#false} assume 0 == ~cond; {151624#false} is VALID [2022-04-08 10:11:46,426 INFO L290 TraceCheckUtils]: 37: Hoare triple {151624#false} ~cond := #in~cond; {151624#false} is VALID [2022-04-08 10:11:46,426 INFO L272 TraceCheckUtils]: 36: Hoare triple {151624#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {151624#false} is VALID [2022-04-08 10:11:46,426 INFO L290 TraceCheckUtils]: 35: Hoare triple {151624#false} assume !(~x~0 % 4294967296 > 0); {151624#false} is VALID [2022-04-08 10:11:46,426 INFO L290 TraceCheckUtils]: 34: Hoare triple {151624#false} assume !(~y~0 % 4294967296 > 0); {151624#false} is VALID [2022-04-08 10:11:46,426 INFO L290 TraceCheckUtils]: 33: Hoare triple {151795#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {151624#false} is VALID [2022-04-08 10:11:46,426 INFO L290 TraceCheckUtils]: 32: Hoare triple {151799#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {151795#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:11:46,426 INFO L290 TraceCheckUtils]: 31: Hoare triple {151799#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {151799#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:11:46,427 INFO L290 TraceCheckUtils]: 30: Hoare triple {151806#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151799#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:11:46,428 INFO L290 TraceCheckUtils]: 29: Hoare triple {151810#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151806#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:11:46,428 INFO L290 TraceCheckUtils]: 28: Hoare triple {151814#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151810#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:11:46,429 INFO L290 TraceCheckUtils]: 27: Hoare triple {151818#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151814#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:11:46,429 INFO L290 TraceCheckUtils]: 26: Hoare triple {151822#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151818#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:11:46,430 INFO L290 TraceCheckUtils]: 25: Hoare triple {151826#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151822#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:46,430 INFO L290 TraceCheckUtils]: 24: Hoare triple {151830#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151826#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:11:46,431 INFO L290 TraceCheckUtils]: 23: Hoare triple {151834#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151830#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:46,431 INFO L290 TraceCheckUtils]: 22: Hoare triple {151838#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151834#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:11:46,432 INFO L290 TraceCheckUtils]: 21: Hoare triple {151842#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151838#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:11:46,432 INFO L290 TraceCheckUtils]: 20: Hoare triple {151846#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151842#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:11:46,433 INFO L290 TraceCheckUtils]: 19: Hoare triple {151850#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151846#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:11:46,433 INFO L290 TraceCheckUtils]: 18: Hoare triple {151854#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151850#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:11:46,434 INFO L290 TraceCheckUtils]: 17: Hoare triple {151858#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151854#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:11:46,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {151862#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151858#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:11:46,435 INFO L290 TraceCheckUtils]: 15: Hoare triple {151866#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151862#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:11:46,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {151870#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151866#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:11:46,436 INFO L290 TraceCheckUtils]: 13: Hoare triple {151874#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151870#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:11:46,436 INFO L290 TraceCheckUtils]: 12: Hoare triple {151878#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151874#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-08 10:11:46,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {151882#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151878#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:46,438 INFO L290 TraceCheckUtils]: 10: Hoare triple {151886#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151882#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-08 10:11:46,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {151890#(< 0 (mod (+ main_~y~0 22) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151886#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-08 10:11:46,439 INFO L290 TraceCheckUtils]: 8: Hoare triple {151894#(< 0 (mod (+ 23 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151890#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-08 10:11:46,439 INFO L290 TraceCheckUtils]: 7: Hoare triple {151898#(< 0 (mod (+ main_~y~0 24) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151894#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID [2022-04-08 10:11:46,440 INFO L290 TraceCheckUtils]: 6: Hoare triple {151902#(< 0 (mod (+ main_~y~0 25) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {151898#(< 0 (mod (+ main_~y~0 24) 4294967296))} is VALID [2022-04-08 10:11:46,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {151623#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {151902#(< 0 (mod (+ main_~y~0 25) 4294967296))} is VALID [2022-04-08 10:11:46,440 INFO L272 TraceCheckUtils]: 4: Hoare triple {151623#true} call #t~ret13 := main(); {151623#true} is VALID [2022-04-08 10:11:46,440 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {151623#true} {151623#true} #72#return; {151623#true} is VALID [2022-04-08 10:11:46,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {151623#true} assume true; {151623#true} is VALID [2022-04-08 10:11:46,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {151623#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {151623#true} is VALID [2022-04-08 10:11:46,440 INFO L272 TraceCheckUtils]: 0: Hoare triple {151623#true} call ULTIMATE.init(); {151623#true} is VALID [2022-04-08 10:11:46,440 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:11:46,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736472620] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:11:46,440 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:11:46,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 58 [2022-04-08 10:11:46,441 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:11:46,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [65865682] [2022-04-08 10:11:46,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [65865682] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:11:46,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:11:46,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-08 10:11:46,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292999727] [2022-04-08 10:11:46,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:11:46,441 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 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 40 [2022-04-08 10:11:46,441 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:11:46,441 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 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-08 10:11:46,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:11:46,458 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-08 10:11:46,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:11:46,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-08 10:11:46,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=791, Invalid=2515, Unknown=0, NotChecked=0, Total=3306 [2022-04-08 10:11:46,458 INFO L87 Difference]: Start difference. First operand 494 states and 671 transitions. Second operand has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 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-08 10:12:00,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:00,173 INFO L93 Difference]: Finished difference Result 865 states and 1323 transitions. [2022-04-08 10:12:00,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-08 10:12:00,173 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 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 40 [2022-04-08 10:12:00,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:12:00,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 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-08 10:12:00,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 261 transitions. [2022-04-08 10:12:00,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 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-08 10:12:00,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 261 transitions. [2022-04-08 10:12:00,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 261 transitions. [2022-04-08 10:12:00,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:00,339 INFO L225 Difference]: With dead ends: 865 [2022-04-08 10:12:00,339 INFO L226 Difference]: Without dead ends: 834 [2022-04-08 10:12:00,351 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1603, Invalid=5537, Unknown=0, NotChecked=0, Total=7140 [2022-04-08 10:12:00,352 INFO L913 BasicCegarLoop]: 117 mSDtfsCounter, 196 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 5590 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 5732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 5590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:12:00,352 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 254 Invalid, 5732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 5590 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-04-08 10:12:00,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2022-04-08 10:12:02,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 515. [2022-04-08 10:12:02,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:12:02,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 834 states. Second operand has 515 states, 510 states have (on average 1.3686274509803922) internal successors, (698), 510 states have internal predecessors, (698), 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-08 10:12:02,148 INFO L74 IsIncluded]: Start isIncluded. First operand 834 states. Second operand has 515 states, 510 states have (on average 1.3686274509803922) internal successors, (698), 510 states have internal predecessors, (698), 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-08 10:12:02,148 INFO L87 Difference]: Start difference. First operand 834 states. Second operand has 515 states, 510 states have (on average 1.3686274509803922) internal successors, (698), 510 states have internal predecessors, (698), 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-08 10:12:02,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:02,167 INFO L93 Difference]: Finished difference Result 834 states and 1047 transitions. [2022-04-08 10:12:02,167 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1047 transitions. [2022-04-08 10:12:02,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:02,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:02,168 INFO L74 IsIncluded]: Start isIncluded. First operand has 515 states, 510 states have (on average 1.3686274509803922) internal successors, (698), 510 states have internal predecessors, (698), 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 834 states. [2022-04-08 10:12:02,168 INFO L87 Difference]: Start difference. First operand has 515 states, 510 states have (on average 1.3686274509803922) internal successors, (698), 510 states have internal predecessors, (698), 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 834 states. [2022-04-08 10:12:02,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:02,187 INFO L93 Difference]: Finished difference Result 834 states and 1047 transitions. [2022-04-08 10:12:02,187 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1047 transitions. [2022-04-08 10:12:02,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:02,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:02,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:12:02,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:12:02,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 510 states have (on average 1.3686274509803922) internal successors, (698), 510 states have internal predecessors, (698), 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-08 10:12:02,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 702 transitions. [2022-04-08 10:12:02,199 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 702 transitions. Word has length 40 [2022-04-08 10:12:02,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:12:02,199 INFO L478 AbstractCegarLoop]: Abstraction has 515 states and 702 transitions. [2022-04-08 10:12:02,199 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 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-08 10:12:02,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 515 states and 702 transitions. [2022-04-08 10:12:06,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 702 edges. 702 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:06,105 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 702 transitions. [2022-04-08 10:12:06,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 10:12:06,105 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:12:06,105 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:12:06,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Forceful destruction successful, exit code 0 [2022-04-08 10:12:06,321 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,79 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:12:06,321 INFO L403 AbstractCegarLoop]: === Iteration 82 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:12:06,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:12:06,321 INFO L85 PathProgramCache]: Analyzing trace with hash -335029466, now seen corresponding path program 75 times [2022-04-08 10:12:06,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:06,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [843078848] [2022-04-08 10:12:06,323 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:12:06,323 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:12:06,323 INFO L85 PathProgramCache]: Analyzing trace with hash -335029466, now seen corresponding path program 76 times [2022-04-08 10:12:06,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:12:06,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602519531] [2022-04-08 10:12:06,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:12:06,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:12:06,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:06,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:12:06,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:06,515 INFO L290 TraceCheckUtils]: 0: Hoare triple {156425#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {156405#true} is VALID [2022-04-08 10:12:06,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {156405#true} assume true; {156405#true} is VALID [2022-04-08 10:12:06,516 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {156405#true} {156405#true} #72#return; {156405#true} is VALID [2022-04-08 10:12:06,516 INFO L272 TraceCheckUtils]: 0: Hoare triple {156405#true} call ULTIMATE.init(); {156425#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:12:06,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {156425#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {156405#true} is VALID [2022-04-08 10:12:06,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {156405#true} assume true; {156405#true} is VALID [2022-04-08 10:12:06,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {156405#true} {156405#true} #72#return; {156405#true} is VALID [2022-04-08 10:12:06,516 INFO L272 TraceCheckUtils]: 4: Hoare triple {156405#true} call #t~ret13 := main(); {156405#true} is VALID [2022-04-08 10:12:06,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {156405#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {156410#(= main_~y~0 0)} is VALID [2022-04-08 10:12:06,517 INFO L290 TraceCheckUtils]: 6: Hoare triple {156410#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156411#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:12:06,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {156411#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156412#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:12:06,518 INFO L290 TraceCheckUtils]: 8: Hoare triple {156412#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156413#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:12:06,518 INFO L290 TraceCheckUtils]: 9: Hoare triple {156413#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156414#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:12:06,518 INFO L290 TraceCheckUtils]: 10: Hoare triple {156414#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156415#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:12:06,519 INFO L290 TraceCheckUtils]: 11: Hoare triple {156415#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156416#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:12:06,519 INFO L290 TraceCheckUtils]: 12: Hoare triple {156416#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156417#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:12:06,520 INFO L290 TraceCheckUtils]: 13: Hoare triple {156417#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156418#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:12:06,520 INFO L290 TraceCheckUtils]: 14: Hoare triple {156418#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156419#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:12:06,521 INFO L290 TraceCheckUtils]: 15: Hoare triple {156419#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {156419#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:12:06,521 INFO L290 TraceCheckUtils]: 16: Hoare triple {156419#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {156420#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:12:06,521 INFO L290 TraceCheckUtils]: 17: Hoare triple {156420#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {156421#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:12:06,522 INFO L290 TraceCheckUtils]: 18: Hoare triple {156421#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {156422#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:12:06,522 INFO L290 TraceCheckUtils]: 19: Hoare triple {156422#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {156423#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:12:06,523 INFO L290 TraceCheckUtils]: 20: Hoare triple {156423#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {156424#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:12:06,523 INFO L290 TraceCheckUtils]: 21: Hoare triple {156424#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {156406#false} is VALID [2022-04-08 10:12:06,523 INFO L290 TraceCheckUtils]: 22: Hoare triple {156406#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {156406#false} is VALID [2022-04-08 10:12:06,523 INFO L290 TraceCheckUtils]: 23: Hoare triple {156406#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {156406#false} is VALID [2022-04-08 10:12:06,523 INFO L290 TraceCheckUtils]: 24: Hoare triple {156406#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {156406#false} is VALID [2022-04-08 10:12:06,523 INFO L290 TraceCheckUtils]: 25: Hoare triple {156406#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {156406#false} is VALID [2022-04-08 10:12:06,523 INFO L290 TraceCheckUtils]: 26: Hoare triple {156406#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {156406#false} is VALID [2022-04-08 10:12:06,523 INFO L290 TraceCheckUtils]: 27: Hoare triple {156406#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {156406#false} is VALID [2022-04-08 10:12:06,523 INFO L290 TraceCheckUtils]: 28: Hoare triple {156406#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {156406#false} is VALID [2022-04-08 10:12:06,524 INFO L290 TraceCheckUtils]: 29: Hoare triple {156406#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {156406#false} is VALID [2022-04-08 10:12:06,524 INFO L290 TraceCheckUtils]: 30: Hoare triple {156406#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {156406#false} is VALID [2022-04-08 10:12:06,524 INFO L290 TraceCheckUtils]: 31: Hoare triple {156406#false} assume !(~y~0 % 4294967296 > 0); {156406#false} is VALID [2022-04-08 10:12:06,524 INFO L290 TraceCheckUtils]: 32: Hoare triple {156406#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {156406#false} is VALID [2022-04-08 10:12:06,524 INFO L290 TraceCheckUtils]: 33: Hoare triple {156406#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {156406#false} is VALID [2022-04-08 10:12:06,524 INFO L290 TraceCheckUtils]: 34: Hoare triple {156406#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {156406#false} is VALID [2022-04-08 10:12:06,524 INFO L290 TraceCheckUtils]: 35: Hoare triple {156406#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {156406#false} is VALID [2022-04-08 10:12:06,524 INFO L290 TraceCheckUtils]: 36: Hoare triple {156406#false} assume !(~x~0 % 4294967296 > 0); {156406#false} is VALID [2022-04-08 10:12:06,524 INFO L272 TraceCheckUtils]: 37: Hoare triple {156406#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {156406#false} is VALID [2022-04-08 10:12:06,524 INFO L290 TraceCheckUtils]: 38: Hoare triple {156406#false} ~cond := #in~cond; {156406#false} is VALID [2022-04-08 10:12:06,524 INFO L290 TraceCheckUtils]: 39: Hoare triple {156406#false} assume 0 == ~cond; {156406#false} is VALID [2022-04-08 10:12:06,524 INFO L290 TraceCheckUtils]: 40: Hoare triple {156406#false} assume !false; {156406#false} is VALID [2022-04-08 10:12:06,524 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-08 10:12:06,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:12:06,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602519531] [2022-04-08 10:12:06,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602519531] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:12:06,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67089083] [2022-04-08 10:12:06,524 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:12:06,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:12:06,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:12:06,525 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:12:06,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2022-04-08 10:12:06,573 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:12:06,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:12:06,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 10:12:06,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:06,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:12:06,799 INFO L272 TraceCheckUtils]: 0: Hoare triple {156405#true} call ULTIMATE.init(); {156405#true} is VALID [2022-04-08 10:12:06,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {156405#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {156405#true} is VALID [2022-04-08 10:12:06,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {156405#true} assume true; {156405#true} is VALID [2022-04-08 10:12:06,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {156405#true} {156405#true} #72#return; {156405#true} is VALID [2022-04-08 10:12:06,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {156405#true} call #t~ret13 := main(); {156405#true} is VALID [2022-04-08 10:12:06,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {156405#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {156410#(= main_~y~0 0)} is VALID [2022-04-08 10:12:06,800 INFO L290 TraceCheckUtils]: 6: Hoare triple {156410#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156411#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:12:06,800 INFO L290 TraceCheckUtils]: 7: Hoare triple {156411#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156412#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:12:06,801 INFO L290 TraceCheckUtils]: 8: Hoare triple {156412#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156413#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:12:06,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {156413#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156414#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:12:06,802 INFO L290 TraceCheckUtils]: 10: Hoare triple {156414#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156415#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:12:06,802 INFO L290 TraceCheckUtils]: 11: Hoare triple {156415#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156416#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:12:06,802 INFO L290 TraceCheckUtils]: 12: Hoare triple {156416#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156417#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:12:06,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {156417#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156418#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:12:06,803 INFO L290 TraceCheckUtils]: 14: Hoare triple {156418#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156419#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:12:06,804 INFO L290 TraceCheckUtils]: 15: Hoare triple {156419#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {156419#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:12:06,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {156419#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {156420#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:12:06,804 INFO L290 TraceCheckUtils]: 17: Hoare triple {156420#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {156421#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:12:06,805 INFO L290 TraceCheckUtils]: 18: Hoare triple {156421#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {156422#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:12:06,805 INFO L290 TraceCheckUtils]: 19: Hoare triple {156422#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {156423#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:12:06,806 INFO L290 TraceCheckUtils]: 20: Hoare triple {156423#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {156489#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:12:06,806 INFO L290 TraceCheckUtils]: 21: Hoare triple {156489#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {156406#false} is VALID [2022-04-08 10:12:06,806 INFO L290 TraceCheckUtils]: 22: Hoare triple {156406#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {156406#false} is VALID [2022-04-08 10:12:06,806 INFO L290 TraceCheckUtils]: 23: Hoare triple {156406#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {156406#false} is VALID [2022-04-08 10:12:06,806 INFO L290 TraceCheckUtils]: 24: Hoare triple {156406#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {156406#false} is VALID [2022-04-08 10:12:06,806 INFO L290 TraceCheckUtils]: 25: Hoare triple {156406#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {156406#false} is VALID [2022-04-08 10:12:06,806 INFO L290 TraceCheckUtils]: 26: Hoare triple {156406#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {156406#false} is VALID [2022-04-08 10:12:06,807 INFO L290 TraceCheckUtils]: 27: Hoare triple {156406#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {156406#false} is VALID [2022-04-08 10:12:06,807 INFO L290 TraceCheckUtils]: 28: Hoare triple {156406#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {156406#false} is VALID [2022-04-08 10:12:06,826 INFO L290 TraceCheckUtils]: 29: Hoare triple {156406#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {156406#false} is VALID [2022-04-08 10:12:06,826 INFO L290 TraceCheckUtils]: 30: Hoare triple {156406#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {156406#false} is VALID [2022-04-08 10:12:06,826 INFO L290 TraceCheckUtils]: 31: Hoare triple {156406#false} assume !(~y~0 % 4294967296 > 0); {156406#false} is VALID [2022-04-08 10:12:06,826 INFO L290 TraceCheckUtils]: 32: Hoare triple {156406#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {156406#false} is VALID [2022-04-08 10:12:06,826 INFO L290 TraceCheckUtils]: 33: Hoare triple {156406#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {156406#false} is VALID [2022-04-08 10:12:06,826 INFO L290 TraceCheckUtils]: 34: Hoare triple {156406#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {156406#false} is VALID [2022-04-08 10:12:06,826 INFO L290 TraceCheckUtils]: 35: Hoare triple {156406#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {156406#false} is VALID [2022-04-08 10:12:06,826 INFO L290 TraceCheckUtils]: 36: Hoare triple {156406#false} assume !(~x~0 % 4294967296 > 0); {156406#false} is VALID [2022-04-08 10:12:06,826 INFO L272 TraceCheckUtils]: 37: Hoare triple {156406#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {156406#false} is VALID [2022-04-08 10:12:06,826 INFO L290 TraceCheckUtils]: 38: Hoare triple {156406#false} ~cond := #in~cond; {156406#false} is VALID [2022-04-08 10:12:06,826 INFO L290 TraceCheckUtils]: 39: Hoare triple {156406#false} assume 0 == ~cond; {156406#false} is VALID [2022-04-08 10:12:06,826 INFO L290 TraceCheckUtils]: 40: Hoare triple {156406#false} assume !false; {156406#false} is VALID [2022-04-08 10:12:06,826 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-08 10:12:06,826 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:12:07,248 INFO L290 TraceCheckUtils]: 40: Hoare triple {156406#false} assume !false; {156406#false} is VALID [2022-04-08 10:12:07,248 INFO L290 TraceCheckUtils]: 39: Hoare triple {156406#false} assume 0 == ~cond; {156406#false} is VALID [2022-04-08 10:12:07,248 INFO L290 TraceCheckUtils]: 38: Hoare triple {156406#false} ~cond := #in~cond; {156406#false} is VALID [2022-04-08 10:12:07,249 INFO L272 TraceCheckUtils]: 37: Hoare triple {156406#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {156406#false} is VALID [2022-04-08 10:12:07,249 INFO L290 TraceCheckUtils]: 36: Hoare triple {156406#false} assume !(~x~0 % 4294967296 > 0); {156406#false} is VALID [2022-04-08 10:12:07,249 INFO L290 TraceCheckUtils]: 35: Hoare triple {156406#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {156406#false} is VALID [2022-04-08 10:12:07,249 INFO L290 TraceCheckUtils]: 34: Hoare triple {156406#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {156406#false} is VALID [2022-04-08 10:12:07,249 INFO L290 TraceCheckUtils]: 33: Hoare triple {156406#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {156406#false} is VALID [2022-04-08 10:12:07,249 INFO L290 TraceCheckUtils]: 32: Hoare triple {156406#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {156406#false} is VALID [2022-04-08 10:12:07,249 INFO L290 TraceCheckUtils]: 31: Hoare triple {156406#false} assume !(~y~0 % 4294967296 > 0); {156406#false} is VALID [2022-04-08 10:12:07,249 INFO L290 TraceCheckUtils]: 30: Hoare triple {156406#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {156406#false} is VALID [2022-04-08 10:12:07,249 INFO L290 TraceCheckUtils]: 29: Hoare triple {156406#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {156406#false} is VALID [2022-04-08 10:12:07,249 INFO L290 TraceCheckUtils]: 28: Hoare triple {156406#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {156406#false} is VALID [2022-04-08 10:12:07,249 INFO L290 TraceCheckUtils]: 27: Hoare triple {156406#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {156406#false} is VALID [2022-04-08 10:12:07,249 INFO L290 TraceCheckUtils]: 26: Hoare triple {156406#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {156406#false} is VALID [2022-04-08 10:12:07,249 INFO L290 TraceCheckUtils]: 25: Hoare triple {156406#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {156406#false} is VALID [2022-04-08 10:12:07,249 INFO L290 TraceCheckUtils]: 24: Hoare triple {156406#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {156406#false} is VALID [2022-04-08 10:12:07,249 INFO L290 TraceCheckUtils]: 23: Hoare triple {156406#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {156406#false} is VALID [2022-04-08 10:12:07,249 INFO L290 TraceCheckUtils]: 22: Hoare triple {156406#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {156406#false} is VALID [2022-04-08 10:12:07,250 INFO L290 TraceCheckUtils]: 21: Hoare triple {156607#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {156406#false} is VALID [2022-04-08 10:12:07,250 INFO L290 TraceCheckUtils]: 20: Hoare triple {156611#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {156607#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:12:07,251 INFO L290 TraceCheckUtils]: 19: Hoare triple {156615#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {156611#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:12:07,252 INFO L290 TraceCheckUtils]: 18: Hoare triple {156619#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {156615#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:12:07,252 INFO L290 TraceCheckUtils]: 17: Hoare triple {156623#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {156619#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:12:07,253 INFO L290 TraceCheckUtils]: 16: Hoare triple {156627#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {156623#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:12:07,253 INFO L290 TraceCheckUtils]: 15: Hoare triple {156627#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {156627#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:12:07,254 INFO L290 TraceCheckUtils]: 14: Hoare triple {156634#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156627#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:12:07,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {156638#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156634#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:12:07,255 INFO L290 TraceCheckUtils]: 12: Hoare triple {156642#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156638#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:12:07,256 INFO L290 TraceCheckUtils]: 11: Hoare triple {156646#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156642#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:12:07,256 INFO L290 TraceCheckUtils]: 10: Hoare triple {156650#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156646#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:12:07,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {156654#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156650#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:12:07,258 INFO L290 TraceCheckUtils]: 8: Hoare triple {156658#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156654#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:12:07,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {156662#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156658#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:12:07,259 INFO L290 TraceCheckUtils]: 6: Hoare triple {156666#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {156662#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:12:07,259 INFO L290 TraceCheckUtils]: 5: Hoare triple {156405#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {156666#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:12:07,259 INFO L272 TraceCheckUtils]: 4: Hoare triple {156405#true} call #t~ret13 := main(); {156405#true} is VALID [2022-04-08 10:12:07,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {156405#true} {156405#true} #72#return; {156405#true} is VALID [2022-04-08 10:12:07,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {156405#true} assume true; {156405#true} is VALID [2022-04-08 10:12:07,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {156405#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {156405#true} is VALID [2022-04-08 10:12:07,259 INFO L272 TraceCheckUtils]: 0: Hoare triple {156405#true} call ULTIMATE.init(); {156405#true} is VALID [2022-04-08 10:12:07,260 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-08 10:12:07,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67089083] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:12:07,260 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:12:07,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-08 10:12:07,260 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:12:07,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [843078848] [2022-04-08 10:12:07,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [843078848] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:12:07,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:12:07,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 10:12:07,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436815699] [2022-04-08 10:12:07,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:12:07,260 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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 41 [2022-04-08 10:12:07,260 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:12:07,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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-08 10:12:07,286 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:07,286 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 10:12:07,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:07,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 10:12:07,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=927, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 10:12:07,287 INFO L87 Difference]: Start difference. First operand 515 states and 702 transitions. Second operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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-08 10:12:12,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:12,232 INFO L93 Difference]: Finished difference Result 633 states and 829 transitions. [2022-04-08 10:12:12,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-08 10:12:12,232 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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 41 [2022-04-08 10:12:12,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:12:12,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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-08 10:12:12,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 102 transitions. [2022-04-08 10:12:12,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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-08 10:12:12,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 102 transitions. [2022-04-08 10:12:12,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 102 transitions. [2022-04-08 10:12:12,286 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:12,299 INFO L225 Difference]: With dead ends: 633 [2022-04-08 10:12:12,300 INFO L226 Difference]: Without dead ends: 613 [2022-04-08 10:12:12,300 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=600, Invalid=2480, Unknown=0, NotChecked=0, Total=3080 [2022-04-08 10:12:12,300 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 43 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1110 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:12:12,300 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 116 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1110 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 10:12:12,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2022-04-08 10:12:15,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 515. [2022-04-08 10:12:15,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:12:15,231 INFO L82 GeneralOperation]: Start isEquivalent. First operand 613 states. Second operand has 515 states, 510 states have (on average 1.3666666666666667) internal successors, (697), 510 states have internal predecessors, (697), 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-08 10:12:15,231 INFO L74 IsIncluded]: Start isIncluded. First operand 613 states. Second operand has 515 states, 510 states have (on average 1.3666666666666667) internal successors, (697), 510 states have internal predecessors, (697), 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-08 10:12:15,231 INFO L87 Difference]: Start difference. First operand 613 states. Second operand has 515 states, 510 states have (on average 1.3666666666666667) internal successors, (697), 510 states have internal predecessors, (697), 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-08 10:12:15,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:15,241 INFO L93 Difference]: Finished difference Result 613 states and 809 transitions. [2022-04-08 10:12:15,242 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 809 transitions. [2022-04-08 10:12:15,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:15,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:15,242 INFO L74 IsIncluded]: Start isIncluded. First operand has 515 states, 510 states have (on average 1.3666666666666667) internal successors, (697), 510 states have internal predecessors, (697), 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 613 states. [2022-04-08 10:12:15,242 INFO L87 Difference]: Start difference. First operand has 515 states, 510 states have (on average 1.3666666666666667) internal successors, (697), 510 states have internal predecessors, (697), 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 613 states. [2022-04-08 10:12:15,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:15,252 INFO L93 Difference]: Finished difference Result 613 states and 809 transitions. [2022-04-08 10:12:15,253 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 809 transitions. [2022-04-08 10:12:15,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:15,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:15,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:12:15,253 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:12:15,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 510 states have (on average 1.3666666666666667) internal successors, (697), 510 states have internal predecessors, (697), 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-08 10:12:15,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 701 transitions. [2022-04-08 10:12:15,263 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 701 transitions. Word has length 41 [2022-04-08 10:12:15,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:12:15,263 INFO L478 AbstractCegarLoop]: Abstraction has 515 states and 701 transitions. [2022-04-08 10:12:15,263 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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-08 10:12:15,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 515 states and 701 transitions. [2022-04-08 10:12:19,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 701 edges. 701 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:19,296 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 701 transitions. [2022-04-08 10:12:19,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 10:12:19,296 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:12:19,296 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:12:19,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Forceful destruction successful, exit code 0 [2022-04-08 10:12:19,511 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 80 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable81 [2022-04-08 10:12:19,511 INFO L403 AbstractCegarLoop]: === Iteration 83 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:12:19,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:12:19,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1537469624, now seen corresponding path program 77 times [2022-04-08 10:12:19,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:19,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [410735156] [2022-04-08 10:12:19,514 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:12:19,514 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:12:19,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1537469624, now seen corresponding path program 78 times [2022-04-08 10:12:19,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:12:19,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118174753] [2022-04-08 10:12:19,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:12:19,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:12:19,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:19,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:12:19,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:19,760 INFO L290 TraceCheckUtils]: 0: Hoare triple {160273#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {160253#true} is VALID [2022-04-08 10:12:19,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {160253#true} assume true; {160253#true} is VALID [2022-04-08 10:12:19,760 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {160253#true} {160253#true} #72#return; {160253#true} is VALID [2022-04-08 10:12:19,761 INFO L272 TraceCheckUtils]: 0: Hoare triple {160253#true} call ULTIMATE.init(); {160273#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:12:19,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {160273#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {160253#true} is VALID [2022-04-08 10:12:19,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {160253#true} assume true; {160253#true} is VALID [2022-04-08 10:12:19,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {160253#true} {160253#true} #72#return; {160253#true} is VALID [2022-04-08 10:12:19,761 INFO L272 TraceCheckUtils]: 4: Hoare triple {160253#true} call #t~ret13 := main(); {160253#true} is VALID [2022-04-08 10:12:19,761 INFO L290 TraceCheckUtils]: 5: Hoare triple {160253#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {160258#(= main_~y~0 0)} is VALID [2022-04-08 10:12:19,762 INFO L290 TraceCheckUtils]: 6: Hoare triple {160258#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160259#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:12:19,762 INFO L290 TraceCheckUtils]: 7: Hoare triple {160259#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160260#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:12:19,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {160260#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160261#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:12:19,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {160261#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160262#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:12:19,764 INFO L290 TraceCheckUtils]: 10: Hoare triple {160262#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160263#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:12:19,764 INFO L290 TraceCheckUtils]: 11: Hoare triple {160263#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160264#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:12:19,765 INFO L290 TraceCheckUtils]: 12: Hoare triple {160264#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160265#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:12:19,765 INFO L290 TraceCheckUtils]: 13: Hoare triple {160265#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160266#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:12:19,766 INFO L290 TraceCheckUtils]: 14: Hoare triple {160266#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160267#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:12:19,766 INFO L290 TraceCheckUtils]: 15: Hoare triple {160267#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160268#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:12:19,766 INFO L290 TraceCheckUtils]: 16: Hoare triple {160268#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {160268#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:12:19,767 INFO L290 TraceCheckUtils]: 17: Hoare triple {160268#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {160269#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:12:19,767 INFO L290 TraceCheckUtils]: 18: Hoare triple {160269#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160270#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:12:19,768 INFO L290 TraceCheckUtils]: 19: Hoare triple {160270#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160271#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:12:19,768 INFO L290 TraceCheckUtils]: 20: Hoare triple {160271#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160272#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:12:19,769 INFO L290 TraceCheckUtils]: 21: Hoare triple {160272#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {160254#false} is VALID [2022-04-08 10:12:19,769 INFO L290 TraceCheckUtils]: 22: Hoare triple {160254#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160254#false} is VALID [2022-04-08 10:12:19,769 INFO L290 TraceCheckUtils]: 23: Hoare triple {160254#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160254#false} is VALID [2022-04-08 10:12:19,769 INFO L290 TraceCheckUtils]: 24: Hoare triple {160254#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160254#false} is VALID [2022-04-08 10:12:19,769 INFO L290 TraceCheckUtils]: 25: Hoare triple {160254#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160254#false} is VALID [2022-04-08 10:12:19,769 INFO L290 TraceCheckUtils]: 26: Hoare triple {160254#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160254#false} is VALID [2022-04-08 10:12:19,769 INFO L290 TraceCheckUtils]: 27: Hoare triple {160254#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160254#false} is VALID [2022-04-08 10:12:19,769 INFO L290 TraceCheckUtils]: 28: Hoare triple {160254#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160254#false} is VALID [2022-04-08 10:12:19,769 INFO L290 TraceCheckUtils]: 29: Hoare triple {160254#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160254#false} is VALID [2022-04-08 10:12:19,769 INFO L290 TraceCheckUtils]: 30: Hoare triple {160254#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160254#false} is VALID [2022-04-08 10:12:19,769 INFO L290 TraceCheckUtils]: 31: Hoare triple {160254#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160254#false} is VALID [2022-04-08 10:12:19,769 INFO L290 TraceCheckUtils]: 32: Hoare triple {160254#false} assume !(~y~0 % 4294967296 > 0); {160254#false} is VALID [2022-04-08 10:12:19,769 INFO L290 TraceCheckUtils]: 33: Hoare triple {160254#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {160254#false} is VALID [2022-04-08 10:12:19,769 INFO L290 TraceCheckUtils]: 34: Hoare triple {160254#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {160254#false} is VALID [2022-04-08 10:12:19,769 INFO L290 TraceCheckUtils]: 35: Hoare triple {160254#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {160254#false} is VALID [2022-04-08 10:12:19,769 INFO L290 TraceCheckUtils]: 36: Hoare triple {160254#false} assume !(~x~0 % 4294967296 > 0); {160254#false} is VALID [2022-04-08 10:12:19,769 INFO L272 TraceCheckUtils]: 37: Hoare triple {160254#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {160254#false} is VALID [2022-04-08 10:12:19,770 INFO L290 TraceCheckUtils]: 38: Hoare triple {160254#false} ~cond := #in~cond; {160254#false} is VALID [2022-04-08 10:12:19,770 INFO L290 TraceCheckUtils]: 39: Hoare triple {160254#false} assume 0 == ~cond; {160254#false} is VALID [2022-04-08 10:12:19,770 INFO L290 TraceCheckUtils]: 40: Hoare triple {160254#false} assume !false; {160254#false} is VALID [2022-04-08 10:12:19,770 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-04-08 10:12:19,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:12:19,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118174753] [2022-04-08 10:12:19,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118174753] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:12:19,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956719053] [2022-04-08 10:12:19,770 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:12:19,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:12:19,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:12:19,771 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:12:19,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2022-04-08 10:12:19,966 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-08 10:12:19,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:12:19,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 10:12:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:19,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:12:20,190 INFO L272 TraceCheckUtils]: 0: Hoare triple {160253#true} call ULTIMATE.init(); {160253#true} is VALID [2022-04-08 10:12:20,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {160253#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {160253#true} is VALID [2022-04-08 10:12:20,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {160253#true} assume true; {160253#true} is VALID [2022-04-08 10:12:20,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {160253#true} {160253#true} #72#return; {160253#true} is VALID [2022-04-08 10:12:20,190 INFO L272 TraceCheckUtils]: 4: Hoare triple {160253#true} call #t~ret13 := main(); {160253#true} is VALID [2022-04-08 10:12:20,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {160253#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {160258#(= main_~y~0 0)} is VALID [2022-04-08 10:12:20,191 INFO L290 TraceCheckUtils]: 6: Hoare triple {160258#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160259#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:12:20,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {160259#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160260#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:12:20,192 INFO L290 TraceCheckUtils]: 8: Hoare triple {160260#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160261#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:12:20,192 INFO L290 TraceCheckUtils]: 9: Hoare triple {160261#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160262#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:12:20,193 INFO L290 TraceCheckUtils]: 10: Hoare triple {160262#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160263#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:12:20,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {160263#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160264#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:12:20,193 INFO L290 TraceCheckUtils]: 12: Hoare triple {160264#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160265#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:12:20,194 INFO L290 TraceCheckUtils]: 13: Hoare triple {160265#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160266#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:12:20,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {160266#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160267#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:12:20,195 INFO L290 TraceCheckUtils]: 15: Hoare triple {160267#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160268#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:12:20,195 INFO L290 TraceCheckUtils]: 16: Hoare triple {160268#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {160268#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:12:20,195 INFO L290 TraceCheckUtils]: 17: Hoare triple {160268#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {160269#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:12:20,196 INFO L290 TraceCheckUtils]: 18: Hoare triple {160269#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160270#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:12:20,196 INFO L290 TraceCheckUtils]: 19: Hoare triple {160270#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160271#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:12:20,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {160271#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160337#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:12:20,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {160337#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {160254#false} is VALID [2022-04-08 10:12:20,197 INFO L290 TraceCheckUtils]: 22: Hoare triple {160254#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160254#false} is VALID [2022-04-08 10:12:20,197 INFO L290 TraceCheckUtils]: 23: Hoare triple {160254#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160254#false} is VALID [2022-04-08 10:12:20,197 INFO L290 TraceCheckUtils]: 24: Hoare triple {160254#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160254#false} is VALID [2022-04-08 10:12:20,197 INFO L290 TraceCheckUtils]: 25: Hoare triple {160254#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160254#false} is VALID [2022-04-08 10:12:20,197 INFO L290 TraceCheckUtils]: 26: Hoare triple {160254#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160254#false} is VALID [2022-04-08 10:12:20,197 INFO L290 TraceCheckUtils]: 27: Hoare triple {160254#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160254#false} is VALID [2022-04-08 10:12:20,197 INFO L290 TraceCheckUtils]: 28: Hoare triple {160254#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160254#false} is VALID [2022-04-08 10:12:20,197 INFO L290 TraceCheckUtils]: 29: Hoare triple {160254#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160254#false} is VALID [2022-04-08 10:12:20,197 INFO L290 TraceCheckUtils]: 30: Hoare triple {160254#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160254#false} is VALID [2022-04-08 10:12:20,198 INFO L290 TraceCheckUtils]: 31: Hoare triple {160254#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160254#false} is VALID [2022-04-08 10:12:20,198 INFO L290 TraceCheckUtils]: 32: Hoare triple {160254#false} assume !(~y~0 % 4294967296 > 0); {160254#false} is VALID [2022-04-08 10:12:20,198 INFO L290 TraceCheckUtils]: 33: Hoare triple {160254#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {160254#false} is VALID [2022-04-08 10:12:20,198 INFO L290 TraceCheckUtils]: 34: Hoare triple {160254#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {160254#false} is VALID [2022-04-08 10:12:20,198 INFO L290 TraceCheckUtils]: 35: Hoare triple {160254#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {160254#false} is VALID [2022-04-08 10:12:20,198 INFO L290 TraceCheckUtils]: 36: Hoare triple {160254#false} assume !(~x~0 % 4294967296 > 0); {160254#false} is VALID [2022-04-08 10:12:20,198 INFO L272 TraceCheckUtils]: 37: Hoare triple {160254#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {160254#false} is VALID [2022-04-08 10:12:20,198 INFO L290 TraceCheckUtils]: 38: Hoare triple {160254#false} ~cond := #in~cond; {160254#false} is VALID [2022-04-08 10:12:20,198 INFO L290 TraceCheckUtils]: 39: Hoare triple {160254#false} assume 0 == ~cond; {160254#false} is VALID [2022-04-08 10:12:20,198 INFO L290 TraceCheckUtils]: 40: Hoare triple {160254#false} assume !false; {160254#false} is VALID [2022-04-08 10:12:20,198 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-04-08 10:12:20,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:12:20,554 INFO L290 TraceCheckUtils]: 40: Hoare triple {160254#false} assume !false; {160254#false} is VALID [2022-04-08 10:12:20,554 INFO L290 TraceCheckUtils]: 39: Hoare triple {160254#false} assume 0 == ~cond; {160254#false} is VALID [2022-04-08 10:12:20,555 INFO L290 TraceCheckUtils]: 38: Hoare triple {160254#false} ~cond := #in~cond; {160254#false} is VALID [2022-04-08 10:12:20,555 INFO L272 TraceCheckUtils]: 37: Hoare triple {160254#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {160254#false} is VALID [2022-04-08 10:12:20,555 INFO L290 TraceCheckUtils]: 36: Hoare triple {160254#false} assume !(~x~0 % 4294967296 > 0); {160254#false} is VALID [2022-04-08 10:12:20,555 INFO L290 TraceCheckUtils]: 35: Hoare triple {160254#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {160254#false} is VALID [2022-04-08 10:12:20,555 INFO L290 TraceCheckUtils]: 34: Hoare triple {160254#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {160254#false} is VALID [2022-04-08 10:12:20,555 INFO L290 TraceCheckUtils]: 33: Hoare triple {160254#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {160254#false} is VALID [2022-04-08 10:12:20,555 INFO L290 TraceCheckUtils]: 32: Hoare triple {160254#false} assume !(~y~0 % 4294967296 > 0); {160254#false} is VALID [2022-04-08 10:12:20,555 INFO L290 TraceCheckUtils]: 31: Hoare triple {160254#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160254#false} is VALID [2022-04-08 10:12:20,555 INFO L290 TraceCheckUtils]: 30: Hoare triple {160254#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160254#false} is VALID [2022-04-08 10:12:20,555 INFO L290 TraceCheckUtils]: 29: Hoare triple {160254#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160254#false} is VALID [2022-04-08 10:12:20,555 INFO L290 TraceCheckUtils]: 28: Hoare triple {160254#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160254#false} is VALID [2022-04-08 10:12:20,555 INFO L290 TraceCheckUtils]: 27: Hoare triple {160254#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160254#false} is VALID [2022-04-08 10:12:20,555 INFO L290 TraceCheckUtils]: 26: Hoare triple {160254#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160254#false} is VALID [2022-04-08 10:12:20,555 INFO L290 TraceCheckUtils]: 25: Hoare triple {160254#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160254#false} is VALID [2022-04-08 10:12:20,555 INFO L290 TraceCheckUtils]: 24: Hoare triple {160254#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160254#false} is VALID [2022-04-08 10:12:20,555 INFO L290 TraceCheckUtils]: 23: Hoare triple {160254#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160254#false} is VALID [2022-04-08 10:12:20,555 INFO L290 TraceCheckUtils]: 22: Hoare triple {160254#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {160254#false} is VALID [2022-04-08 10:12:20,556 INFO L290 TraceCheckUtils]: 21: Hoare triple {160455#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {160254#false} is VALID [2022-04-08 10:12:20,557 INFO L290 TraceCheckUtils]: 20: Hoare triple {160459#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160455#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:12:20,557 INFO L290 TraceCheckUtils]: 19: Hoare triple {160463#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160459#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:12:20,558 INFO L290 TraceCheckUtils]: 18: Hoare triple {160467#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {160463#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:12:20,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {160471#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {160467#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:12:20,559 INFO L290 TraceCheckUtils]: 16: Hoare triple {160471#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {160471#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:12:20,559 INFO L290 TraceCheckUtils]: 15: Hoare triple {160478#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160471#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:12:20,560 INFO L290 TraceCheckUtils]: 14: Hoare triple {160482#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160478#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:12:20,560 INFO L290 TraceCheckUtils]: 13: Hoare triple {160486#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160482#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:12:20,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {160490#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160486#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:12:20,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {160494#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160490#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:12:20,562 INFO L290 TraceCheckUtils]: 10: Hoare triple {160498#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160494#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:12:20,563 INFO L290 TraceCheckUtils]: 9: Hoare triple {160502#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160498#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:12:20,563 INFO L290 TraceCheckUtils]: 8: Hoare triple {160506#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160502#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:12:20,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {160510#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160506#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:12:20,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {160514#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {160510#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:12:20,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {160253#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {160514#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:12:20,565 INFO L272 TraceCheckUtils]: 4: Hoare triple {160253#true} call #t~ret13 := main(); {160253#true} is VALID [2022-04-08 10:12:20,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {160253#true} {160253#true} #72#return; {160253#true} is VALID [2022-04-08 10:12:20,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {160253#true} assume true; {160253#true} is VALID [2022-04-08 10:12:20,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {160253#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {160253#true} is VALID [2022-04-08 10:12:20,565 INFO L272 TraceCheckUtils]: 0: Hoare triple {160253#true} call ULTIMATE.init(); {160253#true} is VALID [2022-04-08 10:12:20,565 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-04-08 10:12:20,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956719053] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:12:20,565 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:12:20,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-08 10:12:20,565 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:12:20,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [410735156] [2022-04-08 10:12:20,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [410735156] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:12:20,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:12:20,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 10:12:20,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383241775] [2022-04-08 10:12:20,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:12:20,566 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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 41 [2022-04-08 10:12:20,566 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:12:20,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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-08 10:12:20,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:20,599 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 10:12:20,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:20,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 10:12:20,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=916, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 10:12:20,600 INFO L87 Difference]: Start difference. First operand 515 states and 701 transitions. Second operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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-08 10:12:25,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:25,832 INFO L93 Difference]: Finished difference Result 656 states and 852 transitions. [2022-04-08 10:12:25,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-08 10:12:25,833 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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 41 [2022-04-08 10:12:25,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:12:25,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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-08 10:12:25,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 109 transitions. [2022-04-08 10:12:25,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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-08 10:12:25,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 109 transitions. [2022-04-08 10:12:25,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 109 transitions. [2022-04-08 10:12:25,892 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:25,914 INFO L225 Difference]: With dead ends: 656 [2022-04-08 10:12:25,915 INFO L226 Difference]: Without dead ends: 636 [2022-04-08 10:12:25,915 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=589, Invalid=2381, Unknown=0, NotChecked=0, Total=2970 [2022-04-08 10:12:25,915 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 51 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 10:12:25,915 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 110 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1058 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 10:12:25,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2022-04-08 10:12:27,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 515. [2022-04-08 10:12:27,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:12:27,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 636 states. Second operand has 515 states, 510 states have (on average 1.3647058823529412) internal successors, (696), 510 states have internal predecessors, (696), 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-08 10:12:27,689 INFO L74 IsIncluded]: Start isIncluded. First operand 636 states. Second operand has 515 states, 510 states have (on average 1.3647058823529412) internal successors, (696), 510 states have internal predecessors, (696), 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-08 10:12:27,689 INFO L87 Difference]: Start difference. First operand 636 states. Second operand has 515 states, 510 states have (on average 1.3647058823529412) internal successors, (696), 510 states have internal predecessors, (696), 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-08 10:12:27,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:27,700 INFO L93 Difference]: Finished difference Result 636 states and 832 transitions. [2022-04-08 10:12:27,700 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 832 transitions. [2022-04-08 10:12:27,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:27,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:27,701 INFO L74 IsIncluded]: Start isIncluded. First operand has 515 states, 510 states have (on average 1.3647058823529412) internal successors, (696), 510 states have internal predecessors, (696), 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 636 states. [2022-04-08 10:12:27,701 INFO L87 Difference]: Start difference. First operand has 515 states, 510 states have (on average 1.3647058823529412) internal successors, (696), 510 states have internal predecessors, (696), 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 636 states. [2022-04-08 10:12:27,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:27,712 INFO L93 Difference]: Finished difference Result 636 states and 832 transitions. [2022-04-08 10:12:27,712 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 832 transitions. [2022-04-08 10:12:27,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:27,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:27,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:12:27,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:12:27,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 510 states have (on average 1.3647058823529412) internal successors, (696), 510 states have internal predecessors, (696), 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-08 10:12:27,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 700 transitions. [2022-04-08 10:12:27,722 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 700 transitions. Word has length 41 [2022-04-08 10:12:27,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:12:27,723 INFO L478 AbstractCegarLoop]: Abstraction has 515 states and 700 transitions. [2022-04-08 10:12:27,723 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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-08 10:12:27,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 515 states and 700 transitions. [2022-04-08 10:12:31,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 700 edges. 700 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:31,882 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 700 transitions. [2022-04-08 10:12:31,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 10:12:31,883 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:12:31,883 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:12:31,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Ended with exit code 0 [2022-04-08 10:12:32,087 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,81 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:12:32,087 INFO L403 AbstractCegarLoop]: === Iteration 84 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:12:32,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:12:32,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1034526490, now seen corresponding path program 79 times [2022-04-08 10:12:32,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:32,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [88787981] [2022-04-08 10:12:32,089 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:12:32,089 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:12:32,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1034526490, now seen corresponding path program 80 times [2022-04-08 10:12:32,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:12:32,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077924355] [2022-04-08 10:12:32,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:12:32,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:12:32,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:32,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:12:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:32,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {164211#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {164191#true} is VALID [2022-04-08 10:12:32,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {164191#true} assume true; {164191#true} is VALID [2022-04-08 10:12:32,300 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {164191#true} {164191#true} #72#return; {164191#true} is VALID [2022-04-08 10:12:32,300 INFO L272 TraceCheckUtils]: 0: Hoare triple {164191#true} call ULTIMATE.init(); {164211#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:12:32,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {164211#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {164191#true} is VALID [2022-04-08 10:12:32,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {164191#true} assume true; {164191#true} is VALID [2022-04-08 10:12:32,300 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {164191#true} {164191#true} #72#return; {164191#true} is VALID [2022-04-08 10:12:32,300 INFO L272 TraceCheckUtils]: 4: Hoare triple {164191#true} call #t~ret13 := main(); {164191#true} is VALID [2022-04-08 10:12:32,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {164191#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {164196#(= main_~y~0 0)} is VALID [2022-04-08 10:12:32,301 INFO L290 TraceCheckUtils]: 6: Hoare triple {164196#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164197#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:12:32,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {164197#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164198#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:12:32,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {164198#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164199#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:12:32,302 INFO L290 TraceCheckUtils]: 9: Hoare triple {164199#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164200#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:12:32,303 INFO L290 TraceCheckUtils]: 10: Hoare triple {164200#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164201#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:12:32,303 INFO L290 TraceCheckUtils]: 11: Hoare triple {164201#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164202#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:12:32,304 INFO L290 TraceCheckUtils]: 12: Hoare triple {164202#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164203#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:12:32,304 INFO L290 TraceCheckUtils]: 13: Hoare triple {164203#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164204#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:12:32,305 INFO L290 TraceCheckUtils]: 14: Hoare triple {164204#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164205#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:12:32,305 INFO L290 TraceCheckUtils]: 15: Hoare triple {164205#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164206#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:12:32,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {164206#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164207#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:12:32,306 INFO L290 TraceCheckUtils]: 17: Hoare triple {164207#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {164207#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:12:32,306 INFO L290 TraceCheckUtils]: 18: Hoare triple {164207#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {164208#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:12:32,307 INFO L290 TraceCheckUtils]: 19: Hoare triple {164208#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {164209#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:12:32,307 INFO L290 TraceCheckUtils]: 20: Hoare triple {164209#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {164210#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:12:32,308 INFO L290 TraceCheckUtils]: 21: Hoare triple {164210#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {164192#false} is VALID [2022-04-08 10:12:32,308 INFO L290 TraceCheckUtils]: 22: Hoare triple {164192#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {164192#false} is VALID [2022-04-08 10:12:32,308 INFO L290 TraceCheckUtils]: 23: Hoare triple {164192#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {164192#false} is VALID [2022-04-08 10:12:32,308 INFO L290 TraceCheckUtils]: 24: Hoare triple {164192#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {164192#false} is VALID [2022-04-08 10:12:32,308 INFO L290 TraceCheckUtils]: 25: Hoare triple {164192#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {164192#false} is VALID [2022-04-08 10:12:32,308 INFO L290 TraceCheckUtils]: 26: Hoare triple {164192#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {164192#false} is VALID [2022-04-08 10:12:32,308 INFO L290 TraceCheckUtils]: 27: Hoare triple {164192#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {164192#false} is VALID [2022-04-08 10:12:32,308 INFO L290 TraceCheckUtils]: 28: Hoare triple {164192#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {164192#false} is VALID [2022-04-08 10:12:32,308 INFO L290 TraceCheckUtils]: 29: Hoare triple {164192#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {164192#false} is VALID [2022-04-08 10:12:32,308 INFO L290 TraceCheckUtils]: 30: Hoare triple {164192#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {164192#false} is VALID [2022-04-08 10:12:32,308 INFO L290 TraceCheckUtils]: 31: Hoare triple {164192#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {164192#false} is VALID [2022-04-08 10:12:32,308 INFO L290 TraceCheckUtils]: 32: Hoare triple {164192#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {164192#false} is VALID [2022-04-08 10:12:32,308 INFO L290 TraceCheckUtils]: 33: Hoare triple {164192#false} assume !(~y~0 % 4294967296 > 0); {164192#false} is VALID [2022-04-08 10:12:32,308 INFO L290 TraceCheckUtils]: 34: Hoare triple {164192#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {164192#false} is VALID [2022-04-08 10:12:32,309 INFO L290 TraceCheckUtils]: 35: Hoare triple {164192#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {164192#false} is VALID [2022-04-08 10:12:32,309 INFO L290 TraceCheckUtils]: 36: Hoare triple {164192#false} assume !(~x~0 % 4294967296 > 0); {164192#false} is VALID [2022-04-08 10:12:32,309 INFO L272 TraceCheckUtils]: 37: Hoare triple {164192#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {164192#false} is VALID [2022-04-08 10:12:32,309 INFO L290 TraceCheckUtils]: 38: Hoare triple {164192#false} ~cond := #in~cond; {164192#false} is VALID [2022-04-08 10:12:32,309 INFO L290 TraceCheckUtils]: 39: Hoare triple {164192#false} assume 0 == ~cond; {164192#false} is VALID [2022-04-08 10:12:32,309 INFO L290 TraceCheckUtils]: 40: Hoare triple {164192#false} assume !false; {164192#false} is VALID [2022-04-08 10:12:32,309 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-08 10:12:32,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:12:32,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077924355] [2022-04-08 10:12:32,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077924355] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:12:32,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949812382] [2022-04-08 10:12:32,309 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:12:32,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:12:32,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:12:32,310 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:12:32,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process [2022-04-08 10:12:32,380 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:12:32,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:12:32,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 10:12:32,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:32,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:12:32,654 INFO L272 TraceCheckUtils]: 0: Hoare triple {164191#true} call ULTIMATE.init(); {164191#true} is VALID [2022-04-08 10:12:32,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {164191#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {164191#true} is VALID [2022-04-08 10:12:32,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {164191#true} assume true; {164191#true} is VALID [2022-04-08 10:12:32,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {164191#true} {164191#true} #72#return; {164191#true} is VALID [2022-04-08 10:12:32,654 INFO L272 TraceCheckUtils]: 4: Hoare triple {164191#true} call #t~ret13 := main(); {164191#true} is VALID [2022-04-08 10:12:32,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {164191#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {164196#(= main_~y~0 0)} is VALID [2022-04-08 10:12:32,655 INFO L290 TraceCheckUtils]: 6: Hoare triple {164196#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164197#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:12:32,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {164197#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164198#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:12:32,656 INFO L290 TraceCheckUtils]: 8: Hoare triple {164198#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164199#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:12:32,657 INFO L290 TraceCheckUtils]: 9: Hoare triple {164199#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164200#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:12:32,657 INFO L290 TraceCheckUtils]: 10: Hoare triple {164200#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164201#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:12:32,658 INFO L290 TraceCheckUtils]: 11: Hoare triple {164201#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164202#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:12:32,658 INFO L290 TraceCheckUtils]: 12: Hoare triple {164202#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164203#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:12:32,659 INFO L290 TraceCheckUtils]: 13: Hoare triple {164203#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164204#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:12:32,659 INFO L290 TraceCheckUtils]: 14: Hoare triple {164204#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164205#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:12:32,660 INFO L290 TraceCheckUtils]: 15: Hoare triple {164205#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164206#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:12:32,660 INFO L290 TraceCheckUtils]: 16: Hoare triple {164206#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164207#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:12:32,661 INFO L290 TraceCheckUtils]: 17: Hoare triple {164207#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {164207#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:12:32,661 INFO L290 TraceCheckUtils]: 18: Hoare triple {164207#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {164208#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:12:32,661 INFO L290 TraceCheckUtils]: 19: Hoare triple {164208#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {164209#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:12:32,662 INFO L290 TraceCheckUtils]: 20: Hoare triple {164209#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {164275#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:12:32,662 INFO L290 TraceCheckUtils]: 21: Hoare triple {164275#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~z~0 % 4294967296 > 0); {164192#false} is VALID [2022-04-08 10:12:32,662 INFO L290 TraceCheckUtils]: 22: Hoare triple {164192#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {164192#false} is VALID [2022-04-08 10:12:32,662 INFO L290 TraceCheckUtils]: 23: Hoare triple {164192#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {164192#false} is VALID [2022-04-08 10:12:32,662 INFO L290 TraceCheckUtils]: 24: Hoare triple {164192#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {164192#false} is VALID [2022-04-08 10:12:32,663 INFO L290 TraceCheckUtils]: 25: Hoare triple {164192#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {164192#false} is VALID [2022-04-08 10:12:32,663 INFO L290 TraceCheckUtils]: 26: Hoare triple {164192#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {164192#false} is VALID [2022-04-08 10:12:32,663 INFO L290 TraceCheckUtils]: 27: Hoare triple {164192#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {164192#false} is VALID [2022-04-08 10:12:32,663 INFO L290 TraceCheckUtils]: 28: Hoare triple {164192#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {164192#false} is VALID [2022-04-08 10:12:32,663 INFO L290 TraceCheckUtils]: 29: Hoare triple {164192#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {164192#false} is VALID [2022-04-08 10:12:32,663 INFO L290 TraceCheckUtils]: 30: Hoare triple {164192#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {164192#false} is VALID [2022-04-08 10:12:32,663 INFO L290 TraceCheckUtils]: 31: Hoare triple {164192#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {164192#false} is VALID [2022-04-08 10:12:32,663 INFO L290 TraceCheckUtils]: 32: Hoare triple {164192#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {164192#false} is VALID [2022-04-08 10:12:32,663 INFO L290 TraceCheckUtils]: 33: Hoare triple {164192#false} assume !(~y~0 % 4294967296 > 0); {164192#false} is VALID [2022-04-08 10:12:32,663 INFO L290 TraceCheckUtils]: 34: Hoare triple {164192#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {164192#false} is VALID [2022-04-08 10:12:32,663 INFO L290 TraceCheckUtils]: 35: Hoare triple {164192#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {164192#false} is VALID [2022-04-08 10:12:32,663 INFO L290 TraceCheckUtils]: 36: Hoare triple {164192#false} assume !(~x~0 % 4294967296 > 0); {164192#false} is VALID [2022-04-08 10:12:32,663 INFO L272 TraceCheckUtils]: 37: Hoare triple {164192#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {164192#false} is VALID [2022-04-08 10:12:32,663 INFO L290 TraceCheckUtils]: 38: Hoare triple {164192#false} ~cond := #in~cond; {164192#false} is VALID [2022-04-08 10:12:32,663 INFO L290 TraceCheckUtils]: 39: Hoare triple {164192#false} assume 0 == ~cond; {164192#false} is VALID [2022-04-08 10:12:32,663 INFO L290 TraceCheckUtils]: 40: Hoare triple {164192#false} assume !false; {164192#false} is VALID [2022-04-08 10:12:32,663 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-08 10:12:32,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:12:32,999 INFO L290 TraceCheckUtils]: 40: Hoare triple {164192#false} assume !false; {164192#false} is VALID [2022-04-08 10:12:32,999 INFO L290 TraceCheckUtils]: 39: Hoare triple {164192#false} assume 0 == ~cond; {164192#false} is VALID [2022-04-08 10:12:32,999 INFO L290 TraceCheckUtils]: 38: Hoare triple {164192#false} ~cond := #in~cond; {164192#false} is VALID [2022-04-08 10:12:32,999 INFO L272 TraceCheckUtils]: 37: Hoare triple {164192#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {164192#false} is VALID [2022-04-08 10:12:32,999 INFO L290 TraceCheckUtils]: 36: Hoare triple {164192#false} assume !(~x~0 % 4294967296 > 0); {164192#false} is VALID [2022-04-08 10:12:32,999 INFO L290 TraceCheckUtils]: 35: Hoare triple {164192#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {164192#false} is VALID [2022-04-08 10:12:32,999 INFO L290 TraceCheckUtils]: 34: Hoare triple {164192#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {164192#false} is VALID [2022-04-08 10:12:32,999 INFO L290 TraceCheckUtils]: 33: Hoare triple {164192#false} assume !(~y~0 % 4294967296 > 0); {164192#false} is VALID [2022-04-08 10:12:32,999 INFO L290 TraceCheckUtils]: 32: Hoare triple {164192#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {164192#false} is VALID [2022-04-08 10:12:33,000 INFO L290 TraceCheckUtils]: 31: Hoare triple {164192#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {164192#false} is VALID [2022-04-08 10:12:33,000 INFO L290 TraceCheckUtils]: 30: Hoare triple {164192#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {164192#false} is VALID [2022-04-08 10:12:33,000 INFO L290 TraceCheckUtils]: 29: Hoare triple {164192#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {164192#false} is VALID [2022-04-08 10:12:33,000 INFO L290 TraceCheckUtils]: 28: Hoare triple {164192#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {164192#false} is VALID [2022-04-08 10:12:33,000 INFO L290 TraceCheckUtils]: 27: Hoare triple {164192#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {164192#false} is VALID [2022-04-08 10:12:33,000 INFO L290 TraceCheckUtils]: 26: Hoare triple {164192#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {164192#false} is VALID [2022-04-08 10:12:33,000 INFO L290 TraceCheckUtils]: 25: Hoare triple {164192#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {164192#false} is VALID [2022-04-08 10:12:33,000 INFO L290 TraceCheckUtils]: 24: Hoare triple {164192#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {164192#false} is VALID [2022-04-08 10:12:33,000 INFO L290 TraceCheckUtils]: 23: Hoare triple {164192#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {164192#false} is VALID [2022-04-08 10:12:33,000 INFO L290 TraceCheckUtils]: 22: Hoare triple {164192#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {164192#false} is VALID [2022-04-08 10:12:33,000 INFO L290 TraceCheckUtils]: 21: Hoare triple {164393#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {164192#false} is VALID [2022-04-08 10:12:33,001 INFO L290 TraceCheckUtils]: 20: Hoare triple {164397#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {164393#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:12:33,001 INFO L290 TraceCheckUtils]: 19: Hoare triple {164401#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {164397#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:12:33,002 INFO L290 TraceCheckUtils]: 18: Hoare triple {164405#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {164401#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:12:33,002 INFO L290 TraceCheckUtils]: 17: Hoare triple {164405#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {164405#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:12:33,002 INFO L290 TraceCheckUtils]: 16: Hoare triple {164412#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164405#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:12:33,003 INFO L290 TraceCheckUtils]: 15: Hoare triple {164416#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164412#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:12:33,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {164420#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164416#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:12:33,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {164424#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164420#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:12:33,005 INFO L290 TraceCheckUtils]: 12: Hoare triple {164428#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164424#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:12:33,005 INFO L290 TraceCheckUtils]: 11: Hoare triple {164432#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164428#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:12:33,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {164436#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164432#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:12:33,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {164440#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164436#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:12:33,007 INFO L290 TraceCheckUtils]: 8: Hoare triple {164444#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164440#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:12:33,007 INFO L290 TraceCheckUtils]: 7: Hoare triple {164448#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164444#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:12:33,008 INFO L290 TraceCheckUtils]: 6: Hoare triple {164452#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {164448#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:12:33,008 INFO L290 TraceCheckUtils]: 5: Hoare triple {164191#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {164452#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:12:33,008 INFO L272 TraceCheckUtils]: 4: Hoare triple {164191#true} call #t~ret13 := main(); {164191#true} is VALID [2022-04-08 10:12:33,008 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {164191#true} {164191#true} #72#return; {164191#true} is VALID [2022-04-08 10:12:33,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {164191#true} assume true; {164191#true} is VALID [2022-04-08 10:12:33,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {164191#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {164191#true} is VALID [2022-04-08 10:12:33,008 INFO L272 TraceCheckUtils]: 0: Hoare triple {164191#true} call ULTIMATE.init(); {164191#true} is VALID [2022-04-08 10:12:33,008 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-08 10:12:33,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949812382] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:12:33,008 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:12:33,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-08 10:12:33,009 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:12:33,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [88787981] [2022-04-08 10:12:33,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [88787981] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:12:33,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:12:33,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 10:12:33,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880103339] [2022-04-08 10:12:33,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:12:33,009 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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 41 [2022-04-08 10:12:33,009 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:12:33,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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-08 10:12:33,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:33,022 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 10:12:33,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:33,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 10:12:33,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=901, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 10:12:33,022 INFO L87 Difference]: Start difference. First operand 515 states and 700 transitions. Second operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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-08 10:12:40,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:40,502 INFO L93 Difference]: Finished difference Result 680 states and 876 transitions. [2022-04-08 10:12:40,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 10:12:40,503 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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 41 [2022-04-08 10:12:40,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:12:40,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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-08 10:12:40,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 114 transitions. [2022-04-08 10:12:40,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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-08 10:12:40,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 114 transitions. [2022-04-08 10:12:40,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 114 transitions. [2022-04-08 10:12:40,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:40,578 INFO L225 Difference]: With dead ends: 680 [2022-04-08 10:12:40,578 INFO L226 Difference]: Without dead ends: 660 [2022-04-08 10:12:40,578 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=542, Invalid=2110, Unknown=0, NotChecked=0, Total=2652 [2022-04-08 10:12:40,578 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 60 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1307 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 1363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 10:12:40,578 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 126 Invalid, 1363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1307 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 10:12:40,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2022-04-08 10:12:42,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 515. [2022-04-08 10:12:42,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:12:42,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 660 states. Second operand has 515 states, 510 states have (on average 1.3627450980392157) internal successors, (695), 510 states have internal predecessors, (695), 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-08 10:12:42,327 INFO L74 IsIncluded]: Start isIncluded. First operand 660 states. Second operand has 515 states, 510 states have (on average 1.3627450980392157) internal successors, (695), 510 states have internal predecessors, (695), 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-08 10:12:42,327 INFO L87 Difference]: Start difference. First operand 660 states. Second operand has 515 states, 510 states have (on average 1.3627450980392157) internal successors, (695), 510 states have internal predecessors, (695), 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-08 10:12:42,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:42,339 INFO L93 Difference]: Finished difference Result 660 states and 856 transitions. [2022-04-08 10:12:42,339 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 856 transitions. [2022-04-08 10:12:42,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:42,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:42,340 INFO L74 IsIncluded]: Start isIncluded. First operand has 515 states, 510 states have (on average 1.3627450980392157) internal successors, (695), 510 states have internal predecessors, (695), 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 660 states. [2022-04-08 10:12:42,340 INFO L87 Difference]: Start difference. First operand has 515 states, 510 states have (on average 1.3627450980392157) internal successors, (695), 510 states have internal predecessors, (695), 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 660 states. [2022-04-08 10:12:42,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:42,351 INFO L93 Difference]: Finished difference Result 660 states and 856 transitions. [2022-04-08 10:12:42,351 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 856 transitions. [2022-04-08 10:12:42,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:42,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:42,351 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:12:42,352 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:12:42,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 510 states have (on average 1.3627450980392157) internal successors, (695), 510 states have internal predecessors, (695), 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-08 10:12:42,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 699 transitions. [2022-04-08 10:12:42,362 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 699 transitions. Word has length 41 [2022-04-08 10:12:42,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:12:42,362 INFO L478 AbstractCegarLoop]: Abstraction has 515 states and 699 transitions. [2022-04-08 10:12:42,362 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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-08 10:12:42,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 515 states and 699 transitions. [2022-04-08 10:12:45,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 699 edges. 699 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:45,972 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 699 transitions. [2022-04-08 10:12:45,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 10:12:45,972 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:12:45,972 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:12:45,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Forceful destruction successful, exit code 0 [2022-04-08 10:12:46,182 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83,82 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:12:46,182 INFO L403 AbstractCegarLoop]: === Iteration 85 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:12:46,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:12:46,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1653452536, now seen corresponding path program 81 times [2022-04-08 10:12:46,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:46,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [84818668] [2022-04-08 10:12:46,185 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:12:46,185 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:12:46,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1653452536, now seen corresponding path program 82 times [2022-04-08 10:12:46,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:12:46,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578830965] [2022-04-08 10:12:46,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:12:46,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:12:46,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:46,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:12:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:46,404 INFO L290 TraceCheckUtils]: 0: Hoare triple {168239#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {168219#true} is VALID [2022-04-08 10:12:46,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {168219#true} assume true; {168219#true} is VALID [2022-04-08 10:12:46,404 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {168219#true} {168219#true} #72#return; {168219#true} is VALID [2022-04-08 10:12:46,404 INFO L272 TraceCheckUtils]: 0: Hoare triple {168219#true} call ULTIMATE.init(); {168239#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:12:46,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {168239#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {168219#true} is VALID [2022-04-08 10:12:46,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {168219#true} assume true; {168219#true} is VALID [2022-04-08 10:12:46,404 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {168219#true} {168219#true} #72#return; {168219#true} is VALID [2022-04-08 10:12:46,405 INFO L272 TraceCheckUtils]: 4: Hoare triple {168219#true} call #t~ret13 := main(); {168219#true} is VALID [2022-04-08 10:12:46,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {168219#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {168224#(= main_~y~0 0)} is VALID [2022-04-08 10:12:46,405 INFO L290 TraceCheckUtils]: 6: Hoare triple {168224#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168225#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:12:46,406 INFO L290 TraceCheckUtils]: 7: Hoare triple {168225#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168226#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:12:46,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {168226#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168227#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:12:46,407 INFO L290 TraceCheckUtils]: 9: Hoare triple {168227#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168228#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:12:46,407 INFO L290 TraceCheckUtils]: 10: Hoare triple {168228#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168229#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:12:46,408 INFO L290 TraceCheckUtils]: 11: Hoare triple {168229#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168230#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:12:46,408 INFO L290 TraceCheckUtils]: 12: Hoare triple {168230#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168231#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:12:46,409 INFO L290 TraceCheckUtils]: 13: Hoare triple {168231#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168232#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:12:46,409 INFO L290 TraceCheckUtils]: 14: Hoare triple {168232#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168233#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:12:46,410 INFO L290 TraceCheckUtils]: 15: Hoare triple {168233#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168234#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:12:46,410 INFO L290 TraceCheckUtils]: 16: Hoare triple {168234#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168235#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:12:46,411 INFO L290 TraceCheckUtils]: 17: Hoare triple {168235#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168236#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:12:46,411 INFO L290 TraceCheckUtils]: 18: Hoare triple {168236#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {168236#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:12:46,411 INFO L290 TraceCheckUtils]: 19: Hoare triple {168236#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {168237#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:12:46,412 INFO L290 TraceCheckUtils]: 20: Hoare triple {168237#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {168238#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} is VALID [2022-04-08 10:12:46,412 INFO L290 TraceCheckUtils]: 21: Hoare triple {168238#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {168220#false} is VALID [2022-04-08 10:12:46,412 INFO L290 TraceCheckUtils]: 22: Hoare triple {168220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {168220#false} is VALID [2022-04-08 10:12:46,413 INFO L290 TraceCheckUtils]: 23: Hoare triple {168220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {168220#false} is VALID [2022-04-08 10:12:46,413 INFO L290 TraceCheckUtils]: 24: Hoare triple {168220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {168220#false} is VALID [2022-04-08 10:12:46,413 INFO L290 TraceCheckUtils]: 25: Hoare triple {168220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {168220#false} is VALID [2022-04-08 10:12:46,413 INFO L290 TraceCheckUtils]: 26: Hoare triple {168220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {168220#false} is VALID [2022-04-08 10:12:46,413 INFO L290 TraceCheckUtils]: 27: Hoare triple {168220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {168220#false} is VALID [2022-04-08 10:12:46,413 INFO L290 TraceCheckUtils]: 28: Hoare triple {168220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {168220#false} is VALID [2022-04-08 10:12:46,413 INFO L290 TraceCheckUtils]: 29: Hoare triple {168220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {168220#false} is VALID [2022-04-08 10:12:46,413 INFO L290 TraceCheckUtils]: 30: Hoare triple {168220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {168220#false} is VALID [2022-04-08 10:12:46,413 INFO L290 TraceCheckUtils]: 31: Hoare triple {168220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {168220#false} is VALID [2022-04-08 10:12:46,413 INFO L290 TraceCheckUtils]: 32: Hoare triple {168220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {168220#false} is VALID [2022-04-08 10:12:46,413 INFO L290 TraceCheckUtils]: 33: Hoare triple {168220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {168220#false} is VALID [2022-04-08 10:12:46,413 INFO L290 TraceCheckUtils]: 34: Hoare triple {168220#false} assume !(~y~0 % 4294967296 > 0); {168220#false} is VALID [2022-04-08 10:12:46,413 INFO L290 TraceCheckUtils]: 35: Hoare triple {168220#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {168220#false} is VALID [2022-04-08 10:12:46,413 INFO L290 TraceCheckUtils]: 36: Hoare triple {168220#false} assume !(~x~0 % 4294967296 > 0); {168220#false} is VALID [2022-04-08 10:12:46,413 INFO L272 TraceCheckUtils]: 37: Hoare triple {168220#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {168220#false} is VALID [2022-04-08 10:12:46,413 INFO L290 TraceCheckUtils]: 38: Hoare triple {168220#false} ~cond := #in~cond; {168220#false} is VALID [2022-04-08 10:12:46,413 INFO L290 TraceCheckUtils]: 39: Hoare triple {168220#false} assume 0 == ~cond; {168220#false} is VALID [2022-04-08 10:12:46,413 INFO L290 TraceCheckUtils]: 40: Hoare triple {168220#false} assume !false; {168220#false} is VALID [2022-04-08 10:12:46,414 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-04-08 10:12:46,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:12:46,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578830965] [2022-04-08 10:12:46,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578830965] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:12:46,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514124174] [2022-04-08 10:12:46,414 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:12:46,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:12:46,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:12:46,415 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:12:46,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2022-04-08 10:12:46,464 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:12:46,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:12:46,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 10:12:46,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:12:46,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:12:46,748 INFO L272 TraceCheckUtils]: 0: Hoare triple {168219#true} call ULTIMATE.init(); {168219#true} is VALID [2022-04-08 10:12:46,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {168219#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {168219#true} is VALID [2022-04-08 10:12:46,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {168219#true} assume true; {168219#true} is VALID [2022-04-08 10:12:46,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {168219#true} {168219#true} #72#return; {168219#true} is VALID [2022-04-08 10:12:46,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {168219#true} call #t~ret13 := main(); {168219#true} is VALID [2022-04-08 10:12:46,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {168219#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {168224#(= main_~y~0 0)} is VALID [2022-04-08 10:12:46,749 INFO L290 TraceCheckUtils]: 6: Hoare triple {168224#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168225#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:12:46,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {168225#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168226#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:12:46,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {168226#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168227#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:12:46,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {168227#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168228#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:12:46,752 INFO L290 TraceCheckUtils]: 10: Hoare triple {168228#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168229#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:12:46,752 INFO L290 TraceCheckUtils]: 11: Hoare triple {168229#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168230#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:12:46,753 INFO L290 TraceCheckUtils]: 12: Hoare triple {168230#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168231#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:12:46,753 INFO L290 TraceCheckUtils]: 13: Hoare triple {168231#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168232#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:12:46,754 INFO L290 TraceCheckUtils]: 14: Hoare triple {168232#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168233#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:12:46,754 INFO L290 TraceCheckUtils]: 15: Hoare triple {168233#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168234#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:12:46,755 INFO L290 TraceCheckUtils]: 16: Hoare triple {168234#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168235#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:12:46,755 INFO L290 TraceCheckUtils]: 17: Hoare triple {168235#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168236#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:12:46,755 INFO L290 TraceCheckUtils]: 18: Hoare triple {168236#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {168236#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:12:46,756 INFO L290 TraceCheckUtils]: 19: Hoare triple {168236#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {168237#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:12:46,756 INFO L290 TraceCheckUtils]: 20: Hoare triple {168237#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {168303#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:12:46,757 INFO L290 TraceCheckUtils]: 21: Hoare triple {168303#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {168220#false} is VALID [2022-04-08 10:12:46,757 INFO L290 TraceCheckUtils]: 22: Hoare triple {168220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {168220#false} is VALID [2022-04-08 10:12:46,757 INFO L290 TraceCheckUtils]: 23: Hoare triple {168220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {168220#false} is VALID [2022-04-08 10:12:46,757 INFO L290 TraceCheckUtils]: 24: Hoare triple {168220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {168220#false} is VALID [2022-04-08 10:12:46,757 INFO L290 TraceCheckUtils]: 25: Hoare triple {168220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {168220#false} is VALID [2022-04-08 10:12:46,757 INFO L290 TraceCheckUtils]: 26: Hoare triple {168220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {168220#false} is VALID [2022-04-08 10:12:46,757 INFO L290 TraceCheckUtils]: 27: Hoare triple {168220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {168220#false} is VALID [2022-04-08 10:12:46,757 INFO L290 TraceCheckUtils]: 28: Hoare triple {168220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {168220#false} is VALID [2022-04-08 10:12:46,757 INFO L290 TraceCheckUtils]: 29: Hoare triple {168220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {168220#false} is VALID [2022-04-08 10:12:46,757 INFO L290 TraceCheckUtils]: 30: Hoare triple {168220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {168220#false} is VALID [2022-04-08 10:12:46,757 INFO L290 TraceCheckUtils]: 31: Hoare triple {168220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {168220#false} is VALID [2022-04-08 10:12:46,757 INFO L290 TraceCheckUtils]: 32: Hoare triple {168220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {168220#false} is VALID [2022-04-08 10:12:46,757 INFO L290 TraceCheckUtils]: 33: Hoare triple {168220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {168220#false} is VALID [2022-04-08 10:12:46,757 INFO L290 TraceCheckUtils]: 34: Hoare triple {168220#false} assume !(~y~0 % 4294967296 > 0); {168220#false} is VALID [2022-04-08 10:12:46,757 INFO L290 TraceCheckUtils]: 35: Hoare triple {168220#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {168220#false} is VALID [2022-04-08 10:12:46,757 INFO L290 TraceCheckUtils]: 36: Hoare triple {168220#false} assume !(~x~0 % 4294967296 > 0); {168220#false} is VALID [2022-04-08 10:12:46,757 INFO L272 TraceCheckUtils]: 37: Hoare triple {168220#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {168220#false} is VALID [2022-04-08 10:12:46,757 INFO L290 TraceCheckUtils]: 38: Hoare triple {168220#false} ~cond := #in~cond; {168220#false} is VALID [2022-04-08 10:12:46,758 INFO L290 TraceCheckUtils]: 39: Hoare triple {168220#false} assume 0 == ~cond; {168220#false} is VALID [2022-04-08 10:12:46,758 INFO L290 TraceCheckUtils]: 40: Hoare triple {168220#false} assume !false; {168220#false} is VALID [2022-04-08 10:12:46,758 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-04-08 10:12:46,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:12:47,179 INFO L290 TraceCheckUtils]: 40: Hoare triple {168220#false} assume !false; {168220#false} is VALID [2022-04-08 10:12:47,179 INFO L290 TraceCheckUtils]: 39: Hoare triple {168220#false} assume 0 == ~cond; {168220#false} is VALID [2022-04-08 10:12:47,179 INFO L290 TraceCheckUtils]: 38: Hoare triple {168220#false} ~cond := #in~cond; {168220#false} is VALID [2022-04-08 10:12:47,179 INFO L272 TraceCheckUtils]: 37: Hoare triple {168220#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {168220#false} is VALID [2022-04-08 10:12:47,179 INFO L290 TraceCheckUtils]: 36: Hoare triple {168220#false} assume !(~x~0 % 4294967296 > 0); {168220#false} is VALID [2022-04-08 10:12:47,179 INFO L290 TraceCheckUtils]: 35: Hoare triple {168220#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {168220#false} is VALID [2022-04-08 10:12:47,179 INFO L290 TraceCheckUtils]: 34: Hoare triple {168220#false} assume !(~y~0 % 4294967296 > 0); {168220#false} is VALID [2022-04-08 10:12:47,179 INFO L290 TraceCheckUtils]: 33: Hoare triple {168220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {168220#false} is VALID [2022-04-08 10:12:47,179 INFO L290 TraceCheckUtils]: 32: Hoare triple {168220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {168220#false} is VALID [2022-04-08 10:12:47,179 INFO L290 TraceCheckUtils]: 31: Hoare triple {168220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {168220#false} is VALID [2022-04-08 10:12:47,179 INFO L290 TraceCheckUtils]: 30: Hoare triple {168220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {168220#false} is VALID [2022-04-08 10:12:47,180 INFO L290 TraceCheckUtils]: 29: Hoare triple {168220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {168220#false} is VALID [2022-04-08 10:12:47,180 INFO L290 TraceCheckUtils]: 28: Hoare triple {168220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {168220#false} is VALID [2022-04-08 10:12:47,180 INFO L290 TraceCheckUtils]: 27: Hoare triple {168220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {168220#false} is VALID [2022-04-08 10:12:47,180 INFO L290 TraceCheckUtils]: 26: Hoare triple {168220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {168220#false} is VALID [2022-04-08 10:12:47,180 INFO L290 TraceCheckUtils]: 25: Hoare triple {168220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {168220#false} is VALID [2022-04-08 10:12:47,180 INFO L290 TraceCheckUtils]: 24: Hoare triple {168220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {168220#false} is VALID [2022-04-08 10:12:47,180 INFO L290 TraceCheckUtils]: 23: Hoare triple {168220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {168220#false} is VALID [2022-04-08 10:12:47,180 INFO L290 TraceCheckUtils]: 22: Hoare triple {168220#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {168220#false} is VALID [2022-04-08 10:12:47,180 INFO L290 TraceCheckUtils]: 21: Hoare triple {168421#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {168220#false} is VALID [2022-04-08 10:12:47,181 INFO L290 TraceCheckUtils]: 20: Hoare triple {168425#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {168421#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:12:47,181 INFO L290 TraceCheckUtils]: 19: Hoare triple {168429#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {168425#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:12:47,182 INFO L290 TraceCheckUtils]: 18: Hoare triple {168429#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {168429#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:12:47,182 INFO L290 TraceCheckUtils]: 17: Hoare triple {168436#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168429#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:12:47,183 INFO L290 TraceCheckUtils]: 16: Hoare triple {168440#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168436#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:12:47,183 INFO L290 TraceCheckUtils]: 15: Hoare triple {168444#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168440#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:12:47,184 INFO L290 TraceCheckUtils]: 14: Hoare triple {168448#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168444#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:12:47,185 INFO L290 TraceCheckUtils]: 13: Hoare triple {168452#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168448#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:12:47,185 INFO L290 TraceCheckUtils]: 12: Hoare triple {168456#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168452#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:12:47,186 INFO L290 TraceCheckUtils]: 11: Hoare triple {168460#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168456#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:12:47,186 INFO L290 TraceCheckUtils]: 10: Hoare triple {168464#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168460#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:12:47,187 INFO L290 TraceCheckUtils]: 9: Hoare triple {168468#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168464#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:12:47,188 INFO L290 TraceCheckUtils]: 8: Hoare triple {168472#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168468#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:12:47,188 INFO L290 TraceCheckUtils]: 7: Hoare triple {168476#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168472#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:12:47,189 INFO L290 TraceCheckUtils]: 6: Hoare triple {168480#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {168476#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:12:47,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {168219#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {168480#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:12:47,189 INFO L272 TraceCheckUtils]: 4: Hoare triple {168219#true} call #t~ret13 := main(); {168219#true} is VALID [2022-04-08 10:12:47,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {168219#true} {168219#true} #72#return; {168219#true} is VALID [2022-04-08 10:12:47,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {168219#true} assume true; {168219#true} is VALID [2022-04-08 10:12:47,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {168219#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {168219#true} is VALID [2022-04-08 10:12:47,189 INFO L272 TraceCheckUtils]: 0: Hoare triple {168219#true} call ULTIMATE.init(); {168219#true} is VALID [2022-04-08 10:12:47,189 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-04-08 10:12:47,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514124174] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:12:47,190 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:12:47,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-08 10:12:47,190 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:12:47,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [84818668] [2022-04-08 10:12:47,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [84818668] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:12:47,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:12:47,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 10:12:47,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581412174] [2022-04-08 10:12:47,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:12:47,190 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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 41 [2022-04-08 10:12:47,190 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:12:47,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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-08 10:12:47,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:47,208 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 10:12:47,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:47,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 10:12:47,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=882, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 10:12:47,208 INFO L87 Difference]: Start difference. First operand 515 states and 699 transitions. Second operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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-08 10:12:53,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:53,352 INFO L93 Difference]: Finished difference Result 705 states and 901 transitions. [2022-04-08 10:12:53,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-08 10:12:53,352 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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 41 [2022-04-08 10:12:53,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:12:53,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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-08 10:12:53,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 120 transitions. [2022-04-08 10:12:53,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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-08 10:12:53,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 120 transitions. [2022-04-08 10:12:53,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 120 transitions. [2022-04-08 10:12:53,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:53,439 INFO L225 Difference]: With dead ends: 705 [2022-04-08 10:12:53,439 INFO L226 Difference]: Without dead ends: 685 [2022-04-08 10:12:53,440 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=524, Invalid=1926, Unknown=0, NotChecked=0, Total=2450 [2022-04-08 10:12:53,440 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 73 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1304 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 1363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:12:53,440 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 125 Invalid, 1363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1304 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 10:12:53,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2022-04-08 10:12:55,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 515. [2022-04-08 10:12:55,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:12:55,233 INFO L82 GeneralOperation]: Start isEquivalent. First operand 685 states. Second operand has 515 states, 510 states have (on average 1.3607843137254902) internal successors, (694), 510 states have internal predecessors, (694), 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-08 10:12:55,233 INFO L74 IsIncluded]: Start isIncluded. First operand 685 states. Second operand has 515 states, 510 states have (on average 1.3607843137254902) internal successors, (694), 510 states have internal predecessors, (694), 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-08 10:12:55,234 INFO L87 Difference]: Start difference. First operand 685 states. Second operand has 515 states, 510 states have (on average 1.3607843137254902) internal successors, (694), 510 states have internal predecessors, (694), 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-08 10:12:55,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:55,246 INFO L93 Difference]: Finished difference Result 685 states and 881 transitions. [2022-04-08 10:12:55,246 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 881 transitions. [2022-04-08 10:12:55,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:55,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:55,247 INFO L74 IsIncluded]: Start isIncluded. First operand has 515 states, 510 states have (on average 1.3607843137254902) internal successors, (694), 510 states have internal predecessors, (694), 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 685 states. [2022-04-08 10:12:55,247 INFO L87 Difference]: Start difference. First operand has 515 states, 510 states have (on average 1.3607843137254902) internal successors, (694), 510 states have internal predecessors, (694), 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 685 states. [2022-04-08 10:12:55,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:12:55,259 INFO L93 Difference]: Finished difference Result 685 states and 881 transitions. [2022-04-08 10:12:55,259 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 881 transitions. [2022-04-08 10:12:55,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:12:55,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:12:55,260 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:12:55,260 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:12:55,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 510 states have (on average 1.3607843137254902) internal successors, (694), 510 states have internal predecessors, (694), 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-08 10:12:55,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 698 transitions. [2022-04-08 10:12:55,270 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 698 transitions. Word has length 41 [2022-04-08 10:12:55,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:12:55,270 INFO L478 AbstractCegarLoop]: Abstraction has 515 states and 698 transitions. [2022-04-08 10:12:55,270 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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-08 10:12:55,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 515 states and 698 transitions. [2022-04-08 10:12:59,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 698 edges. 698 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:12:59,367 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 698 transitions. [2022-04-08 10:12:59,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 10:12:59,368 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:12:59,368 INFO L499 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:12:59,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Forceful destruction successful, exit code 0 [2022-04-08 10:12:59,568 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 83 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable84 [2022-04-08 10:12:59,569 INFO L403 AbstractCegarLoop]: === Iteration 86 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:12:59,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:12:59,569 INFO L85 PathProgramCache]: Analyzing trace with hash -962419464, now seen corresponding path program 51 times [2022-04-08 10:12:59,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:12:59,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1331223424] [2022-04-08 10:12:59,572 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:12:59,572 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:12:59,572 INFO L85 PathProgramCache]: Analyzing trace with hash -962419464, now seen corresponding path program 52 times [2022-04-08 10:12:59,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:12:59,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731518035] [2022-04-08 10:12:59,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:12:59,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:12:59,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:00,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:13:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:00,086 INFO L290 TraceCheckUtils]: 0: Hoare triple {172376#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {172343#true} is VALID [2022-04-08 10:13:00,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {172343#true} assume true; {172343#true} is VALID [2022-04-08 10:13:00,086 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {172343#true} {172343#true} #72#return; {172343#true} is VALID [2022-04-08 10:13:00,087 INFO L272 TraceCheckUtils]: 0: Hoare triple {172343#true} call ULTIMATE.init(); {172376#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:13:00,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {172376#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {172343#true} is VALID [2022-04-08 10:13:00,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {172343#true} assume true; {172343#true} is VALID [2022-04-08 10:13:00,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {172343#true} {172343#true} #72#return; {172343#true} is VALID [2022-04-08 10:13:00,087 INFO L272 TraceCheckUtils]: 4: Hoare triple {172343#true} call #t~ret13 := main(); {172343#true} is VALID [2022-04-08 10:13:00,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {172343#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {172348#(= main_~y~0 0)} is VALID [2022-04-08 10:13:00,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {172348#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172349#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:13:00,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {172349#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172350#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:13:00,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {172350#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172351#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:13:00,090 INFO L290 TraceCheckUtils]: 9: Hoare triple {172351#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172352#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:13:00,090 INFO L290 TraceCheckUtils]: 10: Hoare triple {172352#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172353#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:00,091 INFO L290 TraceCheckUtils]: 11: Hoare triple {172353#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172354#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:13:00,091 INFO L290 TraceCheckUtils]: 12: Hoare triple {172354#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172355#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:13:00,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {172355#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172356#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:13:00,092 INFO L290 TraceCheckUtils]: 14: Hoare triple {172356#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172357#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:13:00,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {172357#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172358#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:13:00,093 INFO L290 TraceCheckUtils]: 16: Hoare triple {172358#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172359#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:13:00,094 INFO L290 TraceCheckUtils]: 17: Hoare triple {172359#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172360#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:13:00,094 INFO L290 TraceCheckUtils]: 18: Hoare triple {172360#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172361#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:13:00,095 INFO L290 TraceCheckUtils]: 19: Hoare triple {172361#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172362#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:13:00,095 INFO L290 TraceCheckUtils]: 20: Hoare triple {172362#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172363#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:13:00,096 INFO L290 TraceCheckUtils]: 21: Hoare triple {172363#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172364#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:13:00,096 INFO L290 TraceCheckUtils]: 22: Hoare triple {172364#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172365#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:13:00,097 INFO L290 TraceCheckUtils]: 23: Hoare triple {172365#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172366#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:13:00,097 INFO L290 TraceCheckUtils]: 24: Hoare triple {172366#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172367#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:13:00,097 INFO L290 TraceCheckUtils]: 25: Hoare triple {172367#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172368#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:13:00,098 INFO L290 TraceCheckUtils]: 26: Hoare triple {172368#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172369#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:13:00,098 INFO L290 TraceCheckUtils]: 27: Hoare triple {172369#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172370#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:13:00,099 INFO L290 TraceCheckUtils]: 28: Hoare triple {172370#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172371#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:13:00,100 INFO L290 TraceCheckUtils]: 29: Hoare triple {172371#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172372#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-08 10:13:00,100 INFO L290 TraceCheckUtils]: 30: Hoare triple {172372#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172373#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-08 10:13:00,101 INFO L290 TraceCheckUtils]: 31: Hoare triple {172373#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172374#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-08 10:13:00,101 INFO L290 TraceCheckUtils]: 32: Hoare triple {172374#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {172374#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-08 10:13:00,101 INFO L290 TraceCheckUtils]: 33: Hoare triple {172374#(and (<= main_~y~0 26) (<= 26 main_~y~0))} ~z~0 := ~y~0; {172375#(and (<= (div main_~z~0 4294967296) 0) (<= 26 main_~z~0))} is VALID [2022-04-08 10:13:00,102 INFO L290 TraceCheckUtils]: 34: Hoare triple {172375#(and (<= (div main_~z~0 4294967296) 0) (<= 26 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {172344#false} is VALID [2022-04-08 10:13:00,102 INFO L290 TraceCheckUtils]: 35: Hoare triple {172344#false} assume !(~y~0 % 4294967296 > 0); {172344#false} is VALID [2022-04-08 10:13:00,102 INFO L290 TraceCheckUtils]: 36: Hoare triple {172344#false} assume !(~x~0 % 4294967296 > 0); {172344#false} is VALID [2022-04-08 10:13:00,102 INFO L272 TraceCheckUtils]: 37: Hoare triple {172344#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {172344#false} is VALID [2022-04-08 10:13:00,102 INFO L290 TraceCheckUtils]: 38: Hoare triple {172344#false} ~cond := #in~cond; {172344#false} is VALID [2022-04-08 10:13:00,102 INFO L290 TraceCheckUtils]: 39: Hoare triple {172344#false} assume 0 == ~cond; {172344#false} is VALID [2022-04-08 10:13:00,102 INFO L290 TraceCheckUtils]: 40: Hoare triple {172344#false} assume !false; {172344#false} is VALID [2022-04-08 10:13:00,102 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:13:00,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:13:00,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731518035] [2022-04-08 10:13:00,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731518035] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:13:00,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954810468] [2022-04-08 10:13:00,103 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:13:00,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:13:00,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:13:00,104 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:13:00,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Waiting until timeout for monitored process [2022-04-08 10:13:00,147 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:13:00,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:13:00,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-08 10:13:00,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:00,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:13:00,506 INFO L272 TraceCheckUtils]: 0: Hoare triple {172343#true} call ULTIMATE.init(); {172343#true} is VALID [2022-04-08 10:13:00,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {172343#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {172343#true} is VALID [2022-04-08 10:13:00,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {172343#true} assume true; {172343#true} is VALID [2022-04-08 10:13:00,507 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {172343#true} {172343#true} #72#return; {172343#true} is VALID [2022-04-08 10:13:00,507 INFO L272 TraceCheckUtils]: 4: Hoare triple {172343#true} call #t~ret13 := main(); {172343#true} is VALID [2022-04-08 10:13:00,507 INFO L290 TraceCheckUtils]: 5: Hoare triple {172343#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {172348#(= main_~y~0 0)} is VALID [2022-04-08 10:13:00,507 INFO L290 TraceCheckUtils]: 6: Hoare triple {172348#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172349#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:13:00,508 INFO L290 TraceCheckUtils]: 7: Hoare triple {172349#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172350#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:13:00,508 INFO L290 TraceCheckUtils]: 8: Hoare triple {172350#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172351#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:13:00,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {172351#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172352#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:13:00,509 INFO L290 TraceCheckUtils]: 10: Hoare triple {172352#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172353#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:00,510 INFO L290 TraceCheckUtils]: 11: Hoare triple {172353#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172354#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:13:00,510 INFO L290 TraceCheckUtils]: 12: Hoare triple {172354#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172355#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:13:00,510 INFO L290 TraceCheckUtils]: 13: Hoare triple {172355#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172356#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:13:00,511 INFO L290 TraceCheckUtils]: 14: Hoare triple {172356#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172357#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:13:00,511 INFO L290 TraceCheckUtils]: 15: Hoare triple {172357#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172358#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:13:00,512 INFO L290 TraceCheckUtils]: 16: Hoare triple {172358#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172359#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:13:00,512 INFO L290 TraceCheckUtils]: 17: Hoare triple {172359#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172360#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:13:00,513 INFO L290 TraceCheckUtils]: 18: Hoare triple {172360#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172361#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:13:00,513 INFO L290 TraceCheckUtils]: 19: Hoare triple {172361#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172362#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:13:00,514 INFO L290 TraceCheckUtils]: 20: Hoare triple {172362#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172363#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:13:00,514 INFO L290 TraceCheckUtils]: 21: Hoare triple {172363#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172364#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:13:00,515 INFO L290 TraceCheckUtils]: 22: Hoare triple {172364#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172365#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:13:00,515 INFO L290 TraceCheckUtils]: 23: Hoare triple {172365#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172366#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:13:00,515 INFO L290 TraceCheckUtils]: 24: Hoare triple {172366#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172367#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:13:00,516 INFO L290 TraceCheckUtils]: 25: Hoare triple {172367#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172368#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:13:00,516 INFO L290 TraceCheckUtils]: 26: Hoare triple {172368#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172369#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:13:00,517 INFO L290 TraceCheckUtils]: 27: Hoare triple {172369#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172370#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:13:00,517 INFO L290 TraceCheckUtils]: 28: Hoare triple {172370#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172371#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:13:00,518 INFO L290 TraceCheckUtils]: 29: Hoare triple {172371#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172372#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-08 10:13:00,518 INFO L290 TraceCheckUtils]: 30: Hoare triple {172372#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172373#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-08 10:13:00,519 INFO L290 TraceCheckUtils]: 31: Hoare triple {172373#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172374#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-08 10:13:00,519 INFO L290 TraceCheckUtils]: 32: Hoare triple {172374#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {172374#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-08 10:13:00,519 INFO L290 TraceCheckUtils]: 33: Hoare triple {172374#(and (<= main_~y~0 26) (<= 26 main_~y~0))} ~z~0 := ~y~0; {172479#(and (<= main_~z~0 26) (<= 26 main_~z~0))} is VALID [2022-04-08 10:13:00,520 INFO L290 TraceCheckUtils]: 34: Hoare triple {172479#(and (<= main_~z~0 26) (<= 26 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {172344#false} is VALID [2022-04-08 10:13:00,520 INFO L290 TraceCheckUtils]: 35: Hoare triple {172344#false} assume !(~y~0 % 4294967296 > 0); {172344#false} is VALID [2022-04-08 10:13:00,520 INFO L290 TraceCheckUtils]: 36: Hoare triple {172344#false} assume !(~x~0 % 4294967296 > 0); {172344#false} is VALID [2022-04-08 10:13:00,520 INFO L272 TraceCheckUtils]: 37: Hoare triple {172344#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {172344#false} is VALID [2022-04-08 10:13:00,520 INFO L290 TraceCheckUtils]: 38: Hoare triple {172344#false} ~cond := #in~cond; {172344#false} is VALID [2022-04-08 10:13:00,520 INFO L290 TraceCheckUtils]: 39: Hoare triple {172344#false} assume 0 == ~cond; {172344#false} is VALID [2022-04-08 10:13:00,520 INFO L290 TraceCheckUtils]: 40: Hoare triple {172344#false} assume !false; {172344#false} is VALID [2022-04-08 10:13:00,520 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:13:00,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:13:01,571 INFO L290 TraceCheckUtils]: 40: Hoare triple {172344#false} assume !false; {172344#false} is VALID [2022-04-08 10:13:01,571 INFO L290 TraceCheckUtils]: 39: Hoare triple {172344#false} assume 0 == ~cond; {172344#false} is VALID [2022-04-08 10:13:01,571 INFO L290 TraceCheckUtils]: 38: Hoare triple {172344#false} ~cond := #in~cond; {172344#false} is VALID [2022-04-08 10:13:01,571 INFO L272 TraceCheckUtils]: 37: Hoare triple {172344#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {172344#false} is VALID [2022-04-08 10:13:01,571 INFO L290 TraceCheckUtils]: 36: Hoare triple {172344#false} assume !(~x~0 % 4294967296 > 0); {172344#false} is VALID [2022-04-08 10:13:01,571 INFO L290 TraceCheckUtils]: 35: Hoare triple {172344#false} assume !(~y~0 % 4294967296 > 0); {172344#false} is VALID [2022-04-08 10:13:01,571 INFO L290 TraceCheckUtils]: 34: Hoare triple {172519#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {172344#false} is VALID [2022-04-08 10:13:01,572 INFO L290 TraceCheckUtils]: 33: Hoare triple {172523#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {172519#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:13:01,572 INFO L290 TraceCheckUtils]: 32: Hoare triple {172523#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {172523#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:13:01,572 INFO L290 TraceCheckUtils]: 31: Hoare triple {172530#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172523#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:13:01,573 INFO L290 TraceCheckUtils]: 30: Hoare triple {172534#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172530#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:13:01,574 INFO L290 TraceCheckUtils]: 29: Hoare triple {172538#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172534#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:13:01,574 INFO L290 TraceCheckUtils]: 28: Hoare triple {172542#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172538#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:13:01,575 INFO L290 TraceCheckUtils]: 27: Hoare triple {172546#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172542#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:13:01,575 INFO L290 TraceCheckUtils]: 26: Hoare triple {172550#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172546#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:13:01,576 INFO L290 TraceCheckUtils]: 25: Hoare triple {172554#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172550#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:13:01,576 INFO L290 TraceCheckUtils]: 24: Hoare triple {172558#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172554#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:13:01,577 INFO L290 TraceCheckUtils]: 23: Hoare triple {172562#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172558#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:13:01,578 INFO L290 TraceCheckUtils]: 22: Hoare triple {172566#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172562#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:13:01,578 INFO L290 TraceCheckUtils]: 21: Hoare triple {172570#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172566#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:13:01,579 INFO L290 TraceCheckUtils]: 20: Hoare triple {172574#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172570#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:13:01,579 INFO L290 TraceCheckUtils]: 19: Hoare triple {172578#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172574#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:13:01,580 INFO L290 TraceCheckUtils]: 18: Hoare triple {172582#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172578#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:13:01,580 INFO L290 TraceCheckUtils]: 17: Hoare triple {172586#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172582#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:13:01,581 INFO L290 TraceCheckUtils]: 16: Hoare triple {172590#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172586#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:13:01,582 INFO L290 TraceCheckUtils]: 15: Hoare triple {172594#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172590#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:13:01,582 INFO L290 TraceCheckUtils]: 14: Hoare triple {172598#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172594#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:13:01,583 INFO L290 TraceCheckUtils]: 13: Hoare triple {172602#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172598#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-08 10:13:01,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {172606#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172602#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-08 10:13:01,584 INFO L290 TraceCheckUtils]: 11: Hoare triple {172610#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172606#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-08 10:13:01,584 INFO L290 TraceCheckUtils]: 10: Hoare triple {172614#(< 0 (mod (+ main_~y~0 22) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172610#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-08 10:13:01,585 INFO L290 TraceCheckUtils]: 9: Hoare triple {172618#(< 0 (mod (+ 23 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172614#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-08 10:13:01,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {172622#(< 0 (mod (+ main_~y~0 24) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172618#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID [2022-04-08 10:13:01,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {172626#(< 0 (mod (+ main_~y~0 25) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172622#(< 0 (mod (+ main_~y~0 24) 4294967296))} is VALID [2022-04-08 10:13:01,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {172630#(< 0 (mod (+ main_~y~0 26) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {172626#(< 0 (mod (+ main_~y~0 25) 4294967296))} is VALID [2022-04-08 10:13:01,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {172343#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {172630#(< 0 (mod (+ main_~y~0 26) 4294967296))} is VALID [2022-04-08 10:13:01,587 INFO L272 TraceCheckUtils]: 4: Hoare triple {172343#true} call #t~ret13 := main(); {172343#true} is VALID [2022-04-08 10:13:01,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {172343#true} {172343#true} #72#return; {172343#true} is VALID [2022-04-08 10:13:01,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {172343#true} assume true; {172343#true} is VALID [2022-04-08 10:13:01,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {172343#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {172343#true} is VALID [2022-04-08 10:13:01,587 INFO L272 TraceCheckUtils]: 0: Hoare triple {172343#true} call ULTIMATE.init(); {172343#true} is VALID [2022-04-08 10:13:01,587 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:13:01,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954810468] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:13:01,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:13:01,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 60 [2022-04-08 10:13:01,588 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:13:01,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1331223424] [2022-04-08 10:13:01,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1331223424] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:13:01,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:13:01,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-08 10:13:01,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043026251] [2022-04-08 10:13:01,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:13:01,589 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 states have internal predecessors, (37), 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 41 [2022-04-08 10:13:01,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:13:01,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 states have internal predecessors, (37), 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-08 10:13:01,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:13:01,610 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-08 10:13:01,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:13:01,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-08 10:13:01,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=848, Invalid=2692, Unknown=0, NotChecked=0, Total=3540 [2022-04-08 10:13:01,613 INFO L87 Difference]: Start difference. First operand 515 states and 698 transitions. Second operand has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 states have internal predecessors, (37), 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-08 10:13:14,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:14,603 INFO L93 Difference]: Finished difference Result 897 states and 1371 transitions. [2022-04-08 10:13:14,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-08 10:13:14,604 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 states have internal predecessors, (37), 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 41 [2022-04-08 10:13:14,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:13:14,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 states have internal predecessors, (37), 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-08 10:13:14,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 271 transitions. [2022-04-08 10:13:14,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 states have internal predecessors, (37), 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-08 10:13:14,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 271 transitions. [2022-04-08 10:13:14,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 271 transitions. [2022-04-08 10:13:14,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 271 edges. 271 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:13:14,776 INFO L225 Difference]: With dead ends: 897 [2022-04-08 10:13:14,776 INFO L226 Difference]: Without dead ends: 866 [2022-04-08 10:13:14,776 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1718, Invalid=5938, Unknown=0, NotChecked=0, Total=7656 [2022-04-08 10:13:14,778 INFO L913 BasicCegarLoop]: 122 mSDtfsCounter, 202 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 6049 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 6194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 6049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:13:14,778 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 264 Invalid, 6194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 6049 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-04-08 10:13:14,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2022-04-08 10:13:16,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 536. [2022-04-08 10:13:16,590 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:13:16,614 INFO L82 GeneralOperation]: Start isEquivalent. First operand 866 states. Second operand has 536 states, 531 states have (on average 1.3653483992467044) internal successors, (725), 531 states have internal predecessors, (725), 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-08 10:13:16,614 INFO L74 IsIncluded]: Start isIncluded. First operand 866 states. Second operand has 536 states, 531 states have (on average 1.3653483992467044) internal successors, (725), 531 states have internal predecessors, (725), 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-08 10:13:16,615 INFO L87 Difference]: Start difference. First operand 866 states. Second operand has 536 states, 531 states have (on average 1.3653483992467044) internal successors, (725), 531 states have internal predecessors, (725), 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-08 10:13:16,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:16,635 INFO L93 Difference]: Finished difference Result 866 states and 1086 transitions. [2022-04-08 10:13:16,635 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1086 transitions. [2022-04-08 10:13:16,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:13:16,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:13:16,636 INFO L74 IsIncluded]: Start isIncluded. First operand has 536 states, 531 states have (on average 1.3653483992467044) internal successors, (725), 531 states have internal predecessors, (725), 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 866 states. [2022-04-08 10:13:16,636 INFO L87 Difference]: Start difference. First operand has 536 states, 531 states have (on average 1.3653483992467044) internal successors, (725), 531 states have internal predecessors, (725), 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 866 states. [2022-04-08 10:13:16,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:16,656 INFO L93 Difference]: Finished difference Result 866 states and 1086 transitions. [2022-04-08 10:13:16,656 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1086 transitions. [2022-04-08 10:13:16,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:13:16,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:13:16,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:13:16,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:13:16,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 531 states have (on average 1.3653483992467044) internal successors, (725), 531 states have internal predecessors, (725), 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-08 10:13:16,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 729 transitions. [2022-04-08 10:13:16,667 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 729 transitions. Word has length 41 [2022-04-08 10:13:16,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:13:16,667 INFO L478 AbstractCegarLoop]: Abstraction has 536 states and 729 transitions. [2022-04-08 10:13:16,668 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 states have internal predecessors, (37), 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-08 10:13:16,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 536 states and 729 transitions. [2022-04-08 10:13:21,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 729 edges. 729 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:13:21,936 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 729 transitions. [2022-04-08 10:13:21,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-08 10:13:21,936 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:13:21,936 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:13:21,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Forceful destruction successful, exit code 0 [2022-04-08 10:13:22,152 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85,84 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:13:22,152 INFO L403 AbstractCegarLoop]: === Iteration 87 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:13:22,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:13:22,153 INFO L85 PathProgramCache]: Analyzing trace with hash 14953136, now seen corresponding path program 33 times [2022-04-08 10:13:22,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:13:22,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [649363312] [2022-04-08 10:13:22,154 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:13:22,155 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:13:22,155 INFO L85 PathProgramCache]: Analyzing trace with hash 14953136, now seen corresponding path program 34 times [2022-04-08 10:13:22,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:13:22,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799597342] [2022-04-08 10:13:22,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:13:22,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:13:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:22,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:13:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:22,478 INFO L290 TraceCheckUtils]: 0: Hoare triple {177328#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {177305#true} is VALID [2022-04-08 10:13:22,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {177305#true} assume true; {177305#true} is VALID [2022-04-08 10:13:22,478 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {177305#true} {177305#true} #72#return; {177305#true} is VALID [2022-04-08 10:13:22,479 INFO L272 TraceCheckUtils]: 0: Hoare triple {177305#true} call ULTIMATE.init(); {177328#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:13:22,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {177328#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {177305#true} is VALID [2022-04-08 10:13:22,479 INFO L290 TraceCheckUtils]: 2: Hoare triple {177305#true} assume true; {177305#true} is VALID [2022-04-08 10:13:22,479 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {177305#true} {177305#true} #72#return; {177305#true} is VALID [2022-04-08 10:13:22,479 INFO L272 TraceCheckUtils]: 4: Hoare triple {177305#true} call #t~ret13 := main(); {177305#true} is VALID [2022-04-08 10:13:22,479 INFO L290 TraceCheckUtils]: 5: Hoare triple {177305#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {177305#true} is VALID [2022-04-08 10:13:22,480 INFO L290 TraceCheckUtils]: 6: Hoare triple {177305#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177310#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:13:22,481 INFO L290 TraceCheckUtils]: 7: Hoare triple {177310#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177311#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-08 10:13:22,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {177311#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177312#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:13:22,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {177312#(<= main_~x~0 (+ 4294967292 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177313#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:13:22,483 INFO L290 TraceCheckUtils]: 10: Hoare triple {177313#(<= main_~x~0 (+ 4294967291 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177314#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:13:22,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {177314#(<= main_~x~0 (+ 4294967290 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177315#(<= main_~x~0 (+ 4294967289 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:13:22,485 INFO L290 TraceCheckUtils]: 12: Hoare triple {177315#(<= main_~x~0 (+ 4294967289 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177316#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:13:22,486 INFO L290 TraceCheckUtils]: 13: Hoare triple {177316#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177317#(<= main_~x~0 (+ 4294967287 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:13:22,488 INFO L290 TraceCheckUtils]: 14: Hoare triple {177317#(<= main_~x~0 (+ 4294967287 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177318#(<= (* 4294967296 (div (+ main_~x~0 9) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:13:22,488 INFO L290 TraceCheckUtils]: 15: Hoare triple {177318#(<= (* 4294967296 (div (+ main_~x~0 9) 4294967296)) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {177318#(<= (* 4294967296 (div (+ main_~x~0 9) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:13:22,489 INFO L290 TraceCheckUtils]: 16: Hoare triple {177318#(<= (* 4294967296 (div (+ main_~x~0 9) 4294967296)) main_~x~0)} ~z~0 := ~y~0; {177318#(<= (* 4294967296 (div (+ main_~x~0 9) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:13:22,489 INFO L290 TraceCheckUtils]: 17: Hoare triple {177318#(<= (* 4294967296 (div (+ main_~x~0 9) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177319#(<= (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-08 10:13:22,490 INFO L290 TraceCheckUtils]: 18: Hoare triple {177319#(<= (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) 1) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177320#(<= (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 2) main_~x~0)} is VALID [2022-04-08 10:13:22,491 INFO L290 TraceCheckUtils]: 19: Hoare triple {177320#(<= (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 2) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177321#(<= (+ 3 (* 4294967296 (div (+ main_~x~0 6) 4294967296))) main_~x~0)} is VALID [2022-04-08 10:13:22,491 INFO L290 TraceCheckUtils]: 20: Hoare triple {177321#(<= (+ 3 (* 4294967296 (div (+ main_~x~0 6) 4294967296))) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177322#(<= (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-08 10:13:22,492 INFO L290 TraceCheckUtils]: 21: Hoare triple {177322#(<= (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177323#(<= (+ 5 (* (div (+ main_~x~0 4) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:13:22,493 INFO L290 TraceCheckUtils]: 22: Hoare triple {177323#(<= (+ 5 (* (div (+ main_~x~0 4) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177324#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 6) main_~x~0)} is VALID [2022-04-08 10:13:22,493 INFO L290 TraceCheckUtils]: 23: Hoare triple {177324#(<= (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 6) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177325#(<= (+ 7 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-08 10:13:22,494 INFO L290 TraceCheckUtils]: 24: Hoare triple {177325#(<= (+ 7 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177326#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 8) main_~x~0)} is VALID [2022-04-08 10:13:22,495 INFO L290 TraceCheckUtils]: 25: Hoare triple {177326#(<= (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 8) main_~x~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177327#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:13:22,495 INFO L290 TraceCheckUtils]: 26: Hoare triple {177327#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {177327#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:13:22,495 INFO L290 TraceCheckUtils]: 27: Hoare triple {177327#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {177327#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:13:22,496 INFO L290 TraceCheckUtils]: 28: Hoare triple {177327#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {177327#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:13:22,496 INFO L290 TraceCheckUtils]: 29: Hoare triple {177327#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {177327#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:13:22,496 INFO L290 TraceCheckUtils]: 30: Hoare triple {177327#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {177327#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:13:22,497 INFO L290 TraceCheckUtils]: 31: Hoare triple {177327#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {177327#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:13:22,497 INFO L290 TraceCheckUtils]: 32: Hoare triple {177327#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {177327#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:13:22,497 INFO L290 TraceCheckUtils]: 33: Hoare triple {177327#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {177327#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:13:22,498 INFO L290 TraceCheckUtils]: 34: Hoare triple {177327#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {177327#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:13:22,498 INFO L290 TraceCheckUtils]: 35: Hoare triple {177327#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {177327#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:13:22,499 INFO L290 TraceCheckUtils]: 36: Hoare triple {177327#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {177327#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-08 10:13:22,499 INFO L290 TraceCheckUtils]: 37: Hoare triple {177327#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {177306#false} is VALID [2022-04-08 10:13:22,499 INFO L272 TraceCheckUtils]: 38: Hoare triple {177306#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {177306#false} is VALID [2022-04-08 10:13:22,499 INFO L290 TraceCheckUtils]: 39: Hoare triple {177306#false} ~cond := #in~cond; {177306#false} is VALID [2022-04-08 10:13:22,499 INFO L290 TraceCheckUtils]: 40: Hoare triple {177306#false} assume 0 == ~cond; {177306#false} is VALID [2022-04-08 10:13:22,499 INFO L290 TraceCheckUtils]: 41: Hoare triple {177306#false} assume !false; {177306#false} is VALID [2022-04-08 10:13:22,499 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-08 10:13:22,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:13:22,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799597342] [2022-04-08 10:13:22,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799597342] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:13:22,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221833727] [2022-04-08 10:13:22,500 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:13:22,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:13:22,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:13:22,501 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:13:22,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Waiting until timeout for monitored process [2022-04-08 10:13:22,548 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:13:22,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:13:22,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-08 10:13:22,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:22,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:13:22,893 INFO L272 TraceCheckUtils]: 0: Hoare triple {177305#true} call ULTIMATE.init(); {177305#true} is VALID [2022-04-08 10:13:22,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {177305#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {177305#true} is VALID [2022-04-08 10:13:22,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {177305#true} assume true; {177305#true} is VALID [2022-04-08 10:13:22,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {177305#true} {177305#true} #72#return; {177305#true} is VALID [2022-04-08 10:13:22,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {177305#true} call #t~ret13 := main(); {177305#true} is VALID [2022-04-08 10:13:22,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {177305#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {177305#true} is VALID [2022-04-08 10:13:22,894 INFO L290 TraceCheckUtils]: 6: Hoare triple {177305#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177310#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:13:22,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {177310#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177353#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:13:22,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {177353#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177357#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:22,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {177357#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177361#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:13:22,897 INFO L290 TraceCheckUtils]: 10: Hoare triple {177361#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177365#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:22,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {177365#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177369#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-08 10:13:22,898 INFO L290 TraceCheckUtils]: 12: Hoare triple {177369#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177373#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-08 10:13:22,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {177373#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177377#(<= main_~x~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967287))} is VALID [2022-04-08 10:13:22,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {177377#(<= main_~x~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967287))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177381#(<= main_~x~0 (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) 4294967286))} is VALID [2022-04-08 10:13:22,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {177381#(<= main_~x~0 (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) 4294967286))} assume !(~x~0 % 4294967296 > 0); {177381#(<= main_~x~0 (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) 4294967286))} is VALID [2022-04-08 10:13:22,900 INFO L290 TraceCheckUtils]: 16: Hoare triple {177381#(<= main_~x~0 (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) 4294967286))} ~z~0 := ~y~0; {177381#(<= main_~x~0 (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) 4294967286))} is VALID [2022-04-08 10:13:22,900 INFO L290 TraceCheckUtils]: 17: Hoare triple {177381#(<= main_~x~0 (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) 4294967286))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177377#(<= main_~x~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967287))} is VALID [2022-04-08 10:13:22,901 INFO L290 TraceCheckUtils]: 18: Hoare triple {177377#(<= main_~x~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967287))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177373#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-08 10:13:22,901 INFO L290 TraceCheckUtils]: 19: Hoare triple {177373#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177369#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-08 10:13:22,902 INFO L290 TraceCheckUtils]: 20: Hoare triple {177369#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177365#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:22,903 INFO L290 TraceCheckUtils]: 21: Hoare triple {177365#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177361#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:13:22,903 INFO L290 TraceCheckUtils]: 22: Hoare triple {177361#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177357#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:22,904 INFO L290 TraceCheckUtils]: 23: Hoare triple {177357#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177353#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:13:22,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {177353#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177310#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:13:22,905 INFO L290 TraceCheckUtils]: 25: Hoare triple {177310#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:22,905 INFO L290 TraceCheckUtils]: 26: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:22,905 INFO L290 TraceCheckUtils]: 27: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:22,906 INFO L290 TraceCheckUtils]: 28: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:22,906 INFO L290 TraceCheckUtils]: 29: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:22,906 INFO L290 TraceCheckUtils]: 30: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:22,906 INFO L290 TraceCheckUtils]: 31: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:22,906 INFO L290 TraceCheckUtils]: 32: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:22,907 INFO L290 TraceCheckUtils]: 33: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:22,907 INFO L290 TraceCheckUtils]: 34: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:22,907 INFO L290 TraceCheckUtils]: 35: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:22,907 INFO L290 TraceCheckUtils]: 36: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:22,908 INFO L290 TraceCheckUtils]: 37: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {177306#false} is VALID [2022-04-08 10:13:22,908 INFO L272 TraceCheckUtils]: 38: Hoare triple {177306#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {177306#false} is VALID [2022-04-08 10:13:22,908 INFO L290 TraceCheckUtils]: 39: Hoare triple {177306#false} ~cond := #in~cond; {177306#false} is VALID [2022-04-08 10:13:22,908 INFO L290 TraceCheckUtils]: 40: Hoare triple {177306#false} assume 0 == ~cond; {177306#false} is VALID [2022-04-08 10:13:22,908 INFO L290 TraceCheckUtils]: 41: Hoare triple {177306#false} assume !false; {177306#false} is VALID [2022-04-08 10:13:22,908 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 9 proven. 81 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-08 10:13:22,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:13:23,051 INFO L290 TraceCheckUtils]: 41: Hoare triple {177306#false} assume !false; {177306#false} is VALID [2022-04-08 10:13:23,051 INFO L290 TraceCheckUtils]: 40: Hoare triple {177306#false} assume 0 == ~cond; {177306#false} is VALID [2022-04-08 10:13:23,051 INFO L290 TraceCheckUtils]: 39: Hoare triple {177306#false} ~cond := #in~cond; {177306#false} is VALID [2022-04-08 10:13:23,051 INFO L272 TraceCheckUtils]: 38: Hoare triple {177306#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {177306#false} is VALID [2022-04-08 10:13:23,052 INFO L290 TraceCheckUtils]: 37: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {177306#false} is VALID [2022-04-08 10:13:23,052 INFO L290 TraceCheckUtils]: 36: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:23,052 INFO L290 TraceCheckUtils]: 35: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:23,052 INFO L290 TraceCheckUtils]: 34: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:23,053 INFO L290 TraceCheckUtils]: 33: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:23,053 INFO L290 TraceCheckUtils]: 32: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:23,053 INFO L290 TraceCheckUtils]: 31: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:23,053 INFO L290 TraceCheckUtils]: 30: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:23,053 INFO L290 TraceCheckUtils]: 29: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:23,054 INFO L290 TraceCheckUtils]: 28: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:23,054 INFO L290 TraceCheckUtils]: 27: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:23,054 INFO L290 TraceCheckUtils]: 26: Hoare triple {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:23,055 INFO L290 TraceCheckUtils]: 25: Hoare triple {177310#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177415#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:23,055 INFO L290 TraceCheckUtils]: 24: Hoare triple {177353#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177310#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:13:23,056 INFO L290 TraceCheckUtils]: 23: Hoare triple {177357#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177353#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:13:23,057 INFO L290 TraceCheckUtils]: 22: Hoare triple {177361#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177357#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:23,057 INFO L290 TraceCheckUtils]: 21: Hoare triple {177365#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177361#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:13:23,058 INFO L290 TraceCheckUtils]: 20: Hoare triple {177369#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177365#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:23,058 INFO L290 TraceCheckUtils]: 19: Hoare triple {177373#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177369#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-08 10:13:23,059 INFO L290 TraceCheckUtils]: 18: Hoare triple {177377#(<= main_~x~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967287))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177373#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-08 10:13:23,060 INFO L290 TraceCheckUtils]: 17: Hoare triple {177381#(<= main_~x~0 (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) 4294967286))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {177377#(<= main_~x~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967287))} is VALID [2022-04-08 10:13:23,060 INFO L290 TraceCheckUtils]: 16: Hoare triple {177381#(<= main_~x~0 (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) 4294967286))} ~z~0 := ~y~0; {177381#(<= main_~x~0 (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) 4294967286))} is VALID [2022-04-08 10:13:23,060 INFO L290 TraceCheckUtils]: 15: Hoare triple {177381#(<= main_~x~0 (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) 4294967286))} assume !(~x~0 % 4294967296 > 0); {177381#(<= main_~x~0 (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) 4294967286))} is VALID [2022-04-08 10:13:23,061 INFO L290 TraceCheckUtils]: 14: Hoare triple {177377#(<= main_~x~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967287))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177381#(<= main_~x~0 (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) 4294967286))} is VALID [2022-04-08 10:13:23,061 INFO L290 TraceCheckUtils]: 13: Hoare triple {177373#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177377#(<= main_~x~0 (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) 4294967287))} is VALID [2022-04-08 10:13:23,062 INFO L290 TraceCheckUtils]: 12: Hoare triple {177369#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177373#(<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~x~0 6) 4294967296))))} is VALID [2022-04-08 10:13:23,063 INFO L290 TraceCheckUtils]: 11: Hoare triple {177365#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177369#(<= main_~x~0 (+ (* (div (+ 5 main_~x~0) 4294967296) 4294967296) 4294967289))} is VALID [2022-04-08 10:13:23,063 INFO L290 TraceCheckUtils]: 10: Hoare triple {177361#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177365#(<= main_~x~0 (+ 4294967290 (* (div (+ main_~x~0 4) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:23,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {177357#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177361#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) 4294967291))} is VALID [2022-04-08 10:13:23,064 INFO L290 TraceCheckUtils]: 8: Hoare triple {177353#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177357#(<= main_~x~0 (+ 4294967292 (* (div (+ main_~x~0 2) 4294967296) 4294967296)))} is VALID [2022-04-08 10:13:23,065 INFO L290 TraceCheckUtils]: 7: Hoare triple {177310#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177353#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-08 10:13:23,066 INFO L290 TraceCheckUtils]: 6: Hoare triple {177305#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {177310#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-08 10:13:23,066 INFO L290 TraceCheckUtils]: 5: Hoare triple {177305#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {177305#true} is VALID [2022-04-08 10:13:23,066 INFO L272 TraceCheckUtils]: 4: Hoare triple {177305#true} call #t~ret13 := main(); {177305#true} is VALID [2022-04-08 10:13:23,066 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {177305#true} {177305#true} #72#return; {177305#true} is VALID [2022-04-08 10:13:23,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {177305#true} assume true; {177305#true} is VALID [2022-04-08 10:13:23,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {177305#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {177305#true} is VALID [2022-04-08 10:13:23,066 INFO L272 TraceCheckUtils]: 0: Hoare triple {177305#true} call ULTIMATE.init(); {177305#true} is VALID [2022-04-08 10:13:23,066 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 9 proven. 81 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-08 10:13:23,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221833727] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:13:23,066 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:13:23,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12, 12] total 30 [2022-04-08 10:13:23,066 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:13:23,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [649363312] [2022-04-08 10:13:23,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [649363312] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:13:23,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:13:23,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 10:13:23,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428929447] [2022-04-08 10:13:23,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:13:23,067 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 states have internal predecessors, (30), 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 42 [2022-04-08 10:13:23,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:13:23,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 states have internal predecessors, (30), 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-08 10:13:23,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:13:23,091 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 10:13:23,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:13:23,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 10:13:23,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=668, Unknown=0, NotChecked=0, Total=870 [2022-04-08 10:13:23,091 INFO L87 Difference]: Start difference. First operand 536 states and 729 transitions. Second operand has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 states have internal predecessors, (30), 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-08 10:13:27,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:27,870 INFO L93 Difference]: Finished difference Result 606 states and 836 transitions. [2022-04-08 10:13:27,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-08 10:13:27,870 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 states have internal predecessors, (30), 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 42 [2022-04-08 10:13:27,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:13:27,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 states have internal predecessors, (30), 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-08 10:13:27,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 110 transitions. [2022-04-08 10:13:27,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 states have internal predecessors, (30), 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-08 10:13:27,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 110 transitions. [2022-04-08 10:13:27,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 110 transitions. [2022-04-08 10:13:27,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:13:27,965 INFO L225 Difference]: With dead ends: 606 [2022-04-08 10:13:27,965 INFO L226 Difference]: Without dead ends: 601 [2022-04-08 10:13:27,966 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=491, Invalid=1765, Unknown=0, NotChecked=0, Total=2256 [2022-04-08 10:13:27,966 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 114 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-08 10:13:27,966 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 79 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-08 10:13:27,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2022-04-08 10:13:29,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 584. [2022-04-08 10:13:29,990 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:13:29,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 601 states. Second operand has 584 states, 579 states have (on average 1.3696027633851469) internal successors, (793), 579 states have internal predecessors, (793), 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-08 10:13:29,991 INFO L74 IsIncluded]: Start isIncluded. First operand 601 states. Second operand has 584 states, 579 states have (on average 1.3696027633851469) internal successors, (793), 579 states have internal predecessors, (793), 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-08 10:13:29,991 INFO L87 Difference]: Start difference. First operand 601 states. Second operand has 584 states, 579 states have (on average 1.3696027633851469) internal successors, (793), 579 states have internal predecessors, (793), 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-08 10:13:30,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:30,001 INFO L93 Difference]: Finished difference Result 601 states and 823 transitions. [2022-04-08 10:13:30,001 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 823 transitions. [2022-04-08 10:13:30,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:13:30,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:13:30,002 INFO L74 IsIncluded]: Start isIncluded. First operand has 584 states, 579 states have (on average 1.3696027633851469) internal successors, (793), 579 states have internal predecessors, (793), 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 601 states. [2022-04-08 10:13:30,002 INFO L87 Difference]: Start difference. First operand has 584 states, 579 states have (on average 1.3696027633851469) internal successors, (793), 579 states have internal predecessors, (793), 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 601 states. [2022-04-08 10:13:30,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:30,012 INFO L93 Difference]: Finished difference Result 601 states and 823 transitions. [2022-04-08 10:13:30,012 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 823 transitions. [2022-04-08 10:13:30,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:13:30,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:13:30,012 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:13:30,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:13:30,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 579 states have (on average 1.3696027633851469) internal successors, (793), 579 states have internal predecessors, (793), 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-08 10:13:30,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 797 transitions. [2022-04-08 10:13:30,025 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 797 transitions. Word has length 42 [2022-04-08 10:13:30,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:13:30,025 INFO L478 AbstractCegarLoop]: Abstraction has 584 states and 797 transitions. [2022-04-08 10:13:30,025 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 states have internal predecessors, (30), 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-08 10:13:30,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 584 states and 797 transitions. [2022-04-08 10:13:34,205 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 797 edges. 797 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:13:34,205 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 797 transitions. [2022-04-08 10:13:34,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-08 10:13:34,206 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:13:34,206 INFO L499 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:13:34,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Ended with exit code 0 [2022-04-08 10:13:34,419 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86,85 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:13:34,419 INFO L403 AbstractCegarLoop]: === Iteration 88 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:13:34,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:13:34,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1266472641, now seen corresponding path program 53 times [2022-04-08 10:13:34,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:13:34,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1587922806] [2022-04-08 10:13:34,423 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:13:34,423 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:13:34,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1266472641, now seen corresponding path program 54 times [2022-04-08 10:13:34,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:13:34,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093404445] [2022-04-08 10:13:34,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:13:34,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:13:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:34,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:13:34,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:34,999 INFO L290 TraceCheckUtils]: 0: Hoare triple {181241#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {181207#true} is VALID [2022-04-08 10:13:34,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {181207#true} assume true; {181207#true} is VALID [2022-04-08 10:13:34,999 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {181207#true} {181207#true} #72#return; {181207#true} is VALID [2022-04-08 10:13:35,000 INFO L272 TraceCheckUtils]: 0: Hoare triple {181207#true} call ULTIMATE.init(); {181241#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:13:35,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {181241#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {181207#true} is VALID [2022-04-08 10:13:35,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {181207#true} assume true; {181207#true} is VALID [2022-04-08 10:13:35,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {181207#true} {181207#true} #72#return; {181207#true} is VALID [2022-04-08 10:13:35,000 INFO L272 TraceCheckUtils]: 4: Hoare triple {181207#true} call #t~ret13 := main(); {181207#true} is VALID [2022-04-08 10:13:35,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {181207#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {181212#(= main_~y~0 0)} is VALID [2022-04-08 10:13:35,001 INFO L290 TraceCheckUtils]: 6: Hoare triple {181212#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181213#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:13:35,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {181213#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181214#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:13:35,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {181214#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181215#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:13:35,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {181215#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181216#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:13:35,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {181216#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181217#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:35,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {181217#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181218#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:13:35,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {181218#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181219#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:13:35,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {181219#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181220#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:13:35,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {181220#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181221#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:13:35,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {181221#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181222#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:13:35,006 INFO L290 TraceCheckUtils]: 16: Hoare triple {181222#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181223#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:13:35,006 INFO L290 TraceCheckUtils]: 17: Hoare triple {181223#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181224#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:13:35,007 INFO L290 TraceCheckUtils]: 18: Hoare triple {181224#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181225#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:13:35,007 INFO L290 TraceCheckUtils]: 19: Hoare triple {181225#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181226#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:13:35,008 INFO L290 TraceCheckUtils]: 20: Hoare triple {181226#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181227#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:13:35,008 INFO L290 TraceCheckUtils]: 21: Hoare triple {181227#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181228#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:13:35,009 INFO L290 TraceCheckUtils]: 22: Hoare triple {181228#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181229#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:13:35,009 INFO L290 TraceCheckUtils]: 23: Hoare triple {181229#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181230#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:13:35,010 INFO L290 TraceCheckUtils]: 24: Hoare triple {181230#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181231#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:13:35,010 INFO L290 TraceCheckUtils]: 25: Hoare triple {181231#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181232#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:13:35,011 INFO L290 TraceCheckUtils]: 26: Hoare triple {181232#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181233#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:13:35,012 INFO L290 TraceCheckUtils]: 27: Hoare triple {181233#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181234#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:13:35,012 INFO L290 TraceCheckUtils]: 28: Hoare triple {181234#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181235#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:13:35,013 INFO L290 TraceCheckUtils]: 29: Hoare triple {181235#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181236#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-08 10:13:35,013 INFO L290 TraceCheckUtils]: 30: Hoare triple {181236#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181237#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-08 10:13:35,014 INFO L290 TraceCheckUtils]: 31: Hoare triple {181237#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181238#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-08 10:13:35,014 INFO L290 TraceCheckUtils]: 32: Hoare triple {181238#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181239#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-08 10:13:35,014 INFO L290 TraceCheckUtils]: 33: Hoare triple {181239#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {181239#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-08 10:13:35,015 INFO L290 TraceCheckUtils]: 34: Hoare triple {181239#(and (<= main_~y~0 27) (<= 27 main_~y~0))} ~z~0 := ~y~0; {181240#(and (<= (div main_~z~0 4294967296) 0) (<= 27 main_~z~0))} is VALID [2022-04-08 10:13:35,015 INFO L290 TraceCheckUtils]: 35: Hoare triple {181240#(and (<= (div main_~z~0 4294967296) 0) (<= 27 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {181208#false} is VALID [2022-04-08 10:13:35,015 INFO L290 TraceCheckUtils]: 36: Hoare triple {181208#false} assume !(~y~0 % 4294967296 > 0); {181208#false} is VALID [2022-04-08 10:13:35,015 INFO L290 TraceCheckUtils]: 37: Hoare triple {181208#false} assume !(~x~0 % 4294967296 > 0); {181208#false} is VALID [2022-04-08 10:13:35,016 INFO L272 TraceCheckUtils]: 38: Hoare triple {181208#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {181208#false} is VALID [2022-04-08 10:13:35,016 INFO L290 TraceCheckUtils]: 39: Hoare triple {181208#false} ~cond := #in~cond; {181208#false} is VALID [2022-04-08 10:13:35,016 INFO L290 TraceCheckUtils]: 40: Hoare triple {181208#false} assume 0 == ~cond; {181208#false} is VALID [2022-04-08 10:13:35,016 INFO L290 TraceCheckUtils]: 41: Hoare triple {181208#false} assume !false; {181208#false} is VALID [2022-04-08 10:13:35,016 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:13:35,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:13:35,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093404445] [2022-04-08 10:13:35,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093404445] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:13:35,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972011953] [2022-04-08 10:13:35,016 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:13:35,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:13:35,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:13:35,017 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:13:35,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2022-04-08 10:13:36,131 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2022-04-08 10:13:36,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:13:36,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 59 conjunts are in the unsatisfiable core [2022-04-08 10:13:36,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:13:36,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:13:36,513 INFO L272 TraceCheckUtils]: 0: Hoare triple {181207#true} call ULTIMATE.init(); {181207#true} is VALID [2022-04-08 10:13:36,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {181207#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {181207#true} is VALID [2022-04-08 10:13:36,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {181207#true} assume true; {181207#true} is VALID [2022-04-08 10:13:36,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {181207#true} {181207#true} #72#return; {181207#true} is VALID [2022-04-08 10:13:36,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {181207#true} call #t~ret13 := main(); {181207#true} is VALID [2022-04-08 10:13:36,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {181207#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {181212#(= main_~y~0 0)} is VALID [2022-04-08 10:13:36,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {181212#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181213#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:13:36,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {181213#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181214#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:13:36,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {181214#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181215#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:13:36,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {181215#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181216#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:13:36,516 INFO L290 TraceCheckUtils]: 10: Hoare triple {181216#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181217#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:13:36,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {181217#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181218#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:13:36,517 INFO L290 TraceCheckUtils]: 12: Hoare triple {181218#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181219#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:13:36,517 INFO L290 TraceCheckUtils]: 13: Hoare triple {181219#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181220#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:13:36,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {181220#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181221#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:13:36,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {181221#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181222#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:13:36,519 INFO L290 TraceCheckUtils]: 16: Hoare triple {181222#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181223#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:13:36,519 INFO L290 TraceCheckUtils]: 17: Hoare triple {181223#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181224#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:13:36,520 INFO L290 TraceCheckUtils]: 18: Hoare triple {181224#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181225#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:13:36,520 INFO L290 TraceCheckUtils]: 19: Hoare triple {181225#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181226#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:13:36,520 INFO L290 TraceCheckUtils]: 20: Hoare triple {181226#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181227#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:13:36,521 INFO L290 TraceCheckUtils]: 21: Hoare triple {181227#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181228#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:13:36,521 INFO L290 TraceCheckUtils]: 22: Hoare triple {181228#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181229#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:13:36,522 INFO L290 TraceCheckUtils]: 23: Hoare triple {181229#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181230#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:13:36,522 INFO L290 TraceCheckUtils]: 24: Hoare triple {181230#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181231#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:13:36,522 INFO L290 TraceCheckUtils]: 25: Hoare triple {181231#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181232#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:13:36,523 INFO L290 TraceCheckUtils]: 26: Hoare triple {181232#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181233#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:13:36,523 INFO L290 TraceCheckUtils]: 27: Hoare triple {181233#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181234#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:13:36,524 INFO L290 TraceCheckUtils]: 28: Hoare triple {181234#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181235#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:13:36,524 INFO L290 TraceCheckUtils]: 29: Hoare triple {181235#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181236#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-08 10:13:36,525 INFO L290 TraceCheckUtils]: 30: Hoare triple {181236#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181237#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-08 10:13:36,525 INFO L290 TraceCheckUtils]: 31: Hoare triple {181237#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181238#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-08 10:13:36,525 INFO L290 TraceCheckUtils]: 32: Hoare triple {181238#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181239#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-08 10:13:36,526 INFO L290 TraceCheckUtils]: 33: Hoare triple {181239#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {181239#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-08 10:13:36,526 INFO L290 TraceCheckUtils]: 34: Hoare triple {181239#(and (<= main_~y~0 27) (<= 27 main_~y~0))} ~z~0 := ~y~0; {181347#(and (<= main_~z~0 27) (<= 27 main_~z~0))} is VALID [2022-04-08 10:13:36,526 INFO L290 TraceCheckUtils]: 35: Hoare triple {181347#(and (<= main_~z~0 27) (<= 27 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {181208#false} is VALID [2022-04-08 10:13:36,526 INFO L290 TraceCheckUtils]: 36: Hoare triple {181208#false} assume !(~y~0 % 4294967296 > 0); {181208#false} is VALID [2022-04-08 10:13:36,526 INFO L290 TraceCheckUtils]: 37: Hoare triple {181208#false} assume !(~x~0 % 4294967296 > 0); {181208#false} is VALID [2022-04-08 10:13:36,526 INFO L272 TraceCheckUtils]: 38: Hoare triple {181208#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {181208#false} is VALID [2022-04-08 10:13:36,526 INFO L290 TraceCheckUtils]: 39: Hoare triple {181208#false} ~cond := #in~cond; {181208#false} is VALID [2022-04-08 10:13:36,527 INFO L290 TraceCheckUtils]: 40: Hoare triple {181208#false} assume 0 == ~cond; {181208#false} is VALID [2022-04-08 10:13:36,527 INFO L290 TraceCheckUtils]: 41: Hoare triple {181208#false} assume !false; {181208#false} is VALID [2022-04-08 10:13:36,527 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:13:36,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:13:37,537 INFO L290 TraceCheckUtils]: 41: Hoare triple {181208#false} assume !false; {181208#false} is VALID [2022-04-08 10:13:37,537 INFO L290 TraceCheckUtils]: 40: Hoare triple {181208#false} assume 0 == ~cond; {181208#false} is VALID [2022-04-08 10:13:37,537 INFO L290 TraceCheckUtils]: 39: Hoare triple {181208#false} ~cond := #in~cond; {181208#false} is VALID [2022-04-08 10:13:37,537 INFO L272 TraceCheckUtils]: 38: Hoare triple {181208#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {181208#false} is VALID [2022-04-08 10:13:37,537 INFO L290 TraceCheckUtils]: 37: Hoare triple {181208#false} assume !(~x~0 % 4294967296 > 0); {181208#false} is VALID [2022-04-08 10:13:37,537 INFO L290 TraceCheckUtils]: 36: Hoare triple {181208#false} assume !(~y~0 % 4294967296 > 0); {181208#false} is VALID [2022-04-08 10:13:37,537 INFO L290 TraceCheckUtils]: 35: Hoare triple {181387#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {181208#false} is VALID [2022-04-08 10:13:37,537 INFO L290 TraceCheckUtils]: 34: Hoare triple {181391#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {181387#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:13:37,538 INFO L290 TraceCheckUtils]: 33: Hoare triple {181391#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {181391#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:13:37,538 INFO L290 TraceCheckUtils]: 32: Hoare triple {181398#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181391#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:13:37,539 INFO L290 TraceCheckUtils]: 31: Hoare triple {181402#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181398#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:13:37,539 INFO L290 TraceCheckUtils]: 30: Hoare triple {181406#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181402#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:13:37,540 INFO L290 TraceCheckUtils]: 29: Hoare triple {181410#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181406#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:13:37,540 INFO L290 TraceCheckUtils]: 28: Hoare triple {181414#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181410#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:13:37,541 INFO L290 TraceCheckUtils]: 27: Hoare triple {181418#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181414#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:13:37,541 INFO L290 TraceCheckUtils]: 26: Hoare triple {181422#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181418#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:13:37,542 INFO L290 TraceCheckUtils]: 25: Hoare triple {181426#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181422#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:13:37,542 INFO L290 TraceCheckUtils]: 24: Hoare triple {181430#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181426#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:13:37,543 INFO L290 TraceCheckUtils]: 23: Hoare triple {181434#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181430#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:13:37,543 INFO L290 TraceCheckUtils]: 22: Hoare triple {181438#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181434#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:13:37,544 INFO L290 TraceCheckUtils]: 21: Hoare triple {181442#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181438#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:13:37,545 INFO L290 TraceCheckUtils]: 20: Hoare triple {181446#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181442#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:13:37,545 INFO L290 TraceCheckUtils]: 19: Hoare triple {181450#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181446#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:13:37,546 INFO L290 TraceCheckUtils]: 18: Hoare triple {181454#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181450#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:13:37,546 INFO L290 TraceCheckUtils]: 17: Hoare triple {181458#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181454#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:13:37,547 INFO L290 TraceCheckUtils]: 16: Hoare triple {181462#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181458#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:13:37,547 INFO L290 TraceCheckUtils]: 15: Hoare triple {181466#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181462#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:13:37,548 INFO L290 TraceCheckUtils]: 14: Hoare triple {181470#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181466#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-08 10:13:37,548 INFO L290 TraceCheckUtils]: 13: Hoare triple {181474#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181470#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-08 10:13:37,549 INFO L290 TraceCheckUtils]: 12: Hoare triple {181478#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181474#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-08 10:13:37,549 INFO L290 TraceCheckUtils]: 11: Hoare triple {181482#(< 0 (mod (+ main_~y~0 22) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181478#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-08 10:13:37,550 INFO L290 TraceCheckUtils]: 10: Hoare triple {181486#(< 0 (mod (+ 23 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181482#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-08 10:13:37,550 INFO L290 TraceCheckUtils]: 9: Hoare triple {181490#(< 0 (mod (+ main_~y~0 24) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181486#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID [2022-04-08 10:13:37,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {181494#(< 0 (mod (+ main_~y~0 25) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181490#(< 0 (mod (+ main_~y~0 24) 4294967296))} is VALID [2022-04-08 10:13:37,551 INFO L290 TraceCheckUtils]: 7: Hoare triple {181498#(< 0 (mod (+ main_~y~0 26) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181494#(< 0 (mod (+ main_~y~0 25) 4294967296))} is VALID [2022-04-08 10:13:37,552 INFO L290 TraceCheckUtils]: 6: Hoare triple {181502#(< 0 (mod (+ main_~y~0 27) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {181498#(< 0 (mod (+ main_~y~0 26) 4294967296))} is VALID [2022-04-08 10:13:37,552 INFO L290 TraceCheckUtils]: 5: Hoare triple {181207#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {181502#(< 0 (mod (+ main_~y~0 27) 4294967296))} is VALID [2022-04-08 10:13:37,552 INFO L272 TraceCheckUtils]: 4: Hoare triple {181207#true} call #t~ret13 := main(); {181207#true} is VALID [2022-04-08 10:13:37,552 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {181207#true} {181207#true} #72#return; {181207#true} is VALID [2022-04-08 10:13:37,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {181207#true} assume true; {181207#true} is VALID [2022-04-08 10:13:37,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {181207#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {181207#true} is VALID [2022-04-08 10:13:37,552 INFO L272 TraceCheckUtils]: 0: Hoare triple {181207#true} call ULTIMATE.init(); {181207#true} is VALID [2022-04-08 10:13:37,553 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:13:37,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972011953] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:13:37,553 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:13:37,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 62 [2022-04-08 10:13:37,553 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:13:37,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1587922806] [2022-04-08 10:13:37,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1587922806] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:13:37,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:13:37,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-08 10:13:37,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760463879] [2022-04-08 10:13:37,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:13:37,553 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 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 42 [2022-04-08 10:13:37,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:13:37,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 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-08 10:13:37,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:13:37,571 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-08 10:13:37,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:13:37,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-08 10:13:37,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=907, Invalid=2875, Unknown=0, NotChecked=0, Total=3782 [2022-04-08 10:13:37,572 INFO L87 Difference]: Start difference. First operand 584 states and 797 transitions. Second operand has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 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-08 10:13:52,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:52,179 INFO L93 Difference]: Finished difference Result 1017 states and 1561 transitions. [2022-04-08 10:13:52,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-08 10:13:52,180 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 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 42 [2022-04-08 10:13:52,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:13:52,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 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-08 10:13:52,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 281 transitions. [2022-04-08 10:13:52,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 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-08 10:13:52,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 281 transitions. [2022-04-08 10:13:52,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 281 transitions. [2022-04-08 10:13:52,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 281 edges. 281 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:13:52,371 INFO L225 Difference]: With dead ends: 1017 [2022-04-08 10:13:52,371 INFO L226 Difference]: Without dead ends: 984 [2022-04-08 10:13:52,372 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1837, Invalid=6353, Unknown=0, NotChecked=0, Total=8190 [2022-04-08 10:13:52,372 INFO L913 BasicCegarLoop]: 127 mSDtfsCounter, 217 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 6524 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 6681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 6524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-04-08 10:13:52,372 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 274 Invalid, 6681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 6524 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-04-08 10:13:52,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2022-04-08 10:13:54,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 607. [2022-04-08 10:13:54,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:13:54,478 INFO L82 GeneralOperation]: Start isEquivalent. First operand 984 states. Second operand has 607 states, 602 states have (on average 1.3737541528239203) internal successors, (827), 602 states have internal predecessors, (827), 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-08 10:13:54,478 INFO L74 IsIncluded]: Start isIncluded. First operand 984 states. Second operand has 607 states, 602 states have (on average 1.3737541528239203) internal successors, (827), 602 states have internal predecessors, (827), 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-08 10:13:54,478 INFO L87 Difference]: Start difference. First operand 984 states. Second operand has 607 states, 602 states have (on average 1.3737541528239203) internal successors, (827), 602 states have internal predecessors, (827), 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-08 10:13:54,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:54,503 INFO L93 Difference]: Finished difference Result 984 states and 1236 transitions. [2022-04-08 10:13:54,503 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1236 transitions. [2022-04-08 10:13:54,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:13:54,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:13:54,504 INFO L74 IsIncluded]: Start isIncluded. First operand has 607 states, 602 states have (on average 1.3737541528239203) internal successors, (827), 602 states have internal predecessors, (827), 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 984 states. [2022-04-08 10:13:54,504 INFO L87 Difference]: Start difference. First operand has 607 states, 602 states have (on average 1.3737541528239203) internal successors, (827), 602 states have internal predecessors, (827), 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 984 states. [2022-04-08 10:13:54,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:13:54,528 INFO L93 Difference]: Finished difference Result 984 states and 1236 transitions. [2022-04-08 10:13:54,528 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1236 transitions. [2022-04-08 10:13:54,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:13:54,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:13:54,529 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:13:54,529 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:13:54,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 602 states have (on average 1.3737541528239203) internal successors, (827), 602 states have internal predecessors, (827), 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-08 10:13:54,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 831 transitions. [2022-04-08 10:13:54,542 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 831 transitions. Word has length 42 [2022-04-08 10:13:54,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:13:54,542 INFO L478 AbstractCegarLoop]: Abstraction has 607 states and 831 transitions. [2022-04-08 10:13:54,543 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 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-08 10:13:54,543 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 607 states and 831 transitions. [2022-04-08 10:13:59,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 831 edges. 831 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:13:59,304 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 831 transitions. [2022-04-08 10:13:59,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 10:13:59,305 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:13:59,305 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:13:59,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Forceful destruction successful, exit code 0 [2022-04-08 10:13:59,505 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 86 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable87 [2022-04-08 10:13:59,505 INFO L403 AbstractCegarLoop]: === Iteration 89 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:13:59,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:13:59,506 INFO L85 PathProgramCache]: Analyzing trace with hash -7434424, now seen corresponding path program 83 times [2022-04-08 10:13:59,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:13:59,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [403871882] [2022-04-08 10:13:59,508 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:13:59,508 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:13:59,508 INFO L85 PathProgramCache]: Analyzing trace with hash -7434424, now seen corresponding path program 84 times [2022-04-08 10:13:59,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:13:59,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106695654] [2022-04-08 10:13:59,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:13:59,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:13:59,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:00,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:14:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:00,315 INFO L290 TraceCheckUtils]: 0: Hoare triple {186822#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {186797#true} is VALID [2022-04-08 10:14:00,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {186797#true} assume true; {186797#true} is VALID [2022-04-08 10:14:00,315 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {186797#true} {186797#true} #72#return; {186797#true} is VALID [2022-04-08 10:14:00,316 INFO L272 TraceCheckUtils]: 0: Hoare triple {186797#true} call ULTIMATE.init(); {186822#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:14:00,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {186822#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {186797#true} is VALID [2022-04-08 10:14:00,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {186797#true} assume true; {186797#true} is VALID [2022-04-08 10:14:00,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {186797#true} {186797#true} #72#return; {186797#true} is VALID [2022-04-08 10:14:00,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {186797#true} call #t~ret13 := main(); {186797#true} is VALID [2022-04-08 10:14:00,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {186797#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {186802#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-08 10:14:00,317 INFO L290 TraceCheckUtils]: 6: Hoare triple {186802#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186803#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:14:00,320 INFO L290 TraceCheckUtils]: 7: Hoare triple {186803#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186804#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-08 10:14:00,329 INFO L290 TraceCheckUtils]: 8: Hoare triple {186804#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186805#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:14:00,597 INFO L290 TraceCheckUtils]: 9: Hoare triple {186805#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186806#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-08 10:14:00,609 INFO L290 TraceCheckUtils]: 10: Hoare triple {186806#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= (+ main_~x~0 4) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186807#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~y~0 5) (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-08 10:14:00,622 INFO L290 TraceCheckUtils]: 11: Hoare triple {186807#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~y~0 5) (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186808#(and (<= main_~y~0 6) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967289)) (<= (+ main_~x~0 6) main_~n~0))} is VALID [2022-04-08 10:14:00,623 INFO L290 TraceCheckUtils]: 12: Hoare triple {186808#(and (<= main_~y~0 6) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967289)) (<= (+ main_~x~0 6) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186809#(and (<= (+ 7 main_~x~0) main_~n~0) (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 main_~x~0)))} is VALID [2022-04-08 10:14:00,624 INFO L290 TraceCheckUtils]: 13: Hoare triple {186809#(and (<= (+ 7 main_~x~0) main_~n~0) (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 main_~x~0)))} assume !(~x~0 % 4294967296 > 0); {186810#(and (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} is VALID [2022-04-08 10:14:00,624 INFO L290 TraceCheckUtils]: 14: Hoare triple {186810#(and (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} ~z~0 := ~y~0; {186810#(and (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} is VALID [2022-04-08 10:14:00,625 INFO L290 TraceCheckUtils]: 15: Hoare triple {186810#(and (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {186811#(and (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))))} is VALID [2022-04-08 10:14:00,626 INFO L290 TraceCheckUtils]: 16: Hoare triple {186811#(and (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {186811#(and (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))))} is VALID [2022-04-08 10:14:00,626 INFO L290 TraceCheckUtils]: 17: Hoare triple {186811#(and (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {186811#(and (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))))} is VALID [2022-04-08 10:14:00,626 INFO L290 TraceCheckUtils]: 18: Hoare triple {186811#(and (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {186811#(and (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))))} is VALID [2022-04-08 10:14:00,627 INFO L290 TraceCheckUtils]: 19: Hoare triple {186811#(and (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {186811#(and (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))))} is VALID [2022-04-08 10:14:00,627 INFO L290 TraceCheckUtils]: 20: Hoare triple {186811#(and (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {186811#(and (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))))} is VALID [2022-04-08 10:14:00,628 INFO L290 TraceCheckUtils]: 21: Hoare triple {186811#(and (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {186811#(and (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))))} is VALID [2022-04-08 10:14:00,628 INFO L290 TraceCheckUtils]: 22: Hoare triple {186811#(and (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))))} assume !(~z~0 % 4294967296 > 0); {186811#(and (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))))} is VALID [2022-04-08 10:14:00,629 INFO L290 TraceCheckUtils]: 23: Hoare triple {186811#(and (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {186812#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)) 1)))} is VALID [2022-04-08 10:14:00,629 INFO L290 TraceCheckUtils]: 24: Hoare triple {186812#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {186813#(and (<= main_~n~0 (+ main_~y~0 2 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= main_~y~0 5))} is VALID [2022-04-08 10:14:00,630 INFO L290 TraceCheckUtils]: 25: Hoare triple {186813#(and (<= main_~n~0 (+ main_~y~0 2 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= main_~y~0 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {186814#(and (<= main_~n~0 (+ main_~y~0 3 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= main_~y~0 4))} is VALID [2022-04-08 10:14:00,631 INFO L290 TraceCheckUtils]: 26: Hoare triple {186814#(and (<= main_~n~0 (+ main_~y~0 3 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= main_~y~0 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {186815#(and (<= main_~n~0 (+ main_~y~0 4 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= main_~y~0 3))} is VALID [2022-04-08 10:14:00,631 INFO L290 TraceCheckUtils]: 27: Hoare triple {186815#(and (<= main_~n~0 (+ main_~y~0 4 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= main_~y~0 3))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {186816#(and (<= main_~n~0 (+ 5 main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= main_~y~0 2))} is VALID [2022-04-08 10:14:00,632 INFO L290 TraceCheckUtils]: 28: Hoare triple {186816#(and (<= main_~n~0 (+ 5 main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= main_~y~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {186817#(and (<= main_~n~0 (+ main_~y~0 6 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= main_~y~0 1))} is VALID [2022-04-08 10:14:00,632 INFO L290 TraceCheckUtils]: 29: Hoare triple {186817#(and (<= main_~n~0 (+ main_~y~0 6 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= main_~y~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {186818#(and (<= main_~n~0 (+ 7 main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= main_~y~0 0))} is VALID [2022-04-08 10:14:00,633 INFO L290 TraceCheckUtils]: 30: Hoare triple {186818#(and (<= main_~n~0 (+ 7 main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= main_~y~0 0))} assume !(~y~0 % 4294967296 > 0); {186818#(and (<= main_~n~0 (+ 7 main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= main_~y~0 0))} is VALID [2022-04-08 10:14:00,633 INFO L290 TraceCheckUtils]: 31: Hoare triple {186818#(and (<= main_~n~0 (+ 7 main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {186817#(and (<= main_~n~0 (+ main_~y~0 6 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= main_~y~0 1))} is VALID [2022-04-08 10:14:00,634 INFO L290 TraceCheckUtils]: 32: Hoare triple {186817#(and (<= main_~n~0 (+ main_~y~0 6 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {186816#(and (<= main_~n~0 (+ 5 main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= main_~y~0 2))} is VALID [2022-04-08 10:14:00,635 INFO L290 TraceCheckUtils]: 33: Hoare triple {186816#(and (<= main_~n~0 (+ 5 main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {186815#(and (<= main_~n~0 (+ main_~y~0 4 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= main_~y~0 3))} is VALID [2022-04-08 10:14:00,635 INFO L290 TraceCheckUtils]: 34: Hoare triple {186815#(and (<= main_~n~0 (+ main_~y~0 4 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= main_~y~0 3))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {186814#(and (<= main_~n~0 (+ main_~y~0 3 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= main_~y~0 4))} is VALID [2022-04-08 10:14:00,636 INFO L290 TraceCheckUtils]: 35: Hoare triple {186814#(and (<= main_~n~0 (+ main_~y~0 3 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= main_~y~0 4))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {186813#(and (<= main_~n~0 (+ main_~y~0 2 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= main_~y~0 5))} is VALID [2022-04-08 10:14:00,637 INFO L290 TraceCheckUtils]: 36: Hoare triple {186813#(and (<= main_~n~0 (+ main_~y~0 2 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {186812#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)) 1)))} is VALID [2022-04-08 10:14:00,638 INFO L290 TraceCheckUtils]: 37: Hoare triple {186812#(and (<= main_~y~0 6) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)) 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {186819#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (div main_~y~0 4294967296) 0) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:14:00,638 INFO L290 TraceCheckUtils]: 38: Hoare triple {186819#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (div main_~y~0 4294967296) 0) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {186819#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (div main_~y~0 4294967296) 0) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-08 10:14:00,639 INFO L272 TraceCheckUtils]: 39: Hoare triple {186819#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (div main_~y~0 4294967296) 0) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {186820#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:14:00,640 INFO L290 TraceCheckUtils]: 40: Hoare triple {186820#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {186821#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:14:00,640 INFO L290 TraceCheckUtils]: 41: Hoare triple {186821#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {186798#false} is VALID [2022-04-08 10:14:00,640 INFO L290 TraceCheckUtils]: 42: Hoare triple {186798#false} assume !false; {186798#false} is VALID [2022-04-08 10:14:00,640 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-08 10:14:00,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:14:00,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106695654] [2022-04-08 10:14:00,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106695654] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:14:00,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974668692] [2022-04-08 10:14:00,640 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:14:00,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:14:00,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:14:00,641 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:14:00,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2022-04-08 10:14:00,951 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 10:14:00,951 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:14:00,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 95 conjunts are in the unsatisfiable core [2022-04-08 10:14:00,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:00,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:14:02,752 INFO L272 TraceCheckUtils]: 0: Hoare triple {186797#true} call ULTIMATE.init(); {186797#true} is VALID [2022-04-08 10:14:02,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {186797#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {186797#true} is VALID [2022-04-08 10:14:02,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {186797#true} assume true; {186797#true} is VALID [2022-04-08 10:14:02,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {186797#true} {186797#true} #72#return; {186797#true} is VALID [2022-04-08 10:14:02,752 INFO L272 TraceCheckUtils]: 4: Hoare triple {186797#true} call #t~ret13 := main(); {186797#true} is VALID [2022-04-08 10:14:02,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {186797#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {186802#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-08 10:14:02,753 INFO L290 TraceCheckUtils]: 6: Hoare triple {186802#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186844#(and (= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0) (= main_~y~0 1))} is VALID [2022-04-08 10:14:02,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {186844#(and (= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0) (= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186848#(and (= main_~y~0 2) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} is VALID [2022-04-08 10:14:02,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {186848#(and (= main_~y~0 2) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186852#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 1)) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= main_~y~0 3))} is VALID [2022-04-08 10:14:02,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {186852#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 1)) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= main_~y~0 3))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186856#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 2)) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= main_~y~0 4))} is VALID [2022-04-08 10:14:02,756 INFO L290 TraceCheckUtils]: 10: Hoare triple {186856#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 2)) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= main_~y~0 4))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186860#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ main_~x~0 1) (+ main_~n~0 (- 4))) (= (+ (- 1) main_~y~0) 4))} is VALID [2022-04-08 10:14:02,756 INFO L290 TraceCheckUtils]: 11: Hoare triple {186860#(and (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ main_~x~0 1) (+ main_~n~0 (- 4))) (= (+ (- 1) main_~y~0) 4))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186864#(and (= main_~y~0 6) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ main_~x~0 2) (+ main_~n~0 (- 4))))} is VALID [2022-04-08 10:14:02,757 INFO L290 TraceCheckUtils]: 12: Hoare triple {186864#(and (= main_~y~0 6) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ main_~x~0 2) (+ main_~n~0 (- 4))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186868#(and (= (+ main_~x~0 1) (+ main_~n~0 (- 6))) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= 6 (+ (- 1) main_~y~0)))} is VALID [2022-04-08 10:14:02,757 INFO L290 TraceCheckUtils]: 13: Hoare triple {186868#(and (= (+ main_~x~0 1) (+ main_~n~0 (- 6))) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= 6 (+ (- 1) main_~y~0)))} assume !(~x~0 % 4294967296 > 0); {186872#(and (= 7 main_~y~0) (= (+ 7 main_~x~0) main_~n~0) (<= (mod main_~x~0 4294967296) 0))} is VALID [2022-04-08 10:14:02,758 INFO L290 TraceCheckUtils]: 14: Hoare triple {186872#(and (= 7 main_~y~0) (= (+ 7 main_~x~0) main_~n~0) (<= (mod main_~x~0 4294967296) 0))} ~z~0 := ~y~0; {186872#(and (= 7 main_~y~0) (= (+ 7 main_~x~0) main_~n~0) (<= (mod main_~x~0 4294967296) 0))} is VALID [2022-04-08 10:14:02,758 INFO L290 TraceCheckUtils]: 15: Hoare triple {186872#(and (= 7 main_~y~0) (= (+ 7 main_~x~0) main_~n~0) (<= (mod main_~x~0 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {186879#(and (= 7 main_~y~0) (= main_~n~0 (+ main_~x~0 6)) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0))} is VALID [2022-04-08 10:14:02,759 INFO L290 TraceCheckUtils]: 16: Hoare triple {186879#(and (= 7 main_~y~0) (= main_~n~0 (+ main_~x~0 6)) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {186883#(and (= main_~x~0 (+ main_~n~0 (- 5))) (= 7 main_~y~0) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0))} is VALID [2022-04-08 10:14:02,760 INFO L290 TraceCheckUtils]: 17: Hoare triple {186883#(and (= main_~x~0 (+ main_~n~0 (- 5))) (= 7 main_~y~0) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {186887#(and (= 7 main_~y~0) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= main_~x~0 (+ main_~n~0 (- 4))))} is VALID [2022-04-08 10:14:02,760 INFO L290 TraceCheckUtils]: 18: Hoare triple {186887#(and (= 7 main_~y~0) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= main_~x~0 (+ main_~n~0 (- 4))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {186891#(and (= 7 main_~y~0) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ main_~n~0 (- 3)) main_~x~0))} is VALID [2022-04-08 10:14:02,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {186891#(and (= 7 main_~y~0) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ main_~n~0 (- 3)) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {186895#(and (= 7 main_~y~0) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) main_~x~0))} is VALID [2022-04-08 10:14:02,762 INFO L290 TraceCheckUtils]: 20: Hoare triple {186895#(and (= 7 main_~y~0) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {186899#(and (= 7 main_~y~0) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 1) main_~x~0)))} is VALID [2022-04-08 10:14:02,762 INFO L290 TraceCheckUtils]: 21: Hoare triple {186899#(and (= 7 main_~y~0) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 1) main_~x~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {186903#(and (= 7 main_~y~0) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)))} is VALID [2022-04-08 10:14:02,763 INFO L290 TraceCheckUtils]: 22: Hoare triple {186903#(and (= 7 main_~y~0) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)))} assume !(~z~0 % 4294967296 > 0); {186903#(and (= 7 main_~y~0) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)))} is VALID [2022-04-08 10:14:02,763 INFO L290 TraceCheckUtils]: 23: Hoare triple {186903#(and (= 7 main_~y~0) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {186910#(and (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= 7 (+ main_~y~0 1)))} is VALID [2022-04-08 10:14:02,763 INFO L290 TraceCheckUtils]: 24: Hoare triple {186910#(and (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= 7 (+ main_~y~0 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {186914#(and (= 7 (+ main_~y~0 2)) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)))} is VALID [2022-04-08 10:14:02,764 INFO L290 TraceCheckUtils]: 25: Hoare triple {186914#(and (= 7 (+ main_~y~0 2)) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {186918#(and (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= 5 (+ main_~y~0 1)))} is VALID [2022-04-08 10:14:02,764 INFO L290 TraceCheckUtils]: 26: Hoare triple {186918#(and (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= 5 (+ main_~y~0 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {186922#(and (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= 4 (+ main_~y~0 1)))} is VALID [2022-04-08 10:14:02,765 INFO L290 TraceCheckUtils]: 27: Hoare triple {186922#(and (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= 4 (+ main_~y~0 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {186926#(and (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= 3 (+ main_~y~0 1)))} is VALID [2022-04-08 10:14:02,765 INFO L290 TraceCheckUtils]: 28: Hoare triple {186926#(and (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)) (= 3 (+ main_~y~0 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {186930#(and (= (+ main_~y~0 2) 3) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)))} is VALID [2022-04-08 10:14:02,766 INFO L290 TraceCheckUtils]: 29: Hoare triple {186930#(and (= (+ main_~y~0 2) 3) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {186934#(and (= 3 (+ main_~y~0 3)) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)))} is VALID [2022-04-08 10:14:02,766 INFO L290 TraceCheckUtils]: 30: Hoare triple {186934#(and (= 3 (+ main_~y~0 3)) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)))} assume !(~y~0 % 4294967296 > 0); {186934#(and (= 3 (+ main_~y~0 3)) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)))} is VALID [2022-04-08 10:14:02,767 INFO L290 TraceCheckUtils]: 31: Hoare triple {186934#(and (= 3 (+ main_~y~0 3)) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 2) main_~x~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {186941#(and (= main_~y~0 1) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 1) main_~x~0)))} is VALID [2022-04-08 10:14:02,767 INFO L290 TraceCheckUtils]: 32: Hoare triple {186941#(and (= main_~y~0 1) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ (- 2) main_~n~0) (+ (- 1) main_~x~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {186945#(and (= (+ (- 1) main_~y~0) 1) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} is VALID [2022-04-08 10:14:02,768 INFO L290 TraceCheckUtils]: 33: Hoare triple {186945#(and (= (+ (- 1) main_~y~0) 1) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {186949#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~n~0) (+ main_~x~0 2)) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0))} is VALID [2022-04-08 10:14:02,768 INFO L290 TraceCheckUtils]: 34: Hoare triple {186949#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~n~0) (+ main_~x~0 2)) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {186953#(and (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= main_~y~0 4) (= (+ main_~x~0 4) main_~n~0))} is VALID [2022-04-08 10:14:02,769 INFO L290 TraceCheckUtils]: 35: Hoare triple {186953#(and (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= main_~y~0 4) (= (+ main_~x~0 4) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {186957#(and (= (+ main_~x~0 1) (+ main_~n~0 (- 4))) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= 5 main_~y~0))} is VALID [2022-04-08 10:14:02,770 INFO L290 TraceCheckUtils]: 36: Hoare triple {186957#(and (= (+ main_~x~0 1) (+ main_~n~0 (- 4))) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= 5 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {186961#(and (= main_~y~0 6) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ main_~x~0 2) (+ main_~n~0 (- 4))))} is VALID [2022-04-08 10:14:02,771 INFO L290 TraceCheckUtils]: 37: Hoare triple {186961#(and (= main_~y~0 6) (<= (mod (+ main_~n~0 4294967289) 4294967296) 0) (= (+ main_~x~0 2) (+ main_~n~0 (- 4))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {186872#(and (= 7 main_~y~0) (= (+ 7 main_~x~0) main_~n~0) (<= (mod main_~x~0 4294967296) 0))} is VALID [2022-04-08 10:14:02,771 INFO L290 TraceCheckUtils]: 38: Hoare triple {186872#(and (= 7 main_~y~0) (= (+ 7 main_~x~0) main_~n~0) (<= (mod main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {186811#(and (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))))} is VALID [2022-04-08 10:14:02,773 INFO L272 TraceCheckUtils]: 39: Hoare triple {186811#(and (<= main_~y~0 7) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div (+ main_~n~0 (- 7)) 4294967296)))))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {186971#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:14:02,773 INFO L290 TraceCheckUtils]: 40: Hoare triple {186971#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {186975#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:14:02,773 INFO L290 TraceCheckUtils]: 41: Hoare triple {186975#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {186798#false} is VALID [2022-04-08 10:14:02,773 INFO L290 TraceCheckUtils]: 42: Hoare triple {186798#false} assume !false; {186798#false} is VALID [2022-04-08 10:14:02,774 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:14:02,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:14:06,650 INFO L290 TraceCheckUtils]: 42: Hoare triple {186798#false} assume !false; {186798#false} is VALID [2022-04-08 10:14:06,650 INFO L290 TraceCheckUtils]: 41: Hoare triple {186975#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {186798#false} is VALID [2022-04-08 10:14:06,651 INFO L290 TraceCheckUtils]: 40: Hoare triple {186971#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {186975#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:14:06,651 INFO L272 TraceCheckUtils]: 39: Hoare triple {186991#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {186971#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:14:06,651 INFO L290 TraceCheckUtils]: 38: Hoare triple {186995#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {186991#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:14:06,653 INFO L290 TraceCheckUtils]: 37: Hoare triple {186999#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {186995#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:14:06,654 INFO L290 TraceCheckUtils]: 36: Hoare triple {187003#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {186999#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-08 10:14:06,655 INFO L290 TraceCheckUtils]: 35: Hoare triple {187007#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {187003#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296)))} is VALID [2022-04-08 10:14:06,656 INFO L290 TraceCheckUtils]: 34: Hoare triple {187011#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 4) 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {187007#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:14:06,657 INFO L290 TraceCheckUtils]: 33: Hoare triple {187015#(or (= (mod main_~n~0 4294967296) (mod (+ 5 main_~y~0) 4294967296)) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {187011#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 4) 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:14:06,658 INFO L290 TraceCheckUtils]: 32: Hoare triple {187019#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 6) 4294967296)) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {187015#(or (= (mod main_~n~0 4294967296) (mod (+ 5 main_~y~0) 4294967296)) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:14:06,659 INFO L290 TraceCheckUtils]: 31: Hoare triple {187023#(or (= (mod main_~n~0 4294967296) (mod (+ 7 main_~y~0) 4294967296)) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {187019#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 6) 4294967296)) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:14:06,659 INFO L290 TraceCheckUtils]: 30: Hoare triple {187023#(or (= (mod main_~n~0 4294967296) (mod (+ 7 main_~y~0) 4294967296)) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {187023#(or (= (mod main_~n~0 4294967296) (mod (+ 7 main_~y~0) 4294967296)) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} is VALID [2022-04-08 10:14:06,660 INFO L290 TraceCheckUtils]: 29: Hoare triple {187030#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 6) 4294967296)) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {187023#(or (= (mod main_~n~0 4294967296) (mod (+ 7 main_~y~0) 4294967296)) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} is VALID [2022-04-08 10:14:06,661 INFO L290 TraceCheckUtils]: 28: Hoare triple {187034#(or (= (mod main_~n~0 4294967296) (mod (+ 5 main_~y~0) 4294967296)) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {187030#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 6) 4294967296)) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} is VALID [2022-04-08 10:14:06,664 INFO L290 TraceCheckUtils]: 27: Hoare triple {187038#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 4) 4294967296)) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {187034#(or (= (mod main_~n~0 4294967296) (mod (+ 5 main_~y~0) 4294967296)) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} is VALID [2022-04-08 10:14:06,665 INFO L290 TraceCheckUtils]: 26: Hoare triple {187042#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {187038#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 4) 4294967296)) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} is VALID [2022-04-08 10:14:06,667 INFO L290 TraceCheckUtils]: 25: Hoare triple {187046#(or (< 0 (mod (+ main_~x~0 4294967289) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {187042#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} is VALID [2022-04-08 10:14:06,668 INFO L290 TraceCheckUtils]: 24: Hoare triple {187050#(or (< 0 (mod (+ main_~x~0 4294967289) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {187046#(or (< 0 (mod (+ main_~x~0 4294967289) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296)))} is VALID [2022-04-08 10:14:06,669 INFO L290 TraceCheckUtils]: 23: Hoare triple {187054#(or (< 0 (mod (+ main_~x~0 4294967289) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {187050#(or (< 0 (mod (+ main_~x~0 4294967289) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-08 10:14:06,669 INFO L290 TraceCheckUtils]: 22: Hoare triple {187054#(or (< 0 (mod (+ main_~x~0 4294967289) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {187054#(or (< 0 (mod (+ main_~x~0 4294967289) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:14:06,670 INFO L290 TraceCheckUtils]: 21: Hoare triple {187061#(or (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {187054#(or (< 0 (mod (+ main_~x~0 4294967289) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:14:06,670 INFO L290 TraceCheckUtils]: 20: Hoare triple {187065#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {187061#(or (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:14:06,671 INFO L290 TraceCheckUtils]: 19: Hoare triple {187069#(or (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {187065#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:14:06,672 INFO L290 TraceCheckUtils]: 18: Hoare triple {187073#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {187069#(or (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:14:06,673 INFO L290 TraceCheckUtils]: 17: Hoare triple {187077#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {187073#(or (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:14:06,673 INFO L290 TraceCheckUtils]: 16: Hoare triple {187081#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {187077#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:14:06,674 INFO L290 TraceCheckUtils]: 15: Hoare triple {186995#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {187081#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:14:06,675 INFO L290 TraceCheckUtils]: 14: Hoare triple {186995#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} ~z~0 := ~y~0; {186995#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:14:06,675 INFO L290 TraceCheckUtils]: 13: Hoare triple {186995#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {186995#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:14:06,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {186999#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186995#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-08 10:14:06,677 INFO L290 TraceCheckUtils]: 11: Hoare triple {187003#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {186999#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-08 10:14:06,678 INFO L290 TraceCheckUtils]: 10: Hoare triple {187007#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187003#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296)))} is VALID [2022-04-08 10:14:06,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {187011#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 4) 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187007#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-08 10:14:06,680 INFO L290 TraceCheckUtils]: 8: Hoare triple {187015#(or (= (mod main_~n~0 4294967296) (mod (+ 5 main_~y~0) 4294967296)) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187011#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 4) 4294967296)) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:14:06,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {187019#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 6) 4294967296)) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187015#(or (= (mod main_~n~0 4294967296) (mod (+ 5 main_~y~0) 4294967296)) (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:14:06,683 INFO L290 TraceCheckUtils]: 6: Hoare triple {187023#(or (= (mod main_~n~0 4294967296) (mod (+ 7 main_~y~0) 4294967296)) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {187019#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 6) 4294967296)) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID [2022-04-08 10:14:06,683 INFO L290 TraceCheckUtils]: 5: Hoare triple {186797#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {187023#(or (= (mod main_~n~0 4294967296) (mod (+ 7 main_~y~0) 4294967296)) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} is VALID [2022-04-08 10:14:06,683 INFO L272 TraceCheckUtils]: 4: Hoare triple {186797#true} call #t~ret13 := main(); {186797#true} is VALID [2022-04-08 10:14:06,683 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {186797#true} {186797#true} #72#return; {186797#true} is VALID [2022-04-08 10:14:06,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {186797#true} assume true; {186797#true} is VALID [2022-04-08 10:14:06,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {186797#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {186797#true} is VALID [2022-04-08 10:14:06,684 INFO L272 TraceCheckUtils]: 0: Hoare triple {186797#true} call ULTIMATE.init(); {186797#true} is VALID [2022-04-08 10:14:06,684 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:14:06,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974668692] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:14:06,684 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:14:06,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 34, 26] total 75 [2022-04-08 10:14:06,684 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:14:06,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [403871882] [2022-04-08 10:14:06,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [403871882] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:14:06,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:14:06,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-08 10:14:06,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707125521] [2022-04-08 10:14:06,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:14:06,685 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 21 states have internal predecessors, (34), 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 43 [2022-04-08 10:14:06,685 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:14:06,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 21 states have internal predecessors, (34), 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-08 10:14:06,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:14:06,952 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-08 10:14:06,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:14:06,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-08 10:14:06,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=760, Invalid=4790, Unknown=0, NotChecked=0, Total=5550 [2022-04-08 10:14:06,952 INFO L87 Difference]: Start difference. First operand 607 states and 831 transitions. Second operand has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 21 states have internal predecessors, (34), 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-08 10:14:13,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:14:13,641 INFO L93 Difference]: Finished difference Result 628 states and 852 transitions. [2022-04-08 10:14:13,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-08 10:14:13,641 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 21 states have internal predecessors, (34), 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 43 [2022-04-08 10:14:13,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:14:13,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 21 states have internal predecessors, (34), 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-08 10:14:13,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 54 transitions. [2022-04-08 10:14:13,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 21 states have internal predecessors, (34), 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-08 10:14:13,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 54 transitions. [2022-04-08 10:14:13,642 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 54 transitions. [2022-04-08 10:14:13,809 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:14:13,823 INFO L225 Difference]: With dead ends: 628 [2022-04-08 10:14:13,823 INFO L226 Difference]: Without dead ends: 623 [2022-04-08 10:14:13,823 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2257 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=977, Invalid=7953, Unknown=0, NotChecked=0, Total=8930 [2022-04-08 10:14:13,823 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 26 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:14:13,823 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 108 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-08 10:14:13,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2022-04-08 10:14:16,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 607. [2022-04-08 10:14:16,207 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:14:16,208 INFO L82 GeneralOperation]: Start isEquivalent. First operand 623 states. Second operand has 607 states, 602 states have (on average 1.3737541528239203) internal successors, (827), 602 states have internal predecessors, (827), 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-08 10:14:16,208 INFO L74 IsIncluded]: Start isIncluded. First operand 623 states. Second operand has 607 states, 602 states have (on average 1.3737541528239203) internal successors, (827), 602 states have internal predecessors, (827), 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-08 10:14:16,209 INFO L87 Difference]: Start difference. First operand 623 states. Second operand has 607 states, 602 states have (on average 1.3737541528239203) internal successors, (827), 602 states have internal predecessors, (827), 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-08 10:14:16,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:14:16,220 INFO L93 Difference]: Finished difference Result 623 states and 847 transitions. [2022-04-08 10:14:16,220 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 847 transitions. [2022-04-08 10:14:16,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:14:16,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:14:16,221 INFO L74 IsIncluded]: Start isIncluded. First operand has 607 states, 602 states have (on average 1.3737541528239203) internal successors, (827), 602 states have internal predecessors, (827), 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 623 states. [2022-04-08 10:14:16,221 INFO L87 Difference]: Start difference. First operand has 607 states, 602 states have (on average 1.3737541528239203) internal successors, (827), 602 states have internal predecessors, (827), 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 623 states. [2022-04-08 10:14:16,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:14:16,231 INFO L93 Difference]: Finished difference Result 623 states and 847 transitions. [2022-04-08 10:14:16,231 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 847 transitions. [2022-04-08 10:14:16,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:14:16,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:14:16,232 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:14:16,232 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:14:16,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 602 states have (on average 1.3737541528239203) internal successors, (827), 602 states have internal predecessors, (827), 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-08 10:14:16,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 831 transitions. [2022-04-08 10:14:16,245 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 831 transitions. Word has length 43 [2022-04-08 10:14:16,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:14:16,245 INFO L478 AbstractCegarLoop]: Abstraction has 607 states and 831 transitions. [2022-04-08 10:14:16,245 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 21 states have internal predecessors, (34), 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-08 10:14:16,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 607 states and 831 transitions. [2022-04-08 10:14:21,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 831 edges. 831 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:14:21,753 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 831 transitions. [2022-04-08 10:14:21,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 10:14:21,753 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:14:21,754 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:14:21,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Forceful destruction successful, exit code 0 [2022-04-08 10:14:21,958 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88,87 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:14:21,958 INFO L403 AbstractCegarLoop]: === Iteration 90 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:14:21,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:14:21,958 INFO L85 PathProgramCache]: Analyzing trace with hash 878062920, now seen corresponding path program 85 times [2022-04-08 10:14:21,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:14:21,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2119820226] [2022-04-08 10:14:21,960 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:14:21,960 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:14:21,960 INFO L85 PathProgramCache]: Analyzing trace with hash 878062920, now seen corresponding path program 86 times [2022-04-08 10:14:21,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:14:21,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078429941] [2022-04-08 10:14:21,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:14:21,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:14:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:22,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:14:22,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:22,175 INFO L290 TraceCheckUtils]: 0: Hoare triple {190909#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {190888#true} is VALID [2022-04-08 10:14:22,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {190888#true} assume true; {190888#true} is VALID [2022-04-08 10:14:22,175 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {190888#true} {190888#true} #72#return; {190888#true} is VALID [2022-04-08 10:14:22,175 INFO L272 TraceCheckUtils]: 0: Hoare triple {190888#true} call ULTIMATE.init(); {190909#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:14:22,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {190909#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {190888#true} is VALID [2022-04-08 10:14:22,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {190888#true} assume true; {190888#true} is VALID [2022-04-08 10:14:22,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {190888#true} {190888#true} #72#return; {190888#true} is VALID [2022-04-08 10:14:22,176 INFO L272 TraceCheckUtils]: 4: Hoare triple {190888#true} call #t~ret13 := main(); {190888#true} is VALID [2022-04-08 10:14:22,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {190888#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {190893#(= main_~y~0 0)} is VALID [2022-04-08 10:14:22,176 INFO L290 TraceCheckUtils]: 6: Hoare triple {190893#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {190894#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:14:22,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {190894#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {190895#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:14:22,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {190895#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {190896#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:14:22,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {190896#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {190897#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:14:22,178 INFO L290 TraceCheckUtils]: 10: Hoare triple {190897#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {190898#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:14:22,179 INFO L290 TraceCheckUtils]: 11: Hoare triple {190898#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {190899#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:14:22,179 INFO L290 TraceCheckUtils]: 12: Hoare triple {190899#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {190900#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:14:22,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {190900#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {190901#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:14:22,180 INFO L290 TraceCheckUtils]: 14: Hoare triple {190901#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {190902#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:14:22,181 INFO L290 TraceCheckUtils]: 15: Hoare triple {190902#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {190902#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:14:22,181 INFO L290 TraceCheckUtils]: 16: Hoare triple {190902#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {190903#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:14:22,181 INFO L290 TraceCheckUtils]: 17: Hoare triple {190903#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {190904#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:14:22,182 INFO L290 TraceCheckUtils]: 18: Hoare triple {190904#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {190905#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:14:22,182 INFO L290 TraceCheckUtils]: 19: Hoare triple {190905#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {190906#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:14:22,183 INFO L290 TraceCheckUtils]: 20: Hoare triple {190906#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {190907#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:14:22,184 INFO L290 TraceCheckUtils]: 21: Hoare triple {190907#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {190908#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:14:22,184 INFO L290 TraceCheckUtils]: 22: Hoare triple {190908#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {190889#false} is VALID [2022-04-08 10:14:22,184 INFO L290 TraceCheckUtils]: 23: Hoare triple {190889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {190889#false} is VALID [2022-04-08 10:14:22,184 INFO L290 TraceCheckUtils]: 24: Hoare triple {190889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {190889#false} is VALID [2022-04-08 10:14:22,184 INFO L290 TraceCheckUtils]: 25: Hoare triple {190889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {190889#false} is VALID [2022-04-08 10:14:22,184 INFO L290 TraceCheckUtils]: 26: Hoare triple {190889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {190889#false} is VALID [2022-04-08 10:14:22,184 INFO L290 TraceCheckUtils]: 27: Hoare triple {190889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {190889#false} is VALID [2022-04-08 10:14:22,184 INFO L290 TraceCheckUtils]: 28: Hoare triple {190889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {190889#false} is VALID [2022-04-08 10:14:22,184 INFO L290 TraceCheckUtils]: 29: Hoare triple {190889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {190889#false} is VALID [2022-04-08 10:14:22,184 INFO L290 TraceCheckUtils]: 30: Hoare triple {190889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {190889#false} is VALID [2022-04-08 10:14:22,184 INFO L290 TraceCheckUtils]: 31: Hoare triple {190889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {190889#false} is VALID [2022-04-08 10:14:22,184 INFO L290 TraceCheckUtils]: 32: Hoare triple {190889#false} assume !(~y~0 % 4294967296 > 0); {190889#false} is VALID [2022-04-08 10:14:22,184 INFO L290 TraceCheckUtils]: 33: Hoare triple {190889#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {190889#false} is VALID [2022-04-08 10:14:22,185 INFO L290 TraceCheckUtils]: 34: Hoare triple {190889#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {190889#false} is VALID [2022-04-08 10:14:22,185 INFO L290 TraceCheckUtils]: 35: Hoare triple {190889#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {190889#false} is VALID [2022-04-08 10:14:22,185 INFO L290 TraceCheckUtils]: 36: Hoare triple {190889#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {190889#false} is VALID [2022-04-08 10:14:22,185 INFO L290 TraceCheckUtils]: 37: Hoare triple {190889#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {190889#false} is VALID [2022-04-08 10:14:22,185 INFO L290 TraceCheckUtils]: 38: Hoare triple {190889#false} assume !(~x~0 % 4294967296 > 0); {190889#false} is VALID [2022-04-08 10:14:22,185 INFO L272 TraceCheckUtils]: 39: Hoare triple {190889#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {190889#false} is VALID [2022-04-08 10:14:22,185 INFO L290 TraceCheckUtils]: 40: Hoare triple {190889#false} ~cond := #in~cond; {190889#false} is VALID [2022-04-08 10:14:22,185 INFO L290 TraceCheckUtils]: 41: Hoare triple {190889#false} assume 0 == ~cond; {190889#false} is VALID [2022-04-08 10:14:22,185 INFO L290 TraceCheckUtils]: 42: Hoare triple {190889#false} assume !false; {190889#false} is VALID [2022-04-08 10:14:22,185 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-08 10:14:22,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:14:22,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078429941] [2022-04-08 10:14:22,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078429941] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:14:22,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283807213] [2022-04-08 10:14:22,185 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:14:22,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:14:22,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:14:22,186 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:14:22,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2022-04-08 10:14:22,253 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:14:22,253 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:14:22,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 10:14:22,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:22,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:14:22,483 INFO L272 TraceCheckUtils]: 0: Hoare triple {190888#true} call ULTIMATE.init(); {190888#true} is VALID [2022-04-08 10:14:22,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {190888#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {190888#true} is VALID [2022-04-08 10:14:22,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {190888#true} assume true; {190888#true} is VALID [2022-04-08 10:14:22,484 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {190888#true} {190888#true} #72#return; {190888#true} is VALID [2022-04-08 10:14:22,484 INFO L272 TraceCheckUtils]: 4: Hoare triple {190888#true} call #t~ret13 := main(); {190888#true} is VALID [2022-04-08 10:14:22,484 INFO L290 TraceCheckUtils]: 5: Hoare triple {190888#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {190893#(= main_~y~0 0)} is VALID [2022-04-08 10:14:22,484 INFO L290 TraceCheckUtils]: 6: Hoare triple {190893#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {190894#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:14:22,485 INFO L290 TraceCheckUtils]: 7: Hoare triple {190894#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {190895#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:14:22,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {190895#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {190896#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:14:22,486 INFO L290 TraceCheckUtils]: 9: Hoare triple {190896#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {190897#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:14:22,486 INFO L290 TraceCheckUtils]: 10: Hoare triple {190897#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {190898#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:14:22,487 INFO L290 TraceCheckUtils]: 11: Hoare triple {190898#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {190899#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:14:22,487 INFO L290 TraceCheckUtils]: 12: Hoare triple {190899#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {190900#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:14:22,488 INFO L290 TraceCheckUtils]: 13: Hoare triple {190900#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {190901#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:14:22,488 INFO L290 TraceCheckUtils]: 14: Hoare triple {190901#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {190902#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:14:22,488 INFO L290 TraceCheckUtils]: 15: Hoare triple {190902#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {190902#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:14:22,489 INFO L290 TraceCheckUtils]: 16: Hoare triple {190902#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {190903#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:14:22,489 INFO L290 TraceCheckUtils]: 17: Hoare triple {190903#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {190904#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:14:22,489 INFO L290 TraceCheckUtils]: 18: Hoare triple {190904#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {190905#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:14:22,490 INFO L290 TraceCheckUtils]: 19: Hoare triple {190905#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {190906#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:14:22,490 INFO L290 TraceCheckUtils]: 20: Hoare triple {190906#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {190907#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:14:22,491 INFO L290 TraceCheckUtils]: 21: Hoare triple {190907#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {190976#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:14:22,491 INFO L290 TraceCheckUtils]: 22: Hoare triple {190976#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {190889#false} is VALID [2022-04-08 10:14:22,491 INFO L290 TraceCheckUtils]: 23: Hoare triple {190889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {190889#false} is VALID [2022-04-08 10:14:22,491 INFO L290 TraceCheckUtils]: 24: Hoare triple {190889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {190889#false} is VALID [2022-04-08 10:14:22,491 INFO L290 TraceCheckUtils]: 25: Hoare triple {190889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {190889#false} is VALID [2022-04-08 10:14:22,491 INFO L290 TraceCheckUtils]: 26: Hoare triple {190889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {190889#false} is VALID [2022-04-08 10:14:22,491 INFO L290 TraceCheckUtils]: 27: Hoare triple {190889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {190889#false} is VALID [2022-04-08 10:14:22,491 INFO L290 TraceCheckUtils]: 28: Hoare triple {190889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {190889#false} is VALID [2022-04-08 10:14:22,491 INFO L290 TraceCheckUtils]: 29: Hoare triple {190889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {190889#false} is VALID [2022-04-08 10:14:22,491 INFO L290 TraceCheckUtils]: 30: Hoare triple {190889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {190889#false} is VALID [2022-04-08 10:14:22,492 INFO L290 TraceCheckUtils]: 31: Hoare triple {190889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {190889#false} is VALID [2022-04-08 10:14:22,492 INFO L290 TraceCheckUtils]: 32: Hoare triple {190889#false} assume !(~y~0 % 4294967296 > 0); {190889#false} is VALID [2022-04-08 10:14:22,492 INFO L290 TraceCheckUtils]: 33: Hoare triple {190889#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {190889#false} is VALID [2022-04-08 10:14:22,492 INFO L290 TraceCheckUtils]: 34: Hoare triple {190889#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {190889#false} is VALID [2022-04-08 10:14:22,492 INFO L290 TraceCheckUtils]: 35: Hoare triple {190889#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {190889#false} is VALID [2022-04-08 10:14:22,492 INFO L290 TraceCheckUtils]: 36: Hoare triple {190889#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {190889#false} is VALID [2022-04-08 10:14:22,492 INFO L290 TraceCheckUtils]: 37: Hoare triple {190889#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {190889#false} is VALID [2022-04-08 10:14:22,492 INFO L290 TraceCheckUtils]: 38: Hoare triple {190889#false} assume !(~x~0 % 4294967296 > 0); {190889#false} is VALID [2022-04-08 10:14:22,492 INFO L272 TraceCheckUtils]: 39: Hoare triple {190889#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {190889#false} is VALID [2022-04-08 10:14:22,492 INFO L290 TraceCheckUtils]: 40: Hoare triple {190889#false} ~cond := #in~cond; {190889#false} is VALID [2022-04-08 10:14:22,492 INFO L290 TraceCheckUtils]: 41: Hoare triple {190889#false} assume 0 == ~cond; {190889#false} is VALID [2022-04-08 10:14:22,492 INFO L290 TraceCheckUtils]: 42: Hoare triple {190889#false} assume !false; {190889#false} is VALID [2022-04-08 10:14:22,492 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-08 10:14:22,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:14:22,871 INFO L290 TraceCheckUtils]: 42: Hoare triple {190889#false} assume !false; {190889#false} is VALID [2022-04-08 10:14:22,871 INFO L290 TraceCheckUtils]: 41: Hoare triple {190889#false} assume 0 == ~cond; {190889#false} is VALID [2022-04-08 10:14:22,871 INFO L290 TraceCheckUtils]: 40: Hoare triple {190889#false} ~cond := #in~cond; {190889#false} is VALID [2022-04-08 10:14:22,871 INFO L272 TraceCheckUtils]: 39: Hoare triple {190889#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {190889#false} is VALID [2022-04-08 10:14:22,871 INFO L290 TraceCheckUtils]: 38: Hoare triple {190889#false} assume !(~x~0 % 4294967296 > 0); {190889#false} is VALID [2022-04-08 10:14:22,871 INFO L290 TraceCheckUtils]: 37: Hoare triple {190889#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {190889#false} is VALID [2022-04-08 10:14:22,871 INFO L290 TraceCheckUtils]: 36: Hoare triple {190889#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {190889#false} is VALID [2022-04-08 10:14:22,871 INFO L290 TraceCheckUtils]: 35: Hoare triple {190889#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {190889#false} is VALID [2022-04-08 10:14:22,871 INFO L290 TraceCheckUtils]: 34: Hoare triple {190889#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {190889#false} is VALID [2022-04-08 10:14:22,871 INFO L290 TraceCheckUtils]: 33: Hoare triple {190889#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {190889#false} is VALID [2022-04-08 10:14:22,871 INFO L290 TraceCheckUtils]: 32: Hoare triple {190889#false} assume !(~y~0 % 4294967296 > 0); {190889#false} is VALID [2022-04-08 10:14:22,871 INFO L290 TraceCheckUtils]: 31: Hoare triple {190889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {190889#false} is VALID [2022-04-08 10:14:22,871 INFO L290 TraceCheckUtils]: 30: Hoare triple {190889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {190889#false} is VALID [2022-04-08 10:14:22,871 INFO L290 TraceCheckUtils]: 29: Hoare triple {190889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {190889#false} is VALID [2022-04-08 10:14:22,871 INFO L290 TraceCheckUtils]: 28: Hoare triple {190889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {190889#false} is VALID [2022-04-08 10:14:22,872 INFO L290 TraceCheckUtils]: 27: Hoare triple {190889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {190889#false} is VALID [2022-04-08 10:14:22,872 INFO L290 TraceCheckUtils]: 26: Hoare triple {190889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {190889#false} is VALID [2022-04-08 10:14:22,872 INFO L290 TraceCheckUtils]: 25: Hoare triple {190889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {190889#false} is VALID [2022-04-08 10:14:22,872 INFO L290 TraceCheckUtils]: 24: Hoare triple {190889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {190889#false} is VALID [2022-04-08 10:14:22,872 INFO L290 TraceCheckUtils]: 23: Hoare triple {190889#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {190889#false} is VALID [2022-04-08 10:14:22,872 INFO L290 TraceCheckUtils]: 22: Hoare triple {191100#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {190889#false} is VALID [2022-04-08 10:14:22,873 INFO L290 TraceCheckUtils]: 21: Hoare triple {191104#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {191100#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:14:22,873 INFO L290 TraceCheckUtils]: 20: Hoare triple {191108#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {191104#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:14:22,896 INFO L290 TraceCheckUtils]: 19: Hoare triple {191112#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {191108#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:14:22,897 INFO L290 TraceCheckUtils]: 18: Hoare triple {191116#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {191112#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:14:22,897 INFO L290 TraceCheckUtils]: 17: Hoare triple {191120#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {191116#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:14:22,898 INFO L290 TraceCheckUtils]: 16: Hoare triple {191124#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} ~z~0 := ~y~0; {191120#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:14:22,898 INFO L290 TraceCheckUtils]: 15: Hoare triple {191124#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {191124#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:14:22,898 INFO L290 TraceCheckUtils]: 14: Hoare triple {191131#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191124#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:14:22,899 INFO L290 TraceCheckUtils]: 13: Hoare triple {191135#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191131#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:14:22,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {191139#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191135#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:14:22,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {191143#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191139#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:14:22,901 INFO L290 TraceCheckUtils]: 10: Hoare triple {191147#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191143#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:14:22,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {191151#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191147#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:14:22,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {191155#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191151#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:14:22,903 INFO L290 TraceCheckUtils]: 7: Hoare triple {191159#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191155#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:14:22,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {191163#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {191159#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:14:22,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {190888#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {191163#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:14:22,903 INFO L272 TraceCheckUtils]: 4: Hoare triple {190888#true} call #t~ret13 := main(); {190888#true} is VALID [2022-04-08 10:14:22,903 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {190888#true} {190888#true} #72#return; {190888#true} is VALID [2022-04-08 10:14:22,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {190888#true} assume true; {190888#true} is VALID [2022-04-08 10:14:22,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {190888#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {190888#true} is VALID [2022-04-08 10:14:22,904 INFO L272 TraceCheckUtils]: 0: Hoare triple {190888#true} call ULTIMATE.init(); {190888#true} is VALID [2022-04-08 10:14:22,904 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-08 10:14:22,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283807213] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:14:22,904 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:14:22,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-08 10:14:22,904 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:14:22,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2119820226] [2022-04-08 10:14:22,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2119820226] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:14:22,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:14:22,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 10:14:22,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61845703] [2022-04-08 10:14:22,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:14:22,905 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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 43 [2022-04-08 10:14:22,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:14:22,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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-08 10:14:22,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:14:22,921 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 10:14:22,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:14:22,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 10:14:22,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1053, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 10:14:22,922 INFO L87 Difference]: Start difference. First operand 607 states and 831 transitions. Second operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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-08 10:14:30,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:14:30,402 INFO L93 Difference]: Finished difference Result 729 states and 962 transitions. [2022-04-08 10:14:30,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-08 10:14:30,402 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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 43 [2022-04-08 10:14:30,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:14:30,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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-08 10:14:30,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 105 transitions. [2022-04-08 10:14:30,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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-08 10:14:30,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 105 transitions. [2022-04-08 10:14:30,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 105 transitions. [2022-04-08 10:14:30,473 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:14:30,493 INFO L225 Difference]: With dead ends: 729 [2022-04-08 10:14:30,493 INFO L226 Difference]: Without dead ends: 708 [2022-04-08 10:14:30,494 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=686, Invalid=2974, Unknown=0, NotChecked=0, Total=3660 [2022-04-08 10:14:30,494 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 44 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1167 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 1239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:14:30,494 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 117 Invalid, 1239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1167 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 10:14:30,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2022-04-08 10:14:34,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 607. [2022-04-08 10:14:34,289 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:14:34,290 INFO L82 GeneralOperation]: Start isEquivalent. First operand 708 states. Second operand has 607 states, 602 states have (on average 1.372093023255814) internal successors, (826), 602 states have internal predecessors, (826), 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-08 10:14:34,290 INFO L74 IsIncluded]: Start isIncluded. First operand 708 states. Second operand has 607 states, 602 states have (on average 1.372093023255814) internal successors, (826), 602 states have internal predecessors, (826), 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-08 10:14:34,290 INFO L87 Difference]: Start difference. First operand 708 states. Second operand has 607 states, 602 states have (on average 1.372093023255814) internal successors, (826), 602 states have internal predecessors, (826), 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-08 10:14:34,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:14:34,304 INFO L93 Difference]: Finished difference Result 708 states and 941 transitions. [2022-04-08 10:14:34,304 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 941 transitions. [2022-04-08 10:14:34,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:14:34,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:14:34,304 INFO L74 IsIncluded]: Start isIncluded. First operand has 607 states, 602 states have (on average 1.372093023255814) internal successors, (826), 602 states have internal predecessors, (826), 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 708 states. [2022-04-08 10:14:34,305 INFO L87 Difference]: Start difference. First operand has 607 states, 602 states have (on average 1.372093023255814) internal successors, (826), 602 states have internal predecessors, (826), 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 708 states. [2022-04-08 10:14:34,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:14:34,317 INFO L93 Difference]: Finished difference Result 708 states and 941 transitions. [2022-04-08 10:14:34,317 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 941 transitions. [2022-04-08 10:14:34,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:14:34,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:14:34,318 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:14:34,318 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:14:34,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 602 states have (on average 1.372093023255814) internal successors, (826), 602 states have internal predecessors, (826), 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-08 10:14:34,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 830 transitions. [2022-04-08 10:14:34,332 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 830 transitions. Word has length 43 [2022-04-08 10:14:34,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:14:34,332 INFO L478 AbstractCegarLoop]: Abstraction has 607 states and 830 transitions. [2022-04-08 10:14:34,332 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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-08 10:14:34,332 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 607 states and 830 transitions. [2022-04-08 10:14:39,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 830 edges. 830 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:14:39,905 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 830 transitions. [2022-04-08 10:14:39,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 10:14:39,905 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:14:39,905 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:14:39,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Forceful destruction successful, exit code 0 [2022-04-08 10:14:40,119 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89,88 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:14:40,119 INFO L403 AbstractCegarLoop]: === Iteration 91 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:14:40,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:14:40,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1640467482, now seen corresponding path program 35 times [2022-04-08 10:14:40,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:14:40,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1150588749] [2022-04-08 10:14:40,121 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:14:40,121 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:14:40,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1640467482, now seen corresponding path program 36 times [2022-04-08 10:14:40,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:14:40,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283480447] [2022-04-08 10:14:40,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:14:40,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:14:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:40,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:14:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:40,414 INFO L290 TraceCheckUtils]: 0: Hoare triple {195347#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {195322#true} is VALID [2022-04-08 10:14:40,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {195322#true} assume true; {195322#true} is VALID [2022-04-08 10:14:40,414 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {195322#true} {195322#true} #72#return; {195322#true} is VALID [2022-04-08 10:14:40,415 INFO L272 TraceCheckUtils]: 0: Hoare triple {195322#true} call ULTIMATE.init(); {195347#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:14:40,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {195347#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {195322#true} is VALID [2022-04-08 10:14:40,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {195322#true} assume true; {195322#true} is VALID [2022-04-08 10:14:40,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {195322#true} {195322#true} #72#return; {195322#true} is VALID [2022-04-08 10:14:40,415 INFO L272 TraceCheckUtils]: 4: Hoare triple {195322#true} call #t~ret13 := main(); {195322#true} is VALID [2022-04-08 10:14:40,415 INFO L290 TraceCheckUtils]: 5: Hoare triple {195322#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {195327#(= main_~y~0 0)} is VALID [2022-04-08 10:14:40,415 INFO L290 TraceCheckUtils]: 6: Hoare triple {195327#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {195328#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:14:40,416 INFO L290 TraceCheckUtils]: 7: Hoare triple {195328#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {195329#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:14:40,416 INFO L290 TraceCheckUtils]: 8: Hoare triple {195329#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {195330#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:14:40,417 INFO L290 TraceCheckUtils]: 9: Hoare triple {195330#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {195331#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:14:40,417 INFO L290 TraceCheckUtils]: 10: Hoare triple {195331#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {195332#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:14:40,418 INFO L290 TraceCheckUtils]: 11: Hoare triple {195332#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {195333#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:14:40,418 INFO L290 TraceCheckUtils]: 12: Hoare triple {195333#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {195334#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:14:40,419 INFO L290 TraceCheckUtils]: 13: Hoare triple {195334#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {195335#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:14:40,419 INFO L290 TraceCheckUtils]: 14: Hoare triple {195335#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {195336#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:14:40,419 INFO L290 TraceCheckUtils]: 15: Hoare triple {195336#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {195336#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:14:40,420 INFO L290 TraceCheckUtils]: 16: Hoare triple {195336#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {195337#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:14:40,420 INFO L290 TraceCheckUtils]: 17: Hoare triple {195337#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {195338#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:14:40,421 INFO L290 TraceCheckUtils]: 18: Hoare triple {195338#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {195339#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:14:40,421 INFO L290 TraceCheckUtils]: 19: Hoare triple {195339#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {195340#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:14:40,422 INFO L290 TraceCheckUtils]: 20: Hoare triple {195340#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {195341#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:14:40,422 INFO L290 TraceCheckUtils]: 21: Hoare triple {195341#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {195342#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-08 10:14:40,423 INFO L290 TraceCheckUtils]: 22: Hoare triple {195342#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {195343#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-08 10:14:40,423 INFO L290 TraceCheckUtils]: 23: Hoare triple {195343#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {195344#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-08 10:14:40,423 INFO L290 TraceCheckUtils]: 24: Hoare triple {195344#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {195345#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-08 10:14:40,424 INFO L290 TraceCheckUtils]: 25: Hoare triple {195345#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {195346#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-08 10:14:40,424 INFO L290 TraceCheckUtils]: 26: Hoare triple {195346#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {195323#false} is VALID [2022-04-08 10:14:40,424 INFO L290 TraceCheckUtils]: 27: Hoare triple {195323#false} assume !(~z~0 % 4294967296 > 0); {195323#false} is VALID [2022-04-08 10:14:40,424 INFO L290 TraceCheckUtils]: 28: Hoare triple {195323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {195323#false} is VALID [2022-04-08 10:14:40,425 INFO L290 TraceCheckUtils]: 29: Hoare triple {195323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {195323#false} is VALID [2022-04-08 10:14:40,425 INFO L290 TraceCheckUtils]: 30: Hoare triple {195323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {195323#false} is VALID [2022-04-08 10:14:40,425 INFO L290 TraceCheckUtils]: 31: Hoare triple {195323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {195323#false} is VALID [2022-04-08 10:14:40,425 INFO L290 TraceCheckUtils]: 32: Hoare triple {195323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {195323#false} is VALID [2022-04-08 10:14:40,425 INFO L290 TraceCheckUtils]: 33: Hoare triple {195323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {195323#false} is VALID [2022-04-08 10:14:40,425 INFO L290 TraceCheckUtils]: 34: Hoare triple {195323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {195323#false} is VALID [2022-04-08 10:14:40,425 INFO L290 TraceCheckUtils]: 35: Hoare triple {195323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {195323#false} is VALID [2022-04-08 10:14:40,425 INFO L290 TraceCheckUtils]: 36: Hoare triple {195323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {195323#false} is VALID [2022-04-08 10:14:40,425 INFO L290 TraceCheckUtils]: 37: Hoare triple {195323#false} assume !(~y~0 % 4294967296 > 0); {195323#false} is VALID [2022-04-08 10:14:40,425 INFO L290 TraceCheckUtils]: 38: Hoare triple {195323#false} assume !(~x~0 % 4294967296 > 0); {195323#false} is VALID [2022-04-08 10:14:40,425 INFO L272 TraceCheckUtils]: 39: Hoare triple {195323#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {195323#false} is VALID [2022-04-08 10:14:40,425 INFO L290 TraceCheckUtils]: 40: Hoare triple {195323#false} ~cond := #in~cond; {195323#false} is VALID [2022-04-08 10:14:40,425 INFO L290 TraceCheckUtils]: 41: Hoare triple {195323#false} assume 0 == ~cond; {195323#false} is VALID [2022-04-08 10:14:40,425 INFO L290 TraceCheckUtils]: 42: Hoare triple {195323#false} assume !false; {195323#false} is VALID [2022-04-08 10:14:40,425 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-08 10:14:40,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:14:40,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283480447] [2022-04-08 10:14:40,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283480447] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:14:40,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033106378] [2022-04-08 10:14:40,426 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:14:40,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:14:40,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:14:40,427 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:14:40,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2022-04-08 10:14:40,584 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-08 10:14:40,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:14:40,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-08 10:14:40,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:40,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:14:40,992 INFO L272 TraceCheckUtils]: 0: Hoare triple {195322#true} call ULTIMATE.init(); {195322#true} is VALID [2022-04-08 10:14:40,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {195322#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {195322#true} is VALID [2022-04-08 10:14:40,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {195322#true} assume true; {195322#true} is VALID [2022-04-08 10:14:40,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {195322#true} {195322#true} #72#return; {195322#true} is VALID [2022-04-08 10:14:40,993 INFO L272 TraceCheckUtils]: 4: Hoare triple {195322#true} call #t~ret13 := main(); {195322#true} is VALID [2022-04-08 10:14:40,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {195322#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {195327#(= main_~y~0 0)} is VALID [2022-04-08 10:14:40,994 INFO L290 TraceCheckUtils]: 6: Hoare triple {195327#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {195328#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:14:40,994 INFO L290 TraceCheckUtils]: 7: Hoare triple {195328#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {195329#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:14:40,995 INFO L290 TraceCheckUtils]: 8: Hoare triple {195329#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {195330#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:14:40,995 INFO L290 TraceCheckUtils]: 9: Hoare triple {195330#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {195331#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:14:40,996 INFO L290 TraceCheckUtils]: 10: Hoare triple {195331#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {195332#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:14:40,996 INFO L290 TraceCheckUtils]: 11: Hoare triple {195332#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {195333#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:14:40,997 INFO L290 TraceCheckUtils]: 12: Hoare triple {195333#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {195334#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:14:40,997 INFO L290 TraceCheckUtils]: 13: Hoare triple {195334#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {195335#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:14:40,998 INFO L290 TraceCheckUtils]: 14: Hoare triple {195335#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {195336#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:14:40,998 INFO L290 TraceCheckUtils]: 15: Hoare triple {195336#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {195336#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:14:40,998 INFO L290 TraceCheckUtils]: 16: Hoare triple {195336#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {195399#(and (= main_~z~0 main_~y~0) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:14:40,999 INFO L290 TraceCheckUtils]: 17: Hoare triple {195399#(and (= main_~z~0 main_~y~0) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {195403#(and (<= 9 main_~y~0) (<= main_~y~0 9) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-08 10:14:40,999 INFO L290 TraceCheckUtils]: 18: Hoare triple {195403#(and (<= 9 main_~y~0) (<= main_~y~0 9) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {195407#(and (= main_~y~0 (+ main_~z~0 2)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:14:41,000 INFO L290 TraceCheckUtils]: 19: Hoare triple {195407#(and (= main_~y~0 (+ main_~z~0 2)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {195411#(and (<= 9 main_~y~0) (<= main_~y~0 9) (= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-08 10:14:41,001 INFO L290 TraceCheckUtils]: 20: Hoare triple {195411#(and (<= 9 main_~y~0) (<= main_~y~0 9) (= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {195415#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:14:41,001 INFO L290 TraceCheckUtils]: 21: Hoare triple {195415#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {195419#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:14:41,002 INFO L290 TraceCheckUtils]: 22: Hoare triple {195419#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {195423#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:14:41,002 INFO L290 TraceCheckUtils]: 23: Hoare triple {195423#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {195427#(and (= (+ main_~z~0 2) (+ main_~y~0 (- 5))) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:14:41,003 INFO L290 TraceCheckUtils]: 24: Hoare triple {195427#(and (= (+ main_~z~0 2) (+ main_~y~0 (- 5))) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {195431#(and (= (+ main_~z~0 1) (+ main_~y~0 (- 7))) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:14:41,004 INFO L290 TraceCheckUtils]: 25: Hoare triple {195431#(and (= (+ main_~z~0 1) (+ main_~y~0 (- 7))) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {195435#(and (= (+ main_~z~0 1) (+ main_~y~0 (- 8))) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:14:41,004 INFO L290 TraceCheckUtils]: 26: Hoare triple {195435#(and (= (+ main_~z~0 1) (+ main_~y~0 (- 8))) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {195323#false} is VALID [2022-04-08 10:14:41,004 INFO L290 TraceCheckUtils]: 27: Hoare triple {195323#false} assume !(~z~0 % 4294967296 > 0); {195323#false} is VALID [2022-04-08 10:14:41,004 INFO L290 TraceCheckUtils]: 28: Hoare triple {195323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {195323#false} is VALID [2022-04-08 10:14:41,004 INFO L290 TraceCheckUtils]: 29: Hoare triple {195323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {195323#false} is VALID [2022-04-08 10:14:41,004 INFO L290 TraceCheckUtils]: 30: Hoare triple {195323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {195323#false} is VALID [2022-04-08 10:14:41,005 INFO L290 TraceCheckUtils]: 31: Hoare triple {195323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {195323#false} is VALID [2022-04-08 10:14:41,005 INFO L290 TraceCheckUtils]: 32: Hoare triple {195323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {195323#false} is VALID [2022-04-08 10:14:41,005 INFO L290 TraceCheckUtils]: 33: Hoare triple {195323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {195323#false} is VALID [2022-04-08 10:14:41,005 INFO L290 TraceCheckUtils]: 34: Hoare triple {195323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {195323#false} is VALID [2022-04-08 10:14:41,005 INFO L290 TraceCheckUtils]: 35: Hoare triple {195323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {195323#false} is VALID [2022-04-08 10:14:41,005 INFO L290 TraceCheckUtils]: 36: Hoare triple {195323#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {195323#false} is VALID [2022-04-08 10:14:41,005 INFO L290 TraceCheckUtils]: 37: Hoare triple {195323#false} assume !(~y~0 % 4294967296 > 0); {195323#false} is VALID [2022-04-08 10:14:41,005 INFO L290 TraceCheckUtils]: 38: Hoare triple {195323#false} assume !(~x~0 % 4294967296 > 0); {195323#false} is VALID [2022-04-08 10:14:41,005 INFO L272 TraceCheckUtils]: 39: Hoare triple {195323#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {195323#false} is VALID [2022-04-08 10:14:41,005 INFO L290 TraceCheckUtils]: 40: Hoare triple {195323#false} ~cond := #in~cond; {195323#false} is VALID [2022-04-08 10:14:41,005 INFO L290 TraceCheckUtils]: 41: Hoare triple {195323#false} assume 0 == ~cond; {195323#false} is VALID [2022-04-08 10:14:41,005 INFO L290 TraceCheckUtils]: 42: Hoare triple {195323#false} assume !false; {195323#false} is VALID [2022-04-08 10:14:41,005 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-08 10:14:41,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:14:41,816 INFO L290 TraceCheckUtils]: 42: Hoare triple {195323#false} assume !false; {195323#false} is VALID [2022-04-08 10:14:41,816 INFO L290 TraceCheckUtils]: 41: Hoare triple {195323#false} assume 0 == ~cond; {195323#false} is VALID [2022-04-08 10:14:41,816 INFO L290 TraceCheckUtils]: 40: Hoare triple {195323#false} ~cond := #in~cond; {195323#false} is VALID [2022-04-08 10:14:41,816 INFO L272 TraceCheckUtils]: 39: Hoare triple {195323#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {195323#false} is VALID [2022-04-08 10:14:41,816 INFO L290 TraceCheckUtils]: 38: Hoare triple {195323#false} assume !(~x~0 % 4294967296 > 0); {195323#false} is VALID [2022-04-08 10:14:41,817 INFO L290 TraceCheckUtils]: 37: Hoare triple {195502#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {195323#false} is VALID [2022-04-08 10:14:41,818 INFO L290 TraceCheckUtils]: 36: Hoare triple {195506#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {195502#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:14:41,819 INFO L290 TraceCheckUtils]: 35: Hoare triple {195510#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {195506#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:14:41,819 INFO L290 TraceCheckUtils]: 34: Hoare triple {195514#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {195510#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:14:41,820 INFO L290 TraceCheckUtils]: 33: Hoare triple {195518#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {195514#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:14:41,821 INFO L290 TraceCheckUtils]: 32: Hoare triple {195522#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {195518#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:14:41,821 INFO L290 TraceCheckUtils]: 31: Hoare triple {195526#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {195522#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:14:41,822 INFO L290 TraceCheckUtils]: 30: Hoare triple {195530#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {195526#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-08 10:14:41,823 INFO L290 TraceCheckUtils]: 29: Hoare triple {195534#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {195530#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-08 10:14:41,823 INFO L290 TraceCheckUtils]: 28: Hoare triple {195538#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {195534#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-08 10:14:41,824 INFO L290 TraceCheckUtils]: 27: Hoare triple {195538#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} assume !(~z~0 % 4294967296 > 0); {195538#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} is VALID [2022-04-08 10:14:41,824 INFO L290 TraceCheckUtils]: 26: Hoare triple {195545#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {195538#(< 0 (mod (+ main_~y~0 4294967287) 4294967296))} is VALID [2022-04-08 10:14:41,825 INFO L290 TraceCheckUtils]: 25: Hoare triple {195549#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {195545#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-08 10:14:41,826 INFO L290 TraceCheckUtils]: 24: Hoare triple {195553#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {195549#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))))} is VALID [2022-04-08 10:14:41,827 INFO L290 TraceCheckUtils]: 23: Hoare triple {195557#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {195553#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-08 10:14:41,827 INFO L290 TraceCheckUtils]: 22: Hoare triple {195561#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {195557#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))))} is VALID [2022-04-08 10:14:41,828 INFO L290 TraceCheckUtils]: 21: Hoare triple {195565#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {195561#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-08 10:14:41,829 INFO L290 TraceCheckUtils]: 20: Hoare triple {195569#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {195565#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-08 10:14:41,830 INFO L290 TraceCheckUtils]: 19: Hoare triple {195573#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {195569#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-08 10:14:41,831 INFO L290 TraceCheckUtils]: 18: Hoare triple {195577#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ 4294967288 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {195573#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} is VALID [2022-04-08 10:14:41,832 INFO L290 TraceCheckUtils]: 17: Hoare triple {195581#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967287) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {195577#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ 4294967288 main_~z~0) 4294967296))))} is VALID [2022-04-08 10:14:41,832 INFO L290 TraceCheckUtils]: 16: Hoare triple {195322#true} ~z~0 := ~y~0; {195581#(or (< 0 (mod (+ main_~y~0 4294967287) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967287) 4294967296))))} is VALID [2022-04-08 10:14:41,832 INFO L290 TraceCheckUtils]: 15: Hoare triple {195322#true} assume !(~x~0 % 4294967296 > 0); {195322#true} is VALID [2022-04-08 10:14:41,832 INFO L290 TraceCheckUtils]: 14: Hoare triple {195322#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {195322#true} is VALID [2022-04-08 10:14:41,832 INFO L290 TraceCheckUtils]: 13: Hoare triple {195322#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {195322#true} is VALID [2022-04-08 10:14:41,832 INFO L290 TraceCheckUtils]: 12: Hoare triple {195322#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {195322#true} is VALID [2022-04-08 10:14:41,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {195322#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {195322#true} is VALID [2022-04-08 10:14:41,833 INFO L290 TraceCheckUtils]: 10: Hoare triple {195322#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {195322#true} is VALID [2022-04-08 10:14:41,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {195322#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {195322#true} is VALID [2022-04-08 10:14:41,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {195322#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {195322#true} is VALID [2022-04-08 10:14:41,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {195322#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {195322#true} is VALID [2022-04-08 10:14:41,833 INFO L290 TraceCheckUtils]: 6: Hoare triple {195322#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {195322#true} is VALID [2022-04-08 10:14:41,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {195322#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {195322#true} is VALID [2022-04-08 10:14:41,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {195322#true} call #t~ret13 := main(); {195322#true} is VALID [2022-04-08 10:14:41,833 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {195322#true} {195322#true} #72#return; {195322#true} is VALID [2022-04-08 10:14:41,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {195322#true} assume true; {195322#true} is VALID [2022-04-08 10:14:41,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {195322#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {195322#true} is VALID [2022-04-08 10:14:41,833 INFO L272 TraceCheckUtils]: 0: Hoare triple {195322#true} call ULTIMATE.init(); {195322#true} is VALID [2022-04-08 10:14:41,833 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-08 10:14:41,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033106378] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:14:41,833 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:14:41,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 53 [2022-04-08 10:14:41,834 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:14:41,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1150588749] [2022-04-08 10:14:41,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1150588749] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:14:41,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:14:41,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-08 10:14:41,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42698634] [2022-04-08 10:14:41,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:14:41,834 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 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 43 [2022-04-08 10:14:41,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:14:41,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 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-08 10:14:41,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:14:41,857 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-08 10:14:41,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:14:41,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-08 10:14:41,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=2333, Unknown=0, NotChecked=0, Total=2756 [2022-04-08 10:14:41,858 INFO L87 Difference]: Start difference. First operand 607 states and 830 transitions. Second operand has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 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-08 10:14:49,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:14:49,757 INFO L93 Difference]: Finished difference Result 736 states and 967 transitions. [2022-04-08 10:14:49,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-04-08 10:14:49,757 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 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 43 [2022-04-08 10:14:49,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:14:49,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 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-08 10:14:49,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 152 transitions. [2022-04-08 10:14:49,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 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-08 10:14:49,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 152 transitions. [2022-04-08 10:14:49,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 152 transitions. [2022-04-08 10:14:49,885 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:14:49,901 INFO L225 Difference]: With dead ends: 736 [2022-04-08 10:14:49,902 INFO L226 Difference]: Without dead ends: 674 [2022-04-08 10:14:49,902 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4320 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2258, Invalid=15034, Unknown=0, NotChecked=0, Total=17292 [2022-04-08 10:14:49,903 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 55 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 2230 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 2391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 2230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-08 10:14:49,903 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 126 Invalid, 2391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 2230 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-08 10:14:49,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2022-04-08 10:14:52,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 606. [2022-04-08 10:14:52,760 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:14:52,760 INFO L82 GeneralOperation]: Start isEquivalent. First operand 674 states. Second operand has 606 states, 601 states have (on average 1.3643926788685523) internal successors, (820), 601 states have internal predecessors, (820), 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-08 10:14:52,761 INFO L74 IsIncluded]: Start isIncluded. First operand 674 states. Second operand has 606 states, 601 states have (on average 1.3643926788685523) internal successors, (820), 601 states have internal predecessors, (820), 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-08 10:14:52,761 INFO L87 Difference]: Start difference. First operand 674 states. Second operand has 606 states, 601 states have (on average 1.3643926788685523) internal successors, (820), 601 states have internal predecessors, (820), 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-08 10:14:52,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:14:52,773 INFO L93 Difference]: Finished difference Result 674 states and 900 transitions. [2022-04-08 10:14:52,773 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 900 transitions. [2022-04-08 10:14:52,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:14:52,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:14:52,773 INFO L74 IsIncluded]: Start isIncluded. First operand has 606 states, 601 states have (on average 1.3643926788685523) internal successors, (820), 601 states have internal predecessors, (820), 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 674 states. [2022-04-08 10:14:52,774 INFO L87 Difference]: Start difference. First operand has 606 states, 601 states have (on average 1.3643926788685523) internal successors, (820), 601 states have internal predecessors, (820), 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 674 states. [2022-04-08 10:14:52,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:14:52,785 INFO L93 Difference]: Finished difference Result 674 states and 900 transitions. [2022-04-08 10:14:52,785 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 900 transitions. [2022-04-08 10:14:52,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:14:52,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:14:52,786 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:14:52,786 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:14:52,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 601 states have (on average 1.3643926788685523) internal successors, (820), 601 states have internal predecessors, (820), 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-08 10:14:52,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 824 transitions. [2022-04-08 10:14:52,800 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 824 transitions. Word has length 43 [2022-04-08 10:14:52,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:14:52,800 INFO L478 AbstractCegarLoop]: Abstraction has 606 states and 824 transitions. [2022-04-08 10:14:52,800 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 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-08 10:14:52,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 606 states and 824 transitions. [2022-04-08 10:14:57,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 824 edges. 824 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:14:57,893 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 824 transitions. [2022-04-08 10:14:57,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 10:14:57,894 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:14:57,894 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:14:57,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Forceful destruction successful, exit code 0 [2022-04-08 10:14:58,110 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,89 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:14:58,110 INFO L403 AbstractCegarLoop]: === Iteration 92 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:14:58,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:14:58,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1870434904, now seen corresponding path program 87 times [2022-04-08 10:14:58,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:14:58,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2023745830] [2022-04-08 10:14:58,113 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:14:58,113 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:14:58,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1870434904, now seen corresponding path program 88 times [2022-04-08 10:14:58,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:14:58,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769814087] [2022-04-08 10:14:58,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:14:58,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:14:58,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:58,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:14:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:58,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {199846#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {199825#true} is VALID [2022-04-08 10:14:58,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {199825#true} assume true; {199825#true} is VALID [2022-04-08 10:14:58,344 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {199825#true} {199825#true} #72#return; {199825#true} is VALID [2022-04-08 10:14:58,344 INFO L272 TraceCheckUtils]: 0: Hoare triple {199825#true} call ULTIMATE.init(); {199846#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:14:58,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {199846#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {199825#true} is VALID [2022-04-08 10:14:58,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {199825#true} assume true; {199825#true} is VALID [2022-04-08 10:14:58,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {199825#true} {199825#true} #72#return; {199825#true} is VALID [2022-04-08 10:14:58,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {199825#true} call #t~ret13 := main(); {199825#true} is VALID [2022-04-08 10:14:58,345 INFO L290 TraceCheckUtils]: 5: Hoare triple {199825#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {199830#(= main_~y~0 0)} is VALID [2022-04-08 10:14:58,345 INFO L290 TraceCheckUtils]: 6: Hoare triple {199830#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {199831#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:14:58,346 INFO L290 TraceCheckUtils]: 7: Hoare triple {199831#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {199832#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:14:58,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {199832#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {199833#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:14:58,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {199833#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {199834#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:14:58,348 INFO L290 TraceCheckUtils]: 10: Hoare triple {199834#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {199835#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:14:58,348 INFO L290 TraceCheckUtils]: 11: Hoare triple {199835#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {199836#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:14:58,349 INFO L290 TraceCheckUtils]: 12: Hoare triple {199836#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {199837#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:14:58,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {199837#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {199838#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:14:58,350 INFO L290 TraceCheckUtils]: 14: Hoare triple {199838#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {199839#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:14:58,350 INFO L290 TraceCheckUtils]: 15: Hoare triple {199839#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {199840#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:14:58,350 INFO L290 TraceCheckUtils]: 16: Hoare triple {199840#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {199840#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:14:58,351 INFO L290 TraceCheckUtils]: 17: Hoare triple {199840#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {199841#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:14:58,351 INFO L290 TraceCheckUtils]: 18: Hoare triple {199841#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {199842#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:14:58,352 INFO L290 TraceCheckUtils]: 19: Hoare triple {199842#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {199843#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:14:58,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {199843#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {199844#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:14:58,353 INFO L290 TraceCheckUtils]: 21: Hoare triple {199844#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {199845#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-08 10:14:58,353 INFO L290 TraceCheckUtils]: 22: Hoare triple {199845#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {199826#false} is VALID [2022-04-08 10:14:58,353 INFO L290 TraceCheckUtils]: 23: Hoare triple {199826#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {199826#false} is VALID [2022-04-08 10:14:58,353 INFO L290 TraceCheckUtils]: 24: Hoare triple {199826#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {199826#false} is VALID [2022-04-08 10:14:58,353 INFO L290 TraceCheckUtils]: 25: Hoare triple {199826#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {199826#false} is VALID [2022-04-08 10:14:58,354 INFO L290 TraceCheckUtils]: 26: Hoare triple {199826#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {199826#false} is VALID [2022-04-08 10:14:58,354 INFO L290 TraceCheckUtils]: 27: Hoare triple {199826#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {199826#false} is VALID [2022-04-08 10:14:58,354 INFO L290 TraceCheckUtils]: 28: Hoare triple {199826#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {199826#false} is VALID [2022-04-08 10:14:58,354 INFO L290 TraceCheckUtils]: 29: Hoare triple {199826#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {199826#false} is VALID [2022-04-08 10:14:58,354 INFO L290 TraceCheckUtils]: 30: Hoare triple {199826#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {199826#false} is VALID [2022-04-08 10:14:58,354 INFO L290 TraceCheckUtils]: 31: Hoare triple {199826#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {199826#false} is VALID [2022-04-08 10:14:58,354 INFO L290 TraceCheckUtils]: 32: Hoare triple {199826#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {199826#false} is VALID [2022-04-08 10:14:58,354 INFO L290 TraceCheckUtils]: 33: Hoare triple {199826#false} assume !(~y~0 % 4294967296 > 0); {199826#false} is VALID [2022-04-08 10:14:58,354 INFO L290 TraceCheckUtils]: 34: Hoare triple {199826#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {199826#false} is VALID [2022-04-08 10:14:58,354 INFO L290 TraceCheckUtils]: 35: Hoare triple {199826#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {199826#false} is VALID [2022-04-08 10:14:58,354 INFO L290 TraceCheckUtils]: 36: Hoare triple {199826#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {199826#false} is VALID [2022-04-08 10:14:58,354 INFO L290 TraceCheckUtils]: 37: Hoare triple {199826#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {199826#false} is VALID [2022-04-08 10:14:58,354 INFO L290 TraceCheckUtils]: 38: Hoare triple {199826#false} assume !(~x~0 % 4294967296 > 0); {199826#false} is VALID [2022-04-08 10:14:58,354 INFO L272 TraceCheckUtils]: 39: Hoare triple {199826#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {199826#false} is VALID [2022-04-08 10:14:58,354 INFO L290 TraceCheckUtils]: 40: Hoare triple {199826#false} ~cond := #in~cond; {199826#false} is VALID [2022-04-08 10:14:58,354 INFO L290 TraceCheckUtils]: 41: Hoare triple {199826#false} assume 0 == ~cond; {199826#false} is VALID [2022-04-08 10:14:58,354 INFO L290 TraceCheckUtils]: 42: Hoare triple {199826#false} assume !false; {199826#false} is VALID [2022-04-08 10:14:58,354 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-04-08 10:14:58,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:14:58,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769814087] [2022-04-08 10:14:58,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769814087] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:14:58,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657347571] [2022-04-08 10:14:58,355 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:14:58,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:14:58,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:14:58,356 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:14:58,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2022-04-08 10:14:58,399 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:14:58,399 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:14:58,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 10:14:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:14:58,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:14:58,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {199825#true} call ULTIMATE.init(); {199825#true} is VALID [2022-04-08 10:14:58,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {199825#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {199825#true} is VALID [2022-04-08 10:14:58,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {199825#true} assume true; {199825#true} is VALID [2022-04-08 10:14:58,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {199825#true} {199825#true} #72#return; {199825#true} is VALID [2022-04-08 10:14:58,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {199825#true} call #t~ret13 := main(); {199825#true} is VALID [2022-04-08 10:14:58,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {199825#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {199830#(= main_~y~0 0)} is VALID [2022-04-08 10:14:58,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {199830#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {199831#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:14:58,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {199831#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {199832#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:14:58,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {199832#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {199833#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:14:58,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {199833#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {199834#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:14:58,627 INFO L290 TraceCheckUtils]: 10: Hoare triple {199834#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {199835#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:14:58,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {199835#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {199836#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:14:58,628 INFO L290 TraceCheckUtils]: 12: Hoare triple {199836#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {199837#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:14:58,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {199837#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {199838#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:14:58,628 INFO L290 TraceCheckUtils]: 14: Hoare triple {199838#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {199839#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:14:58,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {199839#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {199840#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:14:58,629 INFO L290 TraceCheckUtils]: 16: Hoare triple {199840#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {199840#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:14:58,629 INFO L290 TraceCheckUtils]: 17: Hoare triple {199840#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {199841#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:14:58,630 INFO L290 TraceCheckUtils]: 18: Hoare triple {199841#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {199842#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:14:58,630 INFO L290 TraceCheckUtils]: 19: Hoare triple {199842#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {199843#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:14:58,631 INFO L290 TraceCheckUtils]: 20: Hoare triple {199843#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {199844#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:14:58,631 INFO L290 TraceCheckUtils]: 21: Hoare triple {199844#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {199913#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:14:58,632 INFO L290 TraceCheckUtils]: 22: Hoare triple {199913#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {199826#false} is VALID [2022-04-08 10:14:58,632 INFO L290 TraceCheckUtils]: 23: Hoare triple {199826#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {199826#false} is VALID [2022-04-08 10:14:58,632 INFO L290 TraceCheckUtils]: 24: Hoare triple {199826#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {199826#false} is VALID [2022-04-08 10:14:58,632 INFO L290 TraceCheckUtils]: 25: Hoare triple {199826#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {199826#false} is VALID [2022-04-08 10:14:58,632 INFO L290 TraceCheckUtils]: 26: Hoare triple {199826#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {199826#false} is VALID [2022-04-08 10:14:58,632 INFO L290 TraceCheckUtils]: 27: Hoare triple {199826#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {199826#false} is VALID [2022-04-08 10:14:58,632 INFO L290 TraceCheckUtils]: 28: Hoare triple {199826#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {199826#false} is VALID [2022-04-08 10:14:58,632 INFO L290 TraceCheckUtils]: 29: Hoare triple {199826#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {199826#false} is VALID [2022-04-08 10:14:58,632 INFO L290 TraceCheckUtils]: 30: Hoare triple {199826#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {199826#false} is VALID [2022-04-08 10:14:58,632 INFO L290 TraceCheckUtils]: 31: Hoare triple {199826#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {199826#false} is VALID [2022-04-08 10:14:58,632 INFO L290 TraceCheckUtils]: 32: Hoare triple {199826#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {199826#false} is VALID [2022-04-08 10:14:58,632 INFO L290 TraceCheckUtils]: 33: Hoare triple {199826#false} assume !(~y~0 % 4294967296 > 0); {199826#false} is VALID [2022-04-08 10:14:58,632 INFO L290 TraceCheckUtils]: 34: Hoare triple {199826#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {199826#false} is VALID [2022-04-08 10:14:58,632 INFO L290 TraceCheckUtils]: 35: Hoare triple {199826#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {199826#false} is VALID [2022-04-08 10:14:58,632 INFO L290 TraceCheckUtils]: 36: Hoare triple {199826#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {199826#false} is VALID [2022-04-08 10:14:58,632 INFO L290 TraceCheckUtils]: 37: Hoare triple {199826#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {199826#false} is VALID [2022-04-08 10:14:58,632 INFO L290 TraceCheckUtils]: 38: Hoare triple {199826#false} assume !(~x~0 % 4294967296 > 0); {199826#false} is VALID [2022-04-08 10:14:58,632 INFO L272 TraceCheckUtils]: 39: Hoare triple {199826#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {199826#false} is VALID [2022-04-08 10:14:58,632 INFO L290 TraceCheckUtils]: 40: Hoare triple {199826#false} ~cond := #in~cond; {199826#false} is VALID [2022-04-08 10:14:58,632 INFO L290 TraceCheckUtils]: 41: Hoare triple {199826#false} assume 0 == ~cond; {199826#false} is VALID [2022-04-08 10:14:58,632 INFO L290 TraceCheckUtils]: 42: Hoare triple {199826#false} assume !false; {199826#false} is VALID [2022-04-08 10:14:58,633 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-04-08 10:14:58,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:14:59,014 INFO L290 TraceCheckUtils]: 42: Hoare triple {199826#false} assume !false; {199826#false} is VALID [2022-04-08 10:14:59,014 INFO L290 TraceCheckUtils]: 41: Hoare triple {199826#false} assume 0 == ~cond; {199826#false} is VALID [2022-04-08 10:14:59,014 INFO L290 TraceCheckUtils]: 40: Hoare triple {199826#false} ~cond := #in~cond; {199826#false} is VALID [2022-04-08 10:14:59,014 INFO L272 TraceCheckUtils]: 39: Hoare triple {199826#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {199826#false} is VALID [2022-04-08 10:14:59,014 INFO L290 TraceCheckUtils]: 38: Hoare triple {199826#false} assume !(~x~0 % 4294967296 > 0); {199826#false} is VALID [2022-04-08 10:14:59,014 INFO L290 TraceCheckUtils]: 37: Hoare triple {199826#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {199826#false} is VALID [2022-04-08 10:14:59,014 INFO L290 TraceCheckUtils]: 36: Hoare triple {199826#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {199826#false} is VALID [2022-04-08 10:14:59,014 INFO L290 TraceCheckUtils]: 35: Hoare triple {199826#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {199826#false} is VALID [2022-04-08 10:14:59,015 INFO L290 TraceCheckUtils]: 34: Hoare triple {199826#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {199826#false} is VALID [2022-04-08 10:14:59,015 INFO L290 TraceCheckUtils]: 33: Hoare triple {199826#false} assume !(~y~0 % 4294967296 > 0); {199826#false} is VALID [2022-04-08 10:14:59,015 INFO L290 TraceCheckUtils]: 32: Hoare triple {199826#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {199826#false} is VALID [2022-04-08 10:14:59,015 INFO L290 TraceCheckUtils]: 31: Hoare triple {199826#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {199826#false} is VALID [2022-04-08 10:14:59,015 INFO L290 TraceCheckUtils]: 30: Hoare triple {199826#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {199826#false} is VALID [2022-04-08 10:14:59,015 INFO L290 TraceCheckUtils]: 29: Hoare triple {199826#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {199826#false} is VALID [2022-04-08 10:14:59,015 INFO L290 TraceCheckUtils]: 28: Hoare triple {199826#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {199826#false} is VALID [2022-04-08 10:14:59,015 INFO L290 TraceCheckUtils]: 27: Hoare triple {199826#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {199826#false} is VALID [2022-04-08 10:14:59,015 INFO L290 TraceCheckUtils]: 26: Hoare triple {199826#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {199826#false} is VALID [2022-04-08 10:14:59,015 INFO L290 TraceCheckUtils]: 25: Hoare triple {199826#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {199826#false} is VALID [2022-04-08 10:14:59,015 INFO L290 TraceCheckUtils]: 24: Hoare triple {199826#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {199826#false} is VALID [2022-04-08 10:14:59,015 INFO L290 TraceCheckUtils]: 23: Hoare triple {199826#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {199826#false} is VALID [2022-04-08 10:14:59,015 INFO L290 TraceCheckUtils]: 22: Hoare triple {200037#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {199826#false} is VALID [2022-04-08 10:14:59,016 INFO L290 TraceCheckUtils]: 21: Hoare triple {200041#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {200037#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:14:59,016 INFO L290 TraceCheckUtils]: 20: Hoare triple {200045#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {200041#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:14:59,017 INFO L290 TraceCheckUtils]: 19: Hoare triple {200049#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {200045#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:14:59,018 INFO L290 TraceCheckUtils]: 18: Hoare triple {200053#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {200049#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:14:59,018 INFO L290 TraceCheckUtils]: 17: Hoare triple {200057#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {200053#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:14:59,019 INFO L290 TraceCheckUtils]: 16: Hoare triple {200057#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {200057#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:14:59,019 INFO L290 TraceCheckUtils]: 15: Hoare triple {200064#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {200057#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:14:59,020 INFO L290 TraceCheckUtils]: 14: Hoare triple {200068#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {200064#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:14:59,020 INFO L290 TraceCheckUtils]: 13: Hoare triple {200072#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {200068#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:14:59,021 INFO L290 TraceCheckUtils]: 12: Hoare triple {200076#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {200072#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:14:59,022 INFO L290 TraceCheckUtils]: 11: Hoare triple {200080#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {200076#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:14:59,022 INFO L290 TraceCheckUtils]: 10: Hoare triple {200084#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {200080#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:14:59,023 INFO L290 TraceCheckUtils]: 9: Hoare triple {200088#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {200084#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:14:59,023 INFO L290 TraceCheckUtils]: 8: Hoare triple {200092#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {200088#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:14:59,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {200096#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {200092#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:14:59,024 INFO L290 TraceCheckUtils]: 6: Hoare triple {200100#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {200096#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:14:59,024 INFO L290 TraceCheckUtils]: 5: Hoare triple {199825#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {200100#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:14:59,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {199825#true} call #t~ret13 := main(); {199825#true} is VALID [2022-04-08 10:14:59,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {199825#true} {199825#true} #72#return; {199825#true} is VALID [2022-04-08 10:14:59,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {199825#true} assume true; {199825#true} is VALID [2022-04-08 10:14:59,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {199825#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {199825#true} is VALID [2022-04-08 10:14:59,025 INFO L272 TraceCheckUtils]: 0: Hoare triple {199825#true} call ULTIMATE.init(); {199825#true} is VALID [2022-04-08 10:14:59,025 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-04-08 10:14:59,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657347571] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:14:59,025 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:14:59,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-08 10:14:59,025 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:14:59,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2023745830] [2022-04-08 10:14:59,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2023745830] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:14:59,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:14:59,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 10:14:59,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956098631] [2022-04-08 10:14:59,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:14:59,026 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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 43 [2022-04-08 10:14:59,026 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:14:59,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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-08 10:14:59,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:14:59,042 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 10:14:59,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:14:59,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 10:14:59,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1040, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 10:14:59,043 INFO L87 Difference]: Start difference. First operand 606 states and 824 transitions. Second operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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-08 10:15:07,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:15:07,705 INFO L93 Difference]: Finished difference Result 752 states and 980 transitions. [2022-04-08 10:15:07,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-08 10:15:07,706 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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 43 [2022-04-08 10:15:07,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:15:07,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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-08 10:15:07,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 113 transitions. [2022-04-08 10:15:07,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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-08 10:15:07,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 113 transitions. [2022-04-08 10:15:07,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 113 transitions. [2022-04-08 10:15:07,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:15:07,827 INFO L225 Difference]: With dead ends: 752 [2022-04-08 10:15:07,827 INFO L226 Difference]: Without dead ends: 731 [2022-04-08 10:15:07,827 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=708, Invalid=2952, Unknown=0, NotChecked=0, Total=3660 [2022-04-08 10:15:07,827 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 52 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1157 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:15:07,827 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 113 Invalid, 1231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1157 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 10:15:07,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2022-04-08 10:15:10,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 606. [2022-04-08 10:15:10,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:15:10,804 INFO L82 GeneralOperation]: Start isEquivalent. First operand 731 states. Second operand has 606 states, 601 states have (on average 1.362728785357737) internal successors, (819), 601 states have internal predecessors, (819), 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-08 10:15:10,804 INFO L74 IsIncluded]: Start isIncluded. First operand 731 states. Second operand has 606 states, 601 states have (on average 1.362728785357737) internal successors, (819), 601 states have internal predecessors, (819), 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-08 10:15:10,804 INFO L87 Difference]: Start difference. First operand 731 states. Second operand has 606 states, 601 states have (on average 1.362728785357737) internal successors, (819), 601 states have internal predecessors, (819), 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-08 10:15:10,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:15:10,818 INFO L93 Difference]: Finished difference Result 731 states and 959 transitions. [2022-04-08 10:15:10,818 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 959 transitions. [2022-04-08 10:15:10,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:15:10,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:15:10,818 INFO L74 IsIncluded]: Start isIncluded. First operand has 606 states, 601 states have (on average 1.362728785357737) internal successors, (819), 601 states have internal predecessors, (819), 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 731 states. [2022-04-08 10:15:10,819 INFO L87 Difference]: Start difference. First operand has 606 states, 601 states have (on average 1.362728785357737) internal successors, (819), 601 states have internal predecessors, (819), 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 731 states. [2022-04-08 10:15:10,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:15:10,832 INFO L93 Difference]: Finished difference Result 731 states and 959 transitions. [2022-04-08 10:15:10,832 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 959 transitions. [2022-04-08 10:15:10,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:15:10,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:15:10,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:15:10,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:15:10,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 601 states have (on average 1.362728785357737) internal successors, (819), 601 states have internal predecessors, (819), 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-08 10:15:10,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 823 transitions. [2022-04-08 10:15:10,846 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 823 transitions. Word has length 43 [2022-04-08 10:15:10,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:15:10,846 INFO L478 AbstractCegarLoop]: Abstraction has 606 states and 823 transitions. [2022-04-08 10:15:10,846 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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-08 10:15:10,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 606 states and 823 transitions. [2022-04-08 10:15:15,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 823 edges. 823 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:15:15,738 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 823 transitions. [2022-04-08 10:15:15,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 10:15:15,738 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:15:15,739 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:15:15,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Forceful destruction successful, exit code 0 [2022-04-08 10:15:15,939 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 90 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable91 [2022-04-08 10:15:15,939 INFO L403 AbstractCegarLoop]: === Iteration 93 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:15:15,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:15:15,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1838331064, now seen corresponding path program 89 times [2022-04-08 10:15:15,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:15:15,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2056463506] [2022-04-08 10:15:15,941 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:15:15,941 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:15:15,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1838331064, now seen corresponding path program 90 times [2022-04-08 10:15:15,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:15:15,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408465628] [2022-04-08 10:15:15,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:15:15,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:15:15,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:15:16,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:15:16,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:15:16,223 INFO L290 TraceCheckUtils]: 0: Hoare triple {204370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {204349#true} is VALID [2022-04-08 10:15:16,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {204349#true} assume true; {204349#true} is VALID [2022-04-08 10:15:16,223 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {204349#true} {204349#true} #72#return; {204349#true} is VALID [2022-04-08 10:15:16,223 INFO L272 TraceCheckUtils]: 0: Hoare triple {204349#true} call ULTIMATE.init(); {204370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:15:16,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {204370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {204349#true} is VALID [2022-04-08 10:15:16,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {204349#true} assume true; {204349#true} is VALID [2022-04-08 10:15:16,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {204349#true} {204349#true} #72#return; {204349#true} is VALID [2022-04-08 10:15:16,224 INFO L272 TraceCheckUtils]: 4: Hoare triple {204349#true} call #t~ret13 := main(); {204349#true} is VALID [2022-04-08 10:15:16,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {204349#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {204354#(= main_~y~0 0)} is VALID [2022-04-08 10:15:16,224 INFO L290 TraceCheckUtils]: 6: Hoare triple {204354#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {204355#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:15:16,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {204355#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {204356#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:15:16,225 INFO L290 TraceCheckUtils]: 8: Hoare triple {204356#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {204357#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:15:16,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {204357#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {204358#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:15:16,226 INFO L290 TraceCheckUtils]: 10: Hoare triple {204358#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {204359#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:15:16,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {204359#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {204360#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:15:16,227 INFO L290 TraceCheckUtils]: 12: Hoare triple {204360#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {204361#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:15:16,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {204361#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {204362#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:15:16,228 INFO L290 TraceCheckUtils]: 14: Hoare triple {204362#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {204363#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:15:16,229 INFO L290 TraceCheckUtils]: 15: Hoare triple {204363#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {204364#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:15:16,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {204364#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {204365#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:15:16,230 INFO L290 TraceCheckUtils]: 17: Hoare triple {204365#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {204365#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:15:16,230 INFO L290 TraceCheckUtils]: 18: Hoare triple {204365#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {204366#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:15:16,231 INFO L290 TraceCheckUtils]: 19: Hoare triple {204366#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {204367#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:15:16,231 INFO L290 TraceCheckUtils]: 20: Hoare triple {204367#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {204368#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:15:16,232 INFO L290 TraceCheckUtils]: 21: Hoare triple {204368#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {204369#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:15:16,232 INFO L290 TraceCheckUtils]: 22: Hoare triple {204369#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {204350#false} is VALID [2022-04-08 10:15:16,232 INFO L290 TraceCheckUtils]: 23: Hoare triple {204350#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {204350#false} is VALID [2022-04-08 10:15:16,232 INFO L290 TraceCheckUtils]: 24: Hoare triple {204350#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {204350#false} is VALID [2022-04-08 10:15:16,232 INFO L290 TraceCheckUtils]: 25: Hoare triple {204350#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {204350#false} is VALID [2022-04-08 10:15:16,232 INFO L290 TraceCheckUtils]: 26: Hoare triple {204350#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {204350#false} is VALID [2022-04-08 10:15:16,232 INFO L290 TraceCheckUtils]: 27: Hoare triple {204350#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {204350#false} is VALID [2022-04-08 10:15:16,232 INFO L290 TraceCheckUtils]: 28: Hoare triple {204350#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {204350#false} is VALID [2022-04-08 10:15:16,232 INFO L290 TraceCheckUtils]: 29: Hoare triple {204350#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {204350#false} is VALID [2022-04-08 10:15:16,232 INFO L290 TraceCheckUtils]: 30: Hoare triple {204350#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {204350#false} is VALID [2022-04-08 10:15:16,232 INFO L290 TraceCheckUtils]: 31: Hoare triple {204350#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {204350#false} is VALID [2022-04-08 10:15:16,232 INFO L290 TraceCheckUtils]: 32: Hoare triple {204350#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {204350#false} is VALID [2022-04-08 10:15:16,233 INFO L290 TraceCheckUtils]: 33: Hoare triple {204350#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {204350#false} is VALID [2022-04-08 10:15:16,233 INFO L290 TraceCheckUtils]: 34: Hoare triple {204350#false} assume !(~y~0 % 4294967296 > 0); {204350#false} is VALID [2022-04-08 10:15:16,233 INFO L290 TraceCheckUtils]: 35: Hoare triple {204350#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {204350#false} is VALID [2022-04-08 10:15:16,233 INFO L290 TraceCheckUtils]: 36: Hoare triple {204350#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {204350#false} is VALID [2022-04-08 10:15:16,233 INFO L290 TraceCheckUtils]: 37: Hoare triple {204350#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {204350#false} is VALID [2022-04-08 10:15:16,233 INFO L290 TraceCheckUtils]: 38: Hoare triple {204350#false} assume !(~x~0 % 4294967296 > 0); {204350#false} is VALID [2022-04-08 10:15:16,233 INFO L272 TraceCheckUtils]: 39: Hoare triple {204350#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {204350#false} is VALID [2022-04-08 10:15:16,233 INFO L290 TraceCheckUtils]: 40: Hoare triple {204350#false} ~cond := #in~cond; {204350#false} is VALID [2022-04-08 10:15:16,233 INFO L290 TraceCheckUtils]: 41: Hoare triple {204350#false} assume 0 == ~cond; {204350#false} is VALID [2022-04-08 10:15:16,233 INFO L290 TraceCheckUtils]: 42: Hoare triple {204350#false} assume !false; {204350#false} is VALID [2022-04-08 10:15:16,233 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-08 10:15:16,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:15:16,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408465628] [2022-04-08 10:15:16,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408465628] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:15:16,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212854610] [2022-04-08 10:15:16,233 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:15:16,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:15:16,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:15:16,234 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:15:16,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Waiting until timeout for monitored process [2022-04-08 10:15:16,513 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 10:15:16,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:15:16,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 10:15:16,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:15:16,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:15:16,818 INFO L272 TraceCheckUtils]: 0: Hoare triple {204349#true} call ULTIMATE.init(); {204349#true} is VALID [2022-04-08 10:15:16,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {204349#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {204349#true} is VALID [2022-04-08 10:15:16,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {204349#true} assume true; {204349#true} is VALID [2022-04-08 10:15:16,818 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {204349#true} {204349#true} #72#return; {204349#true} is VALID [2022-04-08 10:15:16,818 INFO L272 TraceCheckUtils]: 4: Hoare triple {204349#true} call #t~ret13 := main(); {204349#true} is VALID [2022-04-08 10:15:16,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {204349#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {204354#(= main_~y~0 0)} is VALID [2022-04-08 10:15:16,819 INFO L290 TraceCheckUtils]: 6: Hoare triple {204354#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {204355#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:15:16,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {204355#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {204356#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:15:16,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {204356#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {204357#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:15:16,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {204357#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {204358#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:15:16,821 INFO L290 TraceCheckUtils]: 10: Hoare triple {204358#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {204359#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:15:16,822 INFO L290 TraceCheckUtils]: 11: Hoare triple {204359#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {204360#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:15:16,822 INFO L290 TraceCheckUtils]: 12: Hoare triple {204360#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {204361#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:15:16,823 INFO L290 TraceCheckUtils]: 13: Hoare triple {204361#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {204362#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:15:16,823 INFO L290 TraceCheckUtils]: 14: Hoare triple {204362#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {204363#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:15:16,824 INFO L290 TraceCheckUtils]: 15: Hoare triple {204363#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {204364#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:15:16,824 INFO L290 TraceCheckUtils]: 16: Hoare triple {204364#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {204365#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:15:16,824 INFO L290 TraceCheckUtils]: 17: Hoare triple {204365#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {204365#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:15:16,825 INFO L290 TraceCheckUtils]: 18: Hoare triple {204365#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {204366#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:15:16,825 INFO L290 TraceCheckUtils]: 19: Hoare triple {204366#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {204367#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:15:16,826 INFO L290 TraceCheckUtils]: 20: Hoare triple {204367#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {204368#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:15:16,826 INFO L290 TraceCheckUtils]: 21: Hoare triple {204368#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {204437#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:15:16,827 INFO L290 TraceCheckUtils]: 22: Hoare triple {204437#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {204350#false} is VALID [2022-04-08 10:15:16,827 INFO L290 TraceCheckUtils]: 23: Hoare triple {204350#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {204350#false} is VALID [2022-04-08 10:15:16,827 INFO L290 TraceCheckUtils]: 24: Hoare triple {204350#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {204350#false} is VALID [2022-04-08 10:15:16,827 INFO L290 TraceCheckUtils]: 25: Hoare triple {204350#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {204350#false} is VALID [2022-04-08 10:15:16,827 INFO L290 TraceCheckUtils]: 26: Hoare triple {204350#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {204350#false} is VALID [2022-04-08 10:15:16,827 INFO L290 TraceCheckUtils]: 27: Hoare triple {204350#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {204350#false} is VALID [2022-04-08 10:15:16,827 INFO L290 TraceCheckUtils]: 28: Hoare triple {204350#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {204350#false} is VALID [2022-04-08 10:15:16,827 INFO L290 TraceCheckUtils]: 29: Hoare triple {204350#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {204350#false} is VALID [2022-04-08 10:15:16,827 INFO L290 TraceCheckUtils]: 30: Hoare triple {204350#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {204350#false} is VALID [2022-04-08 10:15:16,827 INFO L290 TraceCheckUtils]: 31: Hoare triple {204350#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {204350#false} is VALID [2022-04-08 10:15:16,827 INFO L290 TraceCheckUtils]: 32: Hoare triple {204350#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {204350#false} is VALID [2022-04-08 10:15:16,827 INFO L290 TraceCheckUtils]: 33: Hoare triple {204350#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {204350#false} is VALID [2022-04-08 10:15:16,827 INFO L290 TraceCheckUtils]: 34: Hoare triple {204350#false} assume !(~y~0 % 4294967296 > 0); {204350#false} is VALID [2022-04-08 10:15:16,827 INFO L290 TraceCheckUtils]: 35: Hoare triple {204350#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {204350#false} is VALID [2022-04-08 10:15:16,827 INFO L290 TraceCheckUtils]: 36: Hoare triple {204350#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {204350#false} is VALID [2022-04-08 10:15:16,827 INFO L290 TraceCheckUtils]: 37: Hoare triple {204350#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {204350#false} is VALID [2022-04-08 10:15:16,828 INFO L290 TraceCheckUtils]: 38: Hoare triple {204350#false} assume !(~x~0 % 4294967296 > 0); {204350#false} is VALID [2022-04-08 10:15:16,828 INFO L272 TraceCheckUtils]: 39: Hoare triple {204350#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {204350#false} is VALID [2022-04-08 10:15:16,828 INFO L290 TraceCheckUtils]: 40: Hoare triple {204350#false} ~cond := #in~cond; {204350#false} is VALID [2022-04-08 10:15:16,828 INFO L290 TraceCheckUtils]: 41: Hoare triple {204350#false} assume 0 == ~cond; {204350#false} is VALID [2022-04-08 10:15:16,828 INFO L290 TraceCheckUtils]: 42: Hoare triple {204350#false} assume !false; {204350#false} is VALID [2022-04-08 10:15:16,828 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-08 10:15:16,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:15:17,227 INFO L290 TraceCheckUtils]: 42: Hoare triple {204350#false} assume !false; {204350#false} is VALID [2022-04-08 10:15:17,227 INFO L290 TraceCheckUtils]: 41: Hoare triple {204350#false} assume 0 == ~cond; {204350#false} is VALID [2022-04-08 10:15:17,227 INFO L290 TraceCheckUtils]: 40: Hoare triple {204350#false} ~cond := #in~cond; {204350#false} is VALID [2022-04-08 10:15:17,227 INFO L272 TraceCheckUtils]: 39: Hoare triple {204350#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {204350#false} is VALID [2022-04-08 10:15:17,227 INFO L290 TraceCheckUtils]: 38: Hoare triple {204350#false} assume !(~x~0 % 4294967296 > 0); {204350#false} is VALID [2022-04-08 10:15:17,227 INFO L290 TraceCheckUtils]: 37: Hoare triple {204350#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {204350#false} is VALID [2022-04-08 10:15:17,227 INFO L290 TraceCheckUtils]: 36: Hoare triple {204350#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {204350#false} is VALID [2022-04-08 10:15:17,227 INFO L290 TraceCheckUtils]: 35: Hoare triple {204350#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {204350#false} is VALID [2022-04-08 10:15:17,227 INFO L290 TraceCheckUtils]: 34: Hoare triple {204350#false} assume !(~y~0 % 4294967296 > 0); {204350#false} is VALID [2022-04-08 10:15:17,227 INFO L290 TraceCheckUtils]: 33: Hoare triple {204350#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {204350#false} is VALID [2022-04-08 10:15:17,227 INFO L290 TraceCheckUtils]: 32: Hoare triple {204350#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {204350#false} is VALID [2022-04-08 10:15:17,227 INFO L290 TraceCheckUtils]: 31: Hoare triple {204350#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {204350#false} is VALID [2022-04-08 10:15:17,227 INFO L290 TraceCheckUtils]: 30: Hoare triple {204350#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {204350#false} is VALID [2022-04-08 10:15:17,227 INFO L290 TraceCheckUtils]: 29: Hoare triple {204350#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {204350#false} is VALID [2022-04-08 10:15:17,227 INFO L290 TraceCheckUtils]: 28: Hoare triple {204350#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {204350#false} is VALID [2022-04-08 10:15:17,227 INFO L290 TraceCheckUtils]: 27: Hoare triple {204350#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {204350#false} is VALID [2022-04-08 10:15:17,228 INFO L290 TraceCheckUtils]: 26: Hoare triple {204350#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {204350#false} is VALID [2022-04-08 10:15:17,228 INFO L290 TraceCheckUtils]: 25: Hoare triple {204350#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {204350#false} is VALID [2022-04-08 10:15:17,228 INFO L290 TraceCheckUtils]: 24: Hoare triple {204350#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {204350#false} is VALID [2022-04-08 10:15:17,228 INFO L290 TraceCheckUtils]: 23: Hoare triple {204350#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {204350#false} is VALID [2022-04-08 10:15:17,228 INFO L290 TraceCheckUtils]: 22: Hoare triple {204561#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {204350#false} is VALID [2022-04-08 10:15:17,229 INFO L290 TraceCheckUtils]: 21: Hoare triple {204565#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {204561#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:15:17,229 INFO L290 TraceCheckUtils]: 20: Hoare triple {204569#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {204565#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:15:17,230 INFO L290 TraceCheckUtils]: 19: Hoare triple {204573#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {204569#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:15:17,230 INFO L290 TraceCheckUtils]: 18: Hoare triple {204577#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {204573#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:15:17,230 INFO L290 TraceCheckUtils]: 17: Hoare triple {204577#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {204577#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:15:17,231 INFO L290 TraceCheckUtils]: 16: Hoare triple {204584#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {204577#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:15:17,232 INFO L290 TraceCheckUtils]: 15: Hoare triple {204588#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {204584#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:15:17,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {204592#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {204588#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:15:17,233 INFO L290 TraceCheckUtils]: 13: Hoare triple {204596#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {204592#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:15:17,233 INFO L290 TraceCheckUtils]: 12: Hoare triple {204600#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {204596#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:15:17,234 INFO L290 TraceCheckUtils]: 11: Hoare triple {204604#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {204600#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:15:17,235 INFO L290 TraceCheckUtils]: 10: Hoare triple {204608#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {204604#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:15:17,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {204612#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {204608#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:15:17,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {204616#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {204612#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:15:17,236 INFO L290 TraceCheckUtils]: 7: Hoare triple {204620#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {204616#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:15:17,237 INFO L290 TraceCheckUtils]: 6: Hoare triple {204624#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {204620#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:15:17,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {204349#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {204624#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:15:17,237 INFO L272 TraceCheckUtils]: 4: Hoare triple {204349#true} call #t~ret13 := main(); {204349#true} is VALID [2022-04-08 10:15:17,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {204349#true} {204349#true} #72#return; {204349#true} is VALID [2022-04-08 10:15:17,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {204349#true} assume true; {204349#true} is VALID [2022-04-08 10:15:17,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {204349#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {204349#true} is VALID [2022-04-08 10:15:17,237 INFO L272 TraceCheckUtils]: 0: Hoare triple {204349#true} call ULTIMATE.init(); {204349#true} is VALID [2022-04-08 10:15:17,238 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-08 10:15:17,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212854610] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:15:17,238 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:15:17,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-08 10:15:17,238 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:15:17,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2056463506] [2022-04-08 10:15:17,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2056463506] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:15:17,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:15:17,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 10:15:17,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087148098] [2022-04-08 10:15:17,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:15:17,238 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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 43 [2022-04-08 10:15:17,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:15:17,238 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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-08 10:15:17,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:15:17,255 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 10:15:17,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:15:17,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 10:15:17,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1027, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 10:15:17,256 INFO L87 Difference]: Start difference. First operand 606 states and 823 transitions. Second operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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-08 10:15:24,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:15:24,994 INFO L93 Difference]: Finished difference Result 777 states and 1005 transitions. [2022-04-08 10:15:24,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-08 10:15:24,995 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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 43 [2022-04-08 10:15:24,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:15:24,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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-08 10:15:24,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 118 transitions. [2022-04-08 10:15:24,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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-08 10:15:24,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 118 transitions. [2022-04-08 10:15:24,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 118 transitions. [2022-04-08 10:15:25,058 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:15:25,082 INFO L225 Difference]: With dead ends: 777 [2022-04-08 10:15:25,082 INFO L226 Difference]: Without dead ends: 756 [2022-04-08 10:15:25,082 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=653, Invalid=2653, Unknown=0, NotChecked=0, Total=3306 [2022-04-08 10:15:25,082 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 60 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1235 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-08 10:15:25,082 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 118 Invalid, 1304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1235 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-08 10:15:25,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2022-04-08 10:15:27,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 606. [2022-04-08 10:15:27,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:15:27,301 INFO L82 GeneralOperation]: Start isEquivalent. First operand 756 states. Second operand has 606 states, 601 states have (on average 1.3610648918469217) internal successors, (818), 601 states have internal predecessors, (818), 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-08 10:15:27,301 INFO L74 IsIncluded]: Start isIncluded. First operand 756 states. Second operand has 606 states, 601 states have (on average 1.3610648918469217) internal successors, (818), 601 states have internal predecessors, (818), 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-08 10:15:27,302 INFO L87 Difference]: Start difference. First operand 756 states. Second operand has 606 states, 601 states have (on average 1.3610648918469217) internal successors, (818), 601 states have internal predecessors, (818), 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-08 10:15:27,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:15:27,316 INFO L93 Difference]: Finished difference Result 756 states and 984 transitions. [2022-04-08 10:15:27,316 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 984 transitions. [2022-04-08 10:15:27,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:15:27,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:15:27,316 INFO L74 IsIncluded]: Start isIncluded. First operand has 606 states, 601 states have (on average 1.3610648918469217) internal successors, (818), 601 states have internal predecessors, (818), 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 756 states. [2022-04-08 10:15:27,317 INFO L87 Difference]: Start difference. First operand has 606 states, 601 states have (on average 1.3610648918469217) internal successors, (818), 601 states have internal predecessors, (818), 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 756 states. [2022-04-08 10:15:27,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:15:27,331 INFO L93 Difference]: Finished difference Result 756 states and 984 transitions. [2022-04-08 10:15:27,331 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 984 transitions. [2022-04-08 10:15:27,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:15:27,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:15:27,331 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:15:27,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:15:27,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 601 states have (on average 1.3610648918469217) internal successors, (818), 601 states have internal predecessors, (818), 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-08 10:15:27,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 822 transitions. [2022-04-08 10:15:27,345 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 822 transitions. Word has length 43 [2022-04-08 10:15:27,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:15:27,345 INFO L478 AbstractCegarLoop]: Abstraction has 606 states and 822 transitions. [2022-04-08 10:15:27,345 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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-08 10:15:27,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 606 states and 822 transitions. [2022-04-08 10:15:32,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 822 edges. 822 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:15:32,692 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 822 transitions. [2022-04-08 10:15:32,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 10:15:32,692 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:15:32,692 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:15:32,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Forceful destruction successful, exit code 0 [2022-04-08 10:15:32,896 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,91 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:15:32,896 INFO L403 AbstractCegarLoop]: === Iteration 94 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:15:32,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:15:32,897 INFO L85 PathProgramCache]: Analyzing trace with hash -2096516008, now seen corresponding path program 91 times [2022-04-08 10:15:32,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:15:32,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1274835827] [2022-04-08 10:15:32,898 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:15:32,899 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:15:32,899 INFO L85 PathProgramCache]: Analyzing trace with hash -2096516008, now seen corresponding path program 92 times [2022-04-08 10:15:32,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:15:32,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509433089] [2022-04-08 10:15:32,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:15:32,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:15:32,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:15:33,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:15:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:15:33,158 INFO L290 TraceCheckUtils]: 0: Hoare triple {208988#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {208967#true} is VALID [2022-04-08 10:15:33,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {208967#true} assume true; {208967#true} is VALID [2022-04-08 10:15:33,158 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {208967#true} {208967#true} #72#return; {208967#true} is VALID [2022-04-08 10:15:33,158 INFO L272 TraceCheckUtils]: 0: Hoare triple {208967#true} call ULTIMATE.init(); {208988#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:15:33,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {208988#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {208967#true} is VALID [2022-04-08 10:15:33,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {208967#true} assume true; {208967#true} is VALID [2022-04-08 10:15:33,159 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {208967#true} {208967#true} #72#return; {208967#true} is VALID [2022-04-08 10:15:33,159 INFO L272 TraceCheckUtils]: 4: Hoare triple {208967#true} call #t~ret13 := main(); {208967#true} is VALID [2022-04-08 10:15:33,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {208967#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {208972#(= main_~y~0 0)} is VALID [2022-04-08 10:15:33,159 INFO L290 TraceCheckUtils]: 6: Hoare triple {208972#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {208973#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:15:33,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {208973#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {208974#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:15:33,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {208974#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {208975#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:15:33,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {208975#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {208976#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:15:33,161 INFO L290 TraceCheckUtils]: 10: Hoare triple {208976#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {208977#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:15:33,162 INFO L290 TraceCheckUtils]: 11: Hoare triple {208977#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {208978#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:15:33,162 INFO L290 TraceCheckUtils]: 12: Hoare triple {208978#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {208979#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:15:33,163 INFO L290 TraceCheckUtils]: 13: Hoare triple {208979#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {208980#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:15:33,163 INFO L290 TraceCheckUtils]: 14: Hoare triple {208980#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {208981#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:15:33,164 INFO L290 TraceCheckUtils]: 15: Hoare triple {208981#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {208982#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:15:33,164 INFO L290 TraceCheckUtils]: 16: Hoare triple {208982#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {208983#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:15:33,165 INFO L290 TraceCheckUtils]: 17: Hoare triple {208983#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {208984#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:15:33,165 INFO L290 TraceCheckUtils]: 18: Hoare triple {208984#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {208984#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:15:33,165 INFO L290 TraceCheckUtils]: 19: Hoare triple {208984#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {208985#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:15:33,166 INFO L290 TraceCheckUtils]: 20: Hoare triple {208985#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {208986#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:15:33,167 INFO L290 TraceCheckUtils]: 21: Hoare triple {208986#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {208987#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:15:33,167 INFO L290 TraceCheckUtils]: 22: Hoare triple {208987#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {208968#false} is VALID [2022-04-08 10:15:33,167 INFO L290 TraceCheckUtils]: 23: Hoare triple {208968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {208968#false} is VALID [2022-04-08 10:15:33,167 INFO L290 TraceCheckUtils]: 24: Hoare triple {208968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {208968#false} is VALID [2022-04-08 10:15:33,167 INFO L290 TraceCheckUtils]: 25: Hoare triple {208968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {208968#false} is VALID [2022-04-08 10:15:33,167 INFO L290 TraceCheckUtils]: 26: Hoare triple {208968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {208968#false} is VALID [2022-04-08 10:15:33,167 INFO L290 TraceCheckUtils]: 27: Hoare triple {208968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {208968#false} is VALID [2022-04-08 10:15:33,167 INFO L290 TraceCheckUtils]: 28: Hoare triple {208968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {208968#false} is VALID [2022-04-08 10:15:33,167 INFO L290 TraceCheckUtils]: 29: Hoare triple {208968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {208968#false} is VALID [2022-04-08 10:15:33,167 INFO L290 TraceCheckUtils]: 30: Hoare triple {208968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {208968#false} is VALID [2022-04-08 10:15:33,167 INFO L290 TraceCheckUtils]: 31: Hoare triple {208968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {208968#false} is VALID [2022-04-08 10:15:33,167 INFO L290 TraceCheckUtils]: 32: Hoare triple {208968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {208968#false} is VALID [2022-04-08 10:15:33,168 INFO L290 TraceCheckUtils]: 33: Hoare triple {208968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {208968#false} is VALID [2022-04-08 10:15:33,168 INFO L290 TraceCheckUtils]: 34: Hoare triple {208968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {208968#false} is VALID [2022-04-08 10:15:33,168 INFO L290 TraceCheckUtils]: 35: Hoare triple {208968#false} assume !(~y~0 % 4294967296 > 0); {208968#false} is VALID [2022-04-08 10:15:33,168 INFO L290 TraceCheckUtils]: 36: Hoare triple {208968#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {208968#false} is VALID [2022-04-08 10:15:33,168 INFO L290 TraceCheckUtils]: 37: Hoare triple {208968#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {208968#false} is VALID [2022-04-08 10:15:33,168 INFO L290 TraceCheckUtils]: 38: Hoare triple {208968#false} assume !(~x~0 % 4294967296 > 0); {208968#false} is VALID [2022-04-08 10:15:33,168 INFO L272 TraceCheckUtils]: 39: Hoare triple {208968#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {208968#false} is VALID [2022-04-08 10:15:33,168 INFO L290 TraceCheckUtils]: 40: Hoare triple {208968#false} ~cond := #in~cond; {208968#false} is VALID [2022-04-08 10:15:33,168 INFO L290 TraceCheckUtils]: 41: Hoare triple {208968#false} assume 0 == ~cond; {208968#false} is VALID [2022-04-08 10:15:33,168 INFO L290 TraceCheckUtils]: 42: Hoare triple {208968#false} assume !false; {208968#false} is VALID [2022-04-08 10:15:33,168 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-04-08 10:15:33,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:15:33,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509433089] [2022-04-08 10:15:33,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509433089] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:15:33,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488959879] [2022-04-08 10:15:33,168 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:15:33,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:15:33,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:15:33,169 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:15:33,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Waiting until timeout for monitored process [2022-04-08 10:15:33,220 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:15:33,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:15:33,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 10:15:33,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:15:33,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:15:33,566 INFO L272 TraceCheckUtils]: 0: Hoare triple {208967#true} call ULTIMATE.init(); {208967#true} is VALID [2022-04-08 10:15:33,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {208967#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {208967#true} is VALID [2022-04-08 10:15:33,566 INFO L290 TraceCheckUtils]: 2: Hoare triple {208967#true} assume true; {208967#true} is VALID [2022-04-08 10:15:33,566 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {208967#true} {208967#true} #72#return; {208967#true} is VALID [2022-04-08 10:15:33,566 INFO L272 TraceCheckUtils]: 4: Hoare triple {208967#true} call #t~ret13 := main(); {208967#true} is VALID [2022-04-08 10:15:33,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {208967#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {208972#(= main_~y~0 0)} is VALID [2022-04-08 10:15:33,567 INFO L290 TraceCheckUtils]: 6: Hoare triple {208972#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {208973#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:15:33,567 INFO L290 TraceCheckUtils]: 7: Hoare triple {208973#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {208974#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:15:33,568 INFO L290 TraceCheckUtils]: 8: Hoare triple {208974#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {208975#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:15:33,568 INFO L290 TraceCheckUtils]: 9: Hoare triple {208975#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {208976#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:15:33,569 INFO L290 TraceCheckUtils]: 10: Hoare triple {208976#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {208977#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:15:33,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {208977#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {208978#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:15:33,570 INFO L290 TraceCheckUtils]: 12: Hoare triple {208978#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {208979#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:15:33,570 INFO L290 TraceCheckUtils]: 13: Hoare triple {208979#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {208980#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:15:33,571 INFO L290 TraceCheckUtils]: 14: Hoare triple {208980#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {208981#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:15:33,571 INFO L290 TraceCheckUtils]: 15: Hoare triple {208981#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {208982#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:15:33,572 INFO L290 TraceCheckUtils]: 16: Hoare triple {208982#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {208983#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:15:33,572 INFO L290 TraceCheckUtils]: 17: Hoare triple {208983#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {208984#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:15:33,573 INFO L290 TraceCheckUtils]: 18: Hoare triple {208984#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {208984#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:15:33,573 INFO L290 TraceCheckUtils]: 19: Hoare triple {208984#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {208985#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:15:33,573 INFO L290 TraceCheckUtils]: 20: Hoare triple {208985#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {208986#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-08 10:15:33,574 INFO L290 TraceCheckUtils]: 21: Hoare triple {208986#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {209055#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:15:33,574 INFO L290 TraceCheckUtils]: 22: Hoare triple {209055#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {208968#false} is VALID [2022-04-08 10:15:33,574 INFO L290 TraceCheckUtils]: 23: Hoare triple {208968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {208968#false} is VALID [2022-04-08 10:15:33,574 INFO L290 TraceCheckUtils]: 24: Hoare triple {208968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {208968#false} is VALID [2022-04-08 10:15:33,574 INFO L290 TraceCheckUtils]: 25: Hoare triple {208968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {208968#false} is VALID [2022-04-08 10:15:33,575 INFO L290 TraceCheckUtils]: 26: Hoare triple {208968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {208968#false} is VALID [2022-04-08 10:15:33,575 INFO L290 TraceCheckUtils]: 27: Hoare triple {208968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {208968#false} is VALID [2022-04-08 10:15:33,575 INFO L290 TraceCheckUtils]: 28: Hoare triple {208968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {208968#false} is VALID [2022-04-08 10:15:33,575 INFO L290 TraceCheckUtils]: 29: Hoare triple {208968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {208968#false} is VALID [2022-04-08 10:15:33,575 INFO L290 TraceCheckUtils]: 30: Hoare triple {208968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {208968#false} is VALID [2022-04-08 10:15:33,575 INFO L290 TraceCheckUtils]: 31: Hoare triple {208968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {208968#false} is VALID [2022-04-08 10:15:33,575 INFO L290 TraceCheckUtils]: 32: Hoare triple {208968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {208968#false} is VALID [2022-04-08 10:15:33,575 INFO L290 TraceCheckUtils]: 33: Hoare triple {208968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {208968#false} is VALID [2022-04-08 10:15:33,575 INFO L290 TraceCheckUtils]: 34: Hoare triple {208968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {208968#false} is VALID [2022-04-08 10:15:33,575 INFO L290 TraceCheckUtils]: 35: Hoare triple {208968#false} assume !(~y~0 % 4294967296 > 0); {208968#false} is VALID [2022-04-08 10:15:33,575 INFO L290 TraceCheckUtils]: 36: Hoare triple {208968#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {208968#false} is VALID [2022-04-08 10:15:33,575 INFO L290 TraceCheckUtils]: 37: Hoare triple {208968#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {208968#false} is VALID [2022-04-08 10:15:33,575 INFO L290 TraceCheckUtils]: 38: Hoare triple {208968#false} assume !(~x~0 % 4294967296 > 0); {208968#false} is VALID [2022-04-08 10:15:33,575 INFO L272 TraceCheckUtils]: 39: Hoare triple {208968#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {208968#false} is VALID [2022-04-08 10:15:33,575 INFO L290 TraceCheckUtils]: 40: Hoare triple {208968#false} ~cond := #in~cond; {208968#false} is VALID [2022-04-08 10:15:33,575 INFO L290 TraceCheckUtils]: 41: Hoare triple {208968#false} assume 0 == ~cond; {208968#false} is VALID [2022-04-08 10:15:33,575 INFO L290 TraceCheckUtils]: 42: Hoare triple {208968#false} assume !false; {208968#false} is VALID [2022-04-08 10:15:33,575 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-04-08 10:15:33,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:15:34,045 INFO L290 TraceCheckUtils]: 42: Hoare triple {208968#false} assume !false; {208968#false} is VALID [2022-04-08 10:15:34,045 INFO L290 TraceCheckUtils]: 41: Hoare triple {208968#false} assume 0 == ~cond; {208968#false} is VALID [2022-04-08 10:15:34,045 INFO L290 TraceCheckUtils]: 40: Hoare triple {208968#false} ~cond := #in~cond; {208968#false} is VALID [2022-04-08 10:15:34,045 INFO L272 TraceCheckUtils]: 39: Hoare triple {208968#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {208968#false} is VALID [2022-04-08 10:15:34,045 INFO L290 TraceCheckUtils]: 38: Hoare triple {208968#false} assume !(~x~0 % 4294967296 > 0); {208968#false} is VALID [2022-04-08 10:15:34,045 INFO L290 TraceCheckUtils]: 37: Hoare triple {208968#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {208968#false} is VALID [2022-04-08 10:15:34,045 INFO L290 TraceCheckUtils]: 36: Hoare triple {208968#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {208968#false} is VALID [2022-04-08 10:15:34,045 INFO L290 TraceCheckUtils]: 35: Hoare triple {208968#false} assume !(~y~0 % 4294967296 > 0); {208968#false} is VALID [2022-04-08 10:15:34,045 INFO L290 TraceCheckUtils]: 34: Hoare triple {208968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {208968#false} is VALID [2022-04-08 10:15:34,045 INFO L290 TraceCheckUtils]: 33: Hoare triple {208968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {208968#false} is VALID [2022-04-08 10:15:34,046 INFO L290 TraceCheckUtils]: 32: Hoare triple {208968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {208968#false} is VALID [2022-04-08 10:15:34,046 INFO L290 TraceCheckUtils]: 31: Hoare triple {208968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {208968#false} is VALID [2022-04-08 10:15:34,046 INFO L290 TraceCheckUtils]: 30: Hoare triple {208968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {208968#false} is VALID [2022-04-08 10:15:34,046 INFO L290 TraceCheckUtils]: 29: Hoare triple {208968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {208968#false} is VALID [2022-04-08 10:15:34,046 INFO L290 TraceCheckUtils]: 28: Hoare triple {208968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {208968#false} is VALID [2022-04-08 10:15:34,046 INFO L290 TraceCheckUtils]: 27: Hoare triple {208968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {208968#false} is VALID [2022-04-08 10:15:34,046 INFO L290 TraceCheckUtils]: 26: Hoare triple {208968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {208968#false} is VALID [2022-04-08 10:15:34,046 INFO L290 TraceCheckUtils]: 25: Hoare triple {208968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {208968#false} is VALID [2022-04-08 10:15:34,046 INFO L290 TraceCheckUtils]: 24: Hoare triple {208968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {208968#false} is VALID [2022-04-08 10:15:34,046 INFO L290 TraceCheckUtils]: 23: Hoare triple {208968#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {208968#false} is VALID [2022-04-08 10:15:34,046 INFO L290 TraceCheckUtils]: 22: Hoare triple {209179#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {208968#false} is VALID [2022-04-08 10:15:34,047 INFO L290 TraceCheckUtils]: 21: Hoare triple {209183#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {209179#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:15:34,048 INFO L290 TraceCheckUtils]: 20: Hoare triple {209187#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {209183#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:15:34,048 INFO L290 TraceCheckUtils]: 19: Hoare triple {209191#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {209187#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:15:34,049 INFO L290 TraceCheckUtils]: 18: Hoare triple {209191#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {209191#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:15:34,049 INFO L290 TraceCheckUtils]: 17: Hoare triple {209198#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {209191#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:15:34,050 INFO L290 TraceCheckUtils]: 16: Hoare triple {209202#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {209198#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:15:34,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {209206#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {209202#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:15:34,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {209210#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {209206#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:15:34,052 INFO L290 TraceCheckUtils]: 13: Hoare triple {209214#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {209210#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:15:34,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {209218#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {209214#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:15:34,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {209222#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {209218#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:15:34,054 INFO L290 TraceCheckUtils]: 10: Hoare triple {209226#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {209222#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:15:34,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {209230#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {209226#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:15:34,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {209234#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {209230#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:15:34,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {209238#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {209234#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:15:34,057 INFO L290 TraceCheckUtils]: 6: Hoare triple {209242#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {209238#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:15:34,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {208967#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {209242#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:15:34,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {208967#true} call #t~ret13 := main(); {208967#true} is VALID [2022-04-08 10:15:34,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {208967#true} {208967#true} #72#return; {208967#true} is VALID [2022-04-08 10:15:34,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {208967#true} assume true; {208967#true} is VALID [2022-04-08 10:15:34,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {208967#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {208967#true} is VALID [2022-04-08 10:15:34,057 INFO L272 TraceCheckUtils]: 0: Hoare triple {208967#true} call ULTIMATE.init(); {208967#true} is VALID [2022-04-08 10:15:34,057 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-04-08 10:15:34,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488959879] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:15:34,058 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:15:34,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-08 10:15:34,058 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:15:34,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1274835827] [2022-04-08 10:15:34,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1274835827] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:15:34,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:15:34,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 10:15:34,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843714853] [2022-04-08 10:15:34,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:15:34,058 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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 43 [2022-04-08 10:15:34,058 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:15:34,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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-08 10:15:34,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:15:34,078 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 10:15:34,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:15:34,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 10:15:34,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=1010, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 10:15:34,079 INFO L87 Difference]: Start difference. First operand 606 states and 822 transitions. Second operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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-08 10:15:43,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:15:43,004 INFO L93 Difference]: Finished difference Result 803 states and 1031 transitions. [2022-04-08 10:15:43,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 10:15:43,004 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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 43 [2022-04-08 10:15:43,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:15:43,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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-08 10:15:43,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 123 transitions. [2022-04-08 10:15:43,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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-08 10:15:43,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 123 transitions. [2022-04-08 10:15:43,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 123 transitions. [2022-04-08 10:15:43,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:15:43,092 INFO L225 Difference]: With dead ends: 803 [2022-04-08 10:15:43,092 INFO L226 Difference]: Without dead ends: 782 [2022-04-08 10:15:43,092 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=606, Invalid=2364, Unknown=0, NotChecked=0, Total=2970 [2022-04-08 10:15:43,092 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 69 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1416 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 1479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:15:43,092 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 129 Invalid, 1479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1416 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-08 10:15:43,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2022-04-08 10:15:45,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 606. [2022-04-08 10:15:45,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:15:45,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 782 states. Second operand has 606 states, 601 states have (on average 1.3594009983361064) internal successors, (817), 601 states have internal predecessors, (817), 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-08 10:15:45,358 INFO L74 IsIncluded]: Start isIncluded. First operand 782 states. Second operand has 606 states, 601 states have (on average 1.3594009983361064) internal successors, (817), 601 states have internal predecessors, (817), 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-08 10:15:45,359 INFO L87 Difference]: Start difference. First operand 782 states. Second operand has 606 states, 601 states have (on average 1.3594009983361064) internal successors, (817), 601 states have internal predecessors, (817), 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-08 10:15:45,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:15:45,375 INFO L93 Difference]: Finished difference Result 782 states and 1010 transitions. [2022-04-08 10:15:45,375 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1010 transitions. [2022-04-08 10:15:45,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:15:45,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:15:45,376 INFO L74 IsIncluded]: Start isIncluded. First operand has 606 states, 601 states have (on average 1.3594009983361064) internal successors, (817), 601 states have internal predecessors, (817), 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 782 states. [2022-04-08 10:15:45,376 INFO L87 Difference]: Start difference. First operand has 606 states, 601 states have (on average 1.3594009983361064) internal successors, (817), 601 states have internal predecessors, (817), 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 782 states. [2022-04-08 10:15:45,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:15:45,393 INFO L93 Difference]: Finished difference Result 782 states and 1010 transitions. [2022-04-08 10:15:45,393 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1010 transitions. [2022-04-08 10:15:45,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:15:45,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:15:45,393 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:15:45,393 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:15:45,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 601 states have (on average 1.3594009983361064) internal successors, (817), 601 states have internal predecessors, (817), 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-08 10:15:45,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 821 transitions. [2022-04-08 10:15:45,407 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 821 transitions. Word has length 43 [2022-04-08 10:15:45,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:15:45,407 INFO L478 AbstractCegarLoop]: Abstraction has 606 states and 821 transitions. [2022-04-08 10:15:45,407 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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-08 10:15:45,407 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 606 states and 821 transitions. [2022-04-08 10:15:50,211 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 821 edges. 821 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:15:50,211 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 821 transitions. [2022-04-08 10:15:50,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 10:15:50,211 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:15:50,211 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:15:50,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Forceful destruction successful, exit code 0 [2022-04-08 10:15:50,412 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,92 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:15:50,412 INFO L403 AbstractCegarLoop]: === Iteration 95 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:15:50,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:15:50,412 INFO L85 PathProgramCache]: Analyzing trace with hash 666102088, now seen corresponding path program 93 times [2022-04-08 10:15:50,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:15:50,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1667113692] [2022-04-08 10:15:50,414 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:15:50,414 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:15:50,414 INFO L85 PathProgramCache]: Analyzing trace with hash 666102088, now seen corresponding path program 94 times [2022-04-08 10:15:50,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:15:50,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141026576] [2022-04-08 10:15:50,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:15:50,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:15:50,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:15:50,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:15:50,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:15:50,618 INFO L290 TraceCheckUtils]: 0: Hoare triple {213704#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {213683#true} is VALID [2022-04-08 10:15:50,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {213683#true} assume true; {213683#true} is VALID [2022-04-08 10:15:50,618 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {213683#true} {213683#true} #72#return; {213683#true} is VALID [2022-04-08 10:15:50,619 INFO L272 TraceCheckUtils]: 0: Hoare triple {213683#true} call ULTIMATE.init(); {213704#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:15:50,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {213704#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {213683#true} is VALID [2022-04-08 10:15:50,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {213683#true} assume true; {213683#true} is VALID [2022-04-08 10:15:50,619 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {213683#true} {213683#true} #72#return; {213683#true} is VALID [2022-04-08 10:15:50,619 INFO L272 TraceCheckUtils]: 4: Hoare triple {213683#true} call #t~ret13 := main(); {213683#true} is VALID [2022-04-08 10:15:50,619 INFO L290 TraceCheckUtils]: 5: Hoare triple {213683#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {213688#(= main_~y~0 0)} is VALID [2022-04-08 10:15:50,620 INFO L290 TraceCheckUtils]: 6: Hoare triple {213688#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {213689#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:15:50,620 INFO L290 TraceCheckUtils]: 7: Hoare triple {213689#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {213690#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:15:50,620 INFO L290 TraceCheckUtils]: 8: Hoare triple {213690#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {213691#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:15:50,621 INFO L290 TraceCheckUtils]: 9: Hoare triple {213691#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {213692#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:15:50,621 INFO L290 TraceCheckUtils]: 10: Hoare triple {213692#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {213693#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:15:50,622 INFO L290 TraceCheckUtils]: 11: Hoare triple {213693#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {213694#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:15:50,622 INFO L290 TraceCheckUtils]: 12: Hoare triple {213694#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {213695#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:15:50,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {213695#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {213696#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:15:50,623 INFO L290 TraceCheckUtils]: 14: Hoare triple {213696#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {213697#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:15:50,624 INFO L290 TraceCheckUtils]: 15: Hoare triple {213697#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {213698#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:15:50,624 INFO L290 TraceCheckUtils]: 16: Hoare triple {213698#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {213699#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:15:50,625 INFO L290 TraceCheckUtils]: 17: Hoare triple {213699#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {213700#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:15:50,625 INFO L290 TraceCheckUtils]: 18: Hoare triple {213700#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {213701#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:15:50,625 INFO L290 TraceCheckUtils]: 19: Hoare triple {213701#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {213701#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:15:50,626 INFO L290 TraceCheckUtils]: 20: Hoare triple {213701#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {213702#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:15:50,626 INFO L290 TraceCheckUtils]: 21: Hoare triple {213702#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {213703#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} is VALID [2022-04-08 10:15:50,626 INFO L290 TraceCheckUtils]: 22: Hoare triple {213703#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {213684#false} is VALID [2022-04-08 10:15:50,626 INFO L290 TraceCheckUtils]: 23: Hoare triple {213684#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {213684#false} is VALID [2022-04-08 10:15:50,627 INFO L290 TraceCheckUtils]: 24: Hoare triple {213684#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {213684#false} is VALID [2022-04-08 10:15:50,627 INFO L290 TraceCheckUtils]: 25: Hoare triple {213684#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {213684#false} is VALID [2022-04-08 10:15:50,627 INFO L290 TraceCheckUtils]: 26: Hoare triple {213684#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {213684#false} is VALID [2022-04-08 10:15:50,627 INFO L290 TraceCheckUtils]: 27: Hoare triple {213684#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {213684#false} is VALID [2022-04-08 10:15:50,627 INFO L290 TraceCheckUtils]: 28: Hoare triple {213684#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {213684#false} is VALID [2022-04-08 10:15:50,627 INFO L290 TraceCheckUtils]: 29: Hoare triple {213684#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {213684#false} is VALID [2022-04-08 10:15:50,627 INFO L290 TraceCheckUtils]: 30: Hoare triple {213684#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {213684#false} is VALID [2022-04-08 10:15:50,627 INFO L290 TraceCheckUtils]: 31: Hoare triple {213684#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {213684#false} is VALID [2022-04-08 10:15:50,627 INFO L290 TraceCheckUtils]: 32: Hoare triple {213684#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {213684#false} is VALID [2022-04-08 10:15:50,627 INFO L290 TraceCheckUtils]: 33: Hoare triple {213684#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {213684#false} is VALID [2022-04-08 10:15:50,627 INFO L290 TraceCheckUtils]: 34: Hoare triple {213684#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {213684#false} is VALID [2022-04-08 10:15:50,627 INFO L290 TraceCheckUtils]: 35: Hoare triple {213684#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {213684#false} is VALID [2022-04-08 10:15:50,627 INFO L290 TraceCheckUtils]: 36: Hoare triple {213684#false} assume !(~y~0 % 4294967296 > 0); {213684#false} is VALID [2022-04-08 10:15:50,627 INFO L290 TraceCheckUtils]: 37: Hoare triple {213684#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {213684#false} is VALID [2022-04-08 10:15:50,627 INFO L290 TraceCheckUtils]: 38: Hoare triple {213684#false} assume !(~x~0 % 4294967296 > 0); {213684#false} is VALID [2022-04-08 10:15:50,627 INFO L272 TraceCheckUtils]: 39: Hoare triple {213684#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {213684#false} is VALID [2022-04-08 10:15:50,627 INFO L290 TraceCheckUtils]: 40: Hoare triple {213684#false} ~cond := #in~cond; {213684#false} is VALID [2022-04-08 10:15:50,627 INFO L290 TraceCheckUtils]: 41: Hoare triple {213684#false} assume 0 == ~cond; {213684#false} is VALID [2022-04-08 10:15:50,627 INFO L290 TraceCheckUtils]: 42: Hoare triple {213684#false} assume !false; {213684#false} is VALID [2022-04-08 10:15:50,628 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-04-08 10:15:50,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:15:50,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141026576] [2022-04-08 10:15:50,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141026576] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:15:50,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939210816] [2022-04-08 10:15:50,628 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:15:50,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:15:50,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:15:50,629 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:15:50,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Waiting until timeout for monitored process [2022-04-08 10:15:50,672 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:15:50,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:15:50,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 10:15:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:15:50,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:15:50,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {213683#true} call ULTIMATE.init(); {213683#true} is VALID [2022-04-08 10:15:50,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {213683#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {213683#true} is VALID [2022-04-08 10:15:50,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {213683#true} assume true; {213683#true} is VALID [2022-04-08 10:15:50,954 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {213683#true} {213683#true} #72#return; {213683#true} is VALID [2022-04-08 10:15:50,954 INFO L272 TraceCheckUtils]: 4: Hoare triple {213683#true} call #t~ret13 := main(); {213683#true} is VALID [2022-04-08 10:15:50,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {213683#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {213688#(= main_~y~0 0)} is VALID [2022-04-08 10:15:50,954 INFO L290 TraceCheckUtils]: 6: Hoare triple {213688#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {213689#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:15:50,955 INFO L290 TraceCheckUtils]: 7: Hoare triple {213689#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {213690#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:15:50,955 INFO L290 TraceCheckUtils]: 8: Hoare triple {213690#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {213691#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:15:50,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {213691#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {213692#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:15:50,956 INFO L290 TraceCheckUtils]: 10: Hoare triple {213692#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {213693#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:15:50,957 INFO L290 TraceCheckUtils]: 11: Hoare triple {213693#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {213694#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:15:50,957 INFO L290 TraceCheckUtils]: 12: Hoare triple {213694#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {213695#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:15:50,958 INFO L290 TraceCheckUtils]: 13: Hoare triple {213695#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {213696#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:15:50,958 INFO L290 TraceCheckUtils]: 14: Hoare triple {213696#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {213697#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:15:50,959 INFO L290 TraceCheckUtils]: 15: Hoare triple {213697#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {213698#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:15:50,959 INFO L290 TraceCheckUtils]: 16: Hoare triple {213698#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {213699#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:15:50,960 INFO L290 TraceCheckUtils]: 17: Hoare triple {213699#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {213700#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:15:50,960 INFO L290 TraceCheckUtils]: 18: Hoare triple {213700#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {213701#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:15:50,961 INFO L290 TraceCheckUtils]: 19: Hoare triple {213701#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {213701#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:15:50,961 INFO L290 TraceCheckUtils]: 20: Hoare triple {213701#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {213702#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-08 10:15:50,961 INFO L290 TraceCheckUtils]: 21: Hoare triple {213702#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {213771#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-08 10:15:50,962 INFO L290 TraceCheckUtils]: 22: Hoare triple {213771#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {213684#false} is VALID [2022-04-08 10:15:50,962 INFO L290 TraceCheckUtils]: 23: Hoare triple {213684#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {213684#false} is VALID [2022-04-08 10:15:50,962 INFO L290 TraceCheckUtils]: 24: Hoare triple {213684#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {213684#false} is VALID [2022-04-08 10:15:50,962 INFO L290 TraceCheckUtils]: 25: Hoare triple {213684#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {213684#false} is VALID [2022-04-08 10:15:50,962 INFO L290 TraceCheckUtils]: 26: Hoare triple {213684#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {213684#false} is VALID [2022-04-08 10:15:50,962 INFO L290 TraceCheckUtils]: 27: Hoare triple {213684#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {213684#false} is VALID [2022-04-08 10:15:50,962 INFO L290 TraceCheckUtils]: 28: Hoare triple {213684#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {213684#false} is VALID [2022-04-08 10:15:50,962 INFO L290 TraceCheckUtils]: 29: Hoare triple {213684#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {213684#false} is VALID [2022-04-08 10:15:50,962 INFO L290 TraceCheckUtils]: 30: Hoare triple {213684#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {213684#false} is VALID [2022-04-08 10:15:50,962 INFO L290 TraceCheckUtils]: 31: Hoare triple {213684#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {213684#false} is VALID [2022-04-08 10:15:50,962 INFO L290 TraceCheckUtils]: 32: Hoare triple {213684#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {213684#false} is VALID [2022-04-08 10:15:50,962 INFO L290 TraceCheckUtils]: 33: Hoare triple {213684#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {213684#false} is VALID [2022-04-08 10:15:50,962 INFO L290 TraceCheckUtils]: 34: Hoare triple {213684#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {213684#false} is VALID [2022-04-08 10:15:50,962 INFO L290 TraceCheckUtils]: 35: Hoare triple {213684#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {213684#false} is VALID [2022-04-08 10:15:50,963 INFO L290 TraceCheckUtils]: 36: Hoare triple {213684#false} assume !(~y~0 % 4294967296 > 0); {213684#false} is VALID [2022-04-08 10:15:50,963 INFO L290 TraceCheckUtils]: 37: Hoare triple {213684#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {213684#false} is VALID [2022-04-08 10:15:50,963 INFO L290 TraceCheckUtils]: 38: Hoare triple {213684#false} assume !(~x~0 % 4294967296 > 0); {213684#false} is VALID [2022-04-08 10:15:50,963 INFO L272 TraceCheckUtils]: 39: Hoare triple {213684#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {213684#false} is VALID [2022-04-08 10:15:50,963 INFO L290 TraceCheckUtils]: 40: Hoare triple {213684#false} ~cond := #in~cond; {213684#false} is VALID [2022-04-08 10:15:50,963 INFO L290 TraceCheckUtils]: 41: Hoare triple {213684#false} assume 0 == ~cond; {213684#false} is VALID [2022-04-08 10:15:50,963 INFO L290 TraceCheckUtils]: 42: Hoare triple {213684#false} assume !false; {213684#false} is VALID [2022-04-08 10:15:50,963 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-04-08 10:15:50,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:15:51,420 INFO L290 TraceCheckUtils]: 42: Hoare triple {213684#false} assume !false; {213684#false} is VALID [2022-04-08 10:15:51,420 INFO L290 TraceCheckUtils]: 41: Hoare triple {213684#false} assume 0 == ~cond; {213684#false} is VALID [2022-04-08 10:15:51,420 INFO L290 TraceCheckUtils]: 40: Hoare triple {213684#false} ~cond := #in~cond; {213684#false} is VALID [2022-04-08 10:15:51,421 INFO L272 TraceCheckUtils]: 39: Hoare triple {213684#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {213684#false} is VALID [2022-04-08 10:15:51,421 INFO L290 TraceCheckUtils]: 38: Hoare triple {213684#false} assume !(~x~0 % 4294967296 > 0); {213684#false} is VALID [2022-04-08 10:15:51,421 INFO L290 TraceCheckUtils]: 37: Hoare triple {213684#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {213684#false} is VALID [2022-04-08 10:15:51,421 INFO L290 TraceCheckUtils]: 36: Hoare triple {213684#false} assume !(~y~0 % 4294967296 > 0); {213684#false} is VALID [2022-04-08 10:15:51,421 INFO L290 TraceCheckUtils]: 35: Hoare triple {213684#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {213684#false} is VALID [2022-04-08 10:15:51,421 INFO L290 TraceCheckUtils]: 34: Hoare triple {213684#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {213684#false} is VALID [2022-04-08 10:15:51,421 INFO L290 TraceCheckUtils]: 33: Hoare triple {213684#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {213684#false} is VALID [2022-04-08 10:15:51,421 INFO L290 TraceCheckUtils]: 32: Hoare triple {213684#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {213684#false} is VALID [2022-04-08 10:15:51,421 INFO L290 TraceCheckUtils]: 31: Hoare triple {213684#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {213684#false} is VALID [2022-04-08 10:15:51,421 INFO L290 TraceCheckUtils]: 30: Hoare triple {213684#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {213684#false} is VALID [2022-04-08 10:15:51,421 INFO L290 TraceCheckUtils]: 29: Hoare triple {213684#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {213684#false} is VALID [2022-04-08 10:15:51,421 INFO L290 TraceCheckUtils]: 28: Hoare triple {213684#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {213684#false} is VALID [2022-04-08 10:15:51,421 INFO L290 TraceCheckUtils]: 27: Hoare triple {213684#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {213684#false} is VALID [2022-04-08 10:15:51,421 INFO L290 TraceCheckUtils]: 26: Hoare triple {213684#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {213684#false} is VALID [2022-04-08 10:15:51,421 INFO L290 TraceCheckUtils]: 25: Hoare triple {213684#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {213684#false} is VALID [2022-04-08 10:15:51,421 INFO L290 TraceCheckUtils]: 24: Hoare triple {213684#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {213684#false} is VALID [2022-04-08 10:15:51,421 INFO L290 TraceCheckUtils]: 23: Hoare triple {213684#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {213684#false} is VALID [2022-04-08 10:15:51,422 INFO L290 TraceCheckUtils]: 22: Hoare triple {213895#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {213684#false} is VALID [2022-04-08 10:15:51,422 INFO L290 TraceCheckUtils]: 21: Hoare triple {213899#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {213895#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:15:51,423 INFO L290 TraceCheckUtils]: 20: Hoare triple {213903#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {213899#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:15:51,423 INFO L290 TraceCheckUtils]: 19: Hoare triple {213903#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {213903#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:15:51,424 INFO L290 TraceCheckUtils]: 18: Hoare triple {213910#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {213903#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:15:51,424 INFO L290 TraceCheckUtils]: 17: Hoare triple {213914#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {213910#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:15:51,425 INFO L290 TraceCheckUtils]: 16: Hoare triple {213918#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {213914#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:15:51,425 INFO L290 TraceCheckUtils]: 15: Hoare triple {213922#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {213918#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:15:51,426 INFO L290 TraceCheckUtils]: 14: Hoare triple {213926#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {213922#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:15:51,427 INFO L290 TraceCheckUtils]: 13: Hoare triple {213930#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {213926#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:15:51,427 INFO L290 TraceCheckUtils]: 12: Hoare triple {213934#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {213930#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:15:51,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {213938#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {213934#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:15:51,428 INFO L290 TraceCheckUtils]: 10: Hoare triple {213942#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {213938#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:15:51,429 INFO L290 TraceCheckUtils]: 9: Hoare triple {213946#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {213942#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:15:51,430 INFO L290 TraceCheckUtils]: 8: Hoare triple {213950#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {213946#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:15:51,430 INFO L290 TraceCheckUtils]: 7: Hoare triple {213954#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {213950#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:15:51,431 INFO L290 TraceCheckUtils]: 6: Hoare triple {213958#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {213954#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:15:51,431 INFO L290 TraceCheckUtils]: 5: Hoare triple {213683#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {213958#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:15:51,431 INFO L272 TraceCheckUtils]: 4: Hoare triple {213683#true} call #t~ret13 := main(); {213683#true} is VALID [2022-04-08 10:15:51,431 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {213683#true} {213683#true} #72#return; {213683#true} is VALID [2022-04-08 10:15:51,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {213683#true} assume true; {213683#true} is VALID [2022-04-08 10:15:51,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {213683#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {213683#true} is VALID [2022-04-08 10:15:51,431 INFO L272 TraceCheckUtils]: 0: Hoare triple {213683#true} call ULTIMATE.init(); {213683#true} is VALID [2022-04-08 10:15:51,431 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-04-08 10:15:51,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939210816] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:15:51,432 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:15:51,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-08 10:15:51,432 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:15:51,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1667113692] [2022-04-08 10:15:51,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1667113692] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:15:51,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:15:51,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 10:15:51,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011909088] [2022-04-08 10:15:51,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:15:51,432 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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 43 [2022-04-08 10:15:51,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:15:51,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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-08 10:15:51,452 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:15:51,452 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 10:15:51,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:15:51,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 10:15:51,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=989, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 10:15:51,452 INFO L87 Difference]: Start difference. First operand 606 states and 821 transitions. Second operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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-08 10:16:01,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:16:01,192 INFO L93 Difference]: Finished difference Result 830 states and 1058 transitions. [2022-04-08 10:16:01,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 10:16:01,192 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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 43 [2022-04-08 10:16:01,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:16:01,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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-08 10:16:01,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 129 transitions. [2022-04-08 10:16:01,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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-08 10:16:01,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 129 transitions. [2022-04-08 10:16:01,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 129 transitions. [2022-04-08 10:16:01,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:16:01,286 INFO L225 Difference]: With dead ends: 830 [2022-04-08 10:16:01,286 INFO L226 Difference]: Without dead ends: 809 [2022-04-08 10:16:01,286 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=589, Invalid=2167, Unknown=0, NotChecked=0, Total=2756 [2022-04-08 10:16:01,287 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 81 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1631 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 1696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:16:01,287 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 140 Invalid, 1696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1631 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-08 10:16:01,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2022-04-08 10:16:03,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 606. [2022-04-08 10:16:03,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:16:03,582 INFO L82 GeneralOperation]: Start isEquivalent. First operand 809 states. Second operand has 606 states, 601 states have (on average 1.357737104825291) internal successors, (816), 601 states have internal predecessors, (816), 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-08 10:16:03,582 INFO L74 IsIncluded]: Start isIncluded. First operand 809 states. Second operand has 606 states, 601 states have (on average 1.357737104825291) internal successors, (816), 601 states have internal predecessors, (816), 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-08 10:16:03,582 INFO L87 Difference]: Start difference. First operand 809 states. Second operand has 606 states, 601 states have (on average 1.357737104825291) internal successors, (816), 601 states have internal predecessors, (816), 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-08 10:16:03,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:16:03,600 INFO L93 Difference]: Finished difference Result 809 states and 1037 transitions. [2022-04-08 10:16:03,600 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1037 transitions. [2022-04-08 10:16:03,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:16:03,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:16:03,601 INFO L74 IsIncluded]: Start isIncluded. First operand has 606 states, 601 states have (on average 1.357737104825291) internal successors, (816), 601 states have internal predecessors, (816), 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 809 states. [2022-04-08 10:16:03,601 INFO L87 Difference]: Start difference. First operand has 606 states, 601 states have (on average 1.357737104825291) internal successors, (816), 601 states have internal predecessors, (816), 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 809 states. [2022-04-08 10:16:03,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:16:03,619 INFO L93 Difference]: Finished difference Result 809 states and 1037 transitions. [2022-04-08 10:16:03,619 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1037 transitions. [2022-04-08 10:16:03,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:16:03,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:16:03,620 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:16:03,620 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:16:03,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 601 states have (on average 1.357737104825291) internal successors, (816), 601 states have internal predecessors, (816), 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-08 10:16:03,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 820 transitions. [2022-04-08 10:16:03,634 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 820 transitions. Word has length 43 [2022-04-08 10:16:03,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:16:03,634 INFO L478 AbstractCegarLoop]: Abstraction has 606 states and 820 transitions. [2022-04-08 10:16:03,634 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 18 states have internal predecessors, (27), 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-08 10:16:03,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 606 states and 820 transitions. [2022-04-08 10:16:09,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 820 edges. 820 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:16:09,770 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 820 transitions. [2022-04-08 10:16:09,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 10:16:09,771 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:16:09,771 INFO L499 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:16:09,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Forceful destruction successful, exit code 0 [2022-04-08 10:16:09,986 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,93 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:16:09,986 INFO L403 AbstractCegarLoop]: === Iteration 96 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:16:09,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:16:09,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1642651160, now seen corresponding path program 55 times [2022-04-08 10:16:09,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:16:09,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1066009600] [2022-04-08 10:16:09,991 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:16:09,991 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:16:09,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1642651160, now seen corresponding path program 56 times [2022-04-08 10:16:09,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:16:09,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175287027] [2022-04-08 10:16:09,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:16:09,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:16:10,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:16:10,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:16:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:16:10,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {218538#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {218503#true} is VALID [2022-04-08 10:16:10,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {218503#true} assume true; {218503#true} is VALID [2022-04-08 10:16:10,553 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {218503#true} {218503#true} #72#return; {218503#true} is VALID [2022-04-08 10:16:10,554 INFO L272 TraceCheckUtils]: 0: Hoare triple {218503#true} call ULTIMATE.init(); {218538#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:16:10,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {218538#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {218503#true} is VALID [2022-04-08 10:16:10,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {218503#true} assume true; {218503#true} is VALID [2022-04-08 10:16:10,554 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {218503#true} {218503#true} #72#return; {218503#true} is VALID [2022-04-08 10:16:10,554 INFO L272 TraceCheckUtils]: 4: Hoare triple {218503#true} call #t~ret13 := main(); {218503#true} is VALID [2022-04-08 10:16:10,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {218503#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {218508#(= main_~y~0 0)} is VALID [2022-04-08 10:16:10,555 INFO L290 TraceCheckUtils]: 6: Hoare triple {218508#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218509#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:16:10,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {218509#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218510#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:16:10,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {218510#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218511#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:16:10,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {218511#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218512#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:16:10,557 INFO L290 TraceCheckUtils]: 10: Hoare triple {218512#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218513#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:16:10,557 INFO L290 TraceCheckUtils]: 11: Hoare triple {218513#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218514#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:16:10,558 INFO L290 TraceCheckUtils]: 12: Hoare triple {218514#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218515#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:16:10,558 INFO L290 TraceCheckUtils]: 13: Hoare triple {218515#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218516#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:16:10,559 INFO L290 TraceCheckUtils]: 14: Hoare triple {218516#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218517#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:16:10,559 INFO L290 TraceCheckUtils]: 15: Hoare triple {218517#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218518#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:16:10,560 INFO L290 TraceCheckUtils]: 16: Hoare triple {218518#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218519#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:16:10,560 INFO L290 TraceCheckUtils]: 17: Hoare triple {218519#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218520#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:16:10,561 INFO L290 TraceCheckUtils]: 18: Hoare triple {218520#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218521#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:16:10,561 INFO L290 TraceCheckUtils]: 19: Hoare triple {218521#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218522#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:16:10,562 INFO L290 TraceCheckUtils]: 20: Hoare triple {218522#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218523#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:16:10,562 INFO L290 TraceCheckUtils]: 21: Hoare triple {218523#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218524#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:16:10,563 INFO L290 TraceCheckUtils]: 22: Hoare triple {218524#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218525#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:16:10,563 INFO L290 TraceCheckUtils]: 23: Hoare triple {218525#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218526#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:16:10,564 INFO L290 TraceCheckUtils]: 24: Hoare triple {218526#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218527#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:16:10,564 INFO L290 TraceCheckUtils]: 25: Hoare triple {218527#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218528#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:16:10,565 INFO L290 TraceCheckUtils]: 26: Hoare triple {218528#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218529#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:16:10,565 INFO L290 TraceCheckUtils]: 27: Hoare triple {218529#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218530#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:16:10,566 INFO L290 TraceCheckUtils]: 28: Hoare triple {218530#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218531#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:16:10,566 INFO L290 TraceCheckUtils]: 29: Hoare triple {218531#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218532#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-08 10:16:10,567 INFO L290 TraceCheckUtils]: 30: Hoare triple {218532#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218533#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-08 10:16:10,567 INFO L290 TraceCheckUtils]: 31: Hoare triple {218533#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218534#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-08 10:16:10,568 INFO L290 TraceCheckUtils]: 32: Hoare triple {218534#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218535#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-08 10:16:10,568 INFO L290 TraceCheckUtils]: 33: Hoare triple {218535#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218536#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-08 10:16:10,568 INFO L290 TraceCheckUtils]: 34: Hoare triple {218536#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {218536#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-08 10:16:10,569 INFO L290 TraceCheckUtils]: 35: Hoare triple {218536#(and (<= main_~y~0 28) (<= 28 main_~y~0))} ~z~0 := ~y~0; {218537#(and (<= (div main_~z~0 4294967296) 0) (<= 28 main_~z~0))} is VALID [2022-04-08 10:16:10,569 INFO L290 TraceCheckUtils]: 36: Hoare triple {218537#(and (<= (div main_~z~0 4294967296) 0) (<= 28 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {218504#false} is VALID [2022-04-08 10:16:10,569 INFO L290 TraceCheckUtils]: 37: Hoare triple {218504#false} assume !(~y~0 % 4294967296 > 0); {218504#false} is VALID [2022-04-08 10:16:10,569 INFO L290 TraceCheckUtils]: 38: Hoare triple {218504#false} assume !(~x~0 % 4294967296 > 0); {218504#false} is VALID [2022-04-08 10:16:10,569 INFO L272 TraceCheckUtils]: 39: Hoare triple {218504#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {218504#false} is VALID [2022-04-08 10:16:10,569 INFO L290 TraceCheckUtils]: 40: Hoare triple {218504#false} ~cond := #in~cond; {218504#false} is VALID [2022-04-08 10:16:10,569 INFO L290 TraceCheckUtils]: 41: Hoare triple {218504#false} assume 0 == ~cond; {218504#false} is VALID [2022-04-08 10:16:10,570 INFO L290 TraceCheckUtils]: 42: Hoare triple {218504#false} assume !false; {218504#false} is VALID [2022-04-08 10:16:10,570 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:16:10,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:16:10,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175287027] [2022-04-08 10:16:10,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175287027] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:16:10,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396949606] [2022-04-08 10:16:10,570 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:16:10,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:16:10,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:16:10,571 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:16:10,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Waiting until timeout for monitored process [2022-04-08 10:16:10,631 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:16:10,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:16:10,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 61 conjunts are in the unsatisfiable core [2022-04-08 10:16:10,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:16:10,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:16:11,096 INFO L272 TraceCheckUtils]: 0: Hoare triple {218503#true} call ULTIMATE.init(); {218503#true} is VALID [2022-04-08 10:16:11,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {218503#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {218503#true} is VALID [2022-04-08 10:16:11,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {218503#true} assume true; {218503#true} is VALID [2022-04-08 10:16:11,096 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {218503#true} {218503#true} #72#return; {218503#true} is VALID [2022-04-08 10:16:11,096 INFO L272 TraceCheckUtils]: 4: Hoare triple {218503#true} call #t~ret13 := main(); {218503#true} is VALID [2022-04-08 10:16:11,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {218503#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {218508#(= main_~y~0 0)} is VALID [2022-04-08 10:16:11,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {218508#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218509#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:16:11,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {218509#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218510#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:16:11,098 INFO L290 TraceCheckUtils]: 8: Hoare triple {218510#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218511#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:16:11,098 INFO L290 TraceCheckUtils]: 9: Hoare triple {218511#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218512#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:16:11,099 INFO L290 TraceCheckUtils]: 10: Hoare triple {218512#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218513#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:16:11,099 INFO L290 TraceCheckUtils]: 11: Hoare triple {218513#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218514#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:16:11,100 INFO L290 TraceCheckUtils]: 12: Hoare triple {218514#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218515#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:16:11,100 INFO L290 TraceCheckUtils]: 13: Hoare triple {218515#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218516#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:16:11,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {218516#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218517#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:16:11,101 INFO L290 TraceCheckUtils]: 15: Hoare triple {218517#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218518#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:16:11,102 INFO L290 TraceCheckUtils]: 16: Hoare triple {218518#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218519#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:16:11,102 INFO L290 TraceCheckUtils]: 17: Hoare triple {218519#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218520#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:16:11,103 INFO L290 TraceCheckUtils]: 18: Hoare triple {218520#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218521#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:16:11,104 INFO L290 TraceCheckUtils]: 19: Hoare triple {218521#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218522#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:16:11,104 INFO L290 TraceCheckUtils]: 20: Hoare triple {218522#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218523#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:16:11,105 INFO L290 TraceCheckUtils]: 21: Hoare triple {218523#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218524#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:16:11,105 INFO L290 TraceCheckUtils]: 22: Hoare triple {218524#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218525#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:16:11,106 INFO L290 TraceCheckUtils]: 23: Hoare triple {218525#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218526#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:16:11,106 INFO L290 TraceCheckUtils]: 24: Hoare triple {218526#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218527#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:16:11,107 INFO L290 TraceCheckUtils]: 25: Hoare triple {218527#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218528#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:16:11,107 INFO L290 TraceCheckUtils]: 26: Hoare triple {218528#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218529#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:16:11,108 INFO L290 TraceCheckUtils]: 27: Hoare triple {218529#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218530#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:16:11,108 INFO L290 TraceCheckUtils]: 28: Hoare triple {218530#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218531#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:16:11,109 INFO L290 TraceCheckUtils]: 29: Hoare triple {218531#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218532#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-08 10:16:11,109 INFO L290 TraceCheckUtils]: 30: Hoare triple {218532#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218533#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-08 10:16:11,110 INFO L290 TraceCheckUtils]: 31: Hoare triple {218533#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218534#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-08 10:16:11,110 INFO L290 TraceCheckUtils]: 32: Hoare triple {218534#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218535#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-08 10:16:11,111 INFO L290 TraceCheckUtils]: 33: Hoare triple {218535#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218536#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-08 10:16:11,111 INFO L290 TraceCheckUtils]: 34: Hoare triple {218536#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {218536#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-08 10:16:11,111 INFO L290 TraceCheckUtils]: 35: Hoare triple {218536#(and (<= main_~y~0 28) (<= 28 main_~y~0))} ~z~0 := ~y~0; {218647#(and (<= 28 main_~z~0) (<= main_~z~0 28))} is VALID [2022-04-08 10:16:11,112 INFO L290 TraceCheckUtils]: 36: Hoare triple {218647#(and (<= 28 main_~z~0) (<= main_~z~0 28))} assume !(~z~0 % 4294967296 > 0); {218504#false} is VALID [2022-04-08 10:16:11,112 INFO L290 TraceCheckUtils]: 37: Hoare triple {218504#false} assume !(~y~0 % 4294967296 > 0); {218504#false} is VALID [2022-04-08 10:16:11,112 INFO L290 TraceCheckUtils]: 38: Hoare triple {218504#false} assume !(~x~0 % 4294967296 > 0); {218504#false} is VALID [2022-04-08 10:16:11,112 INFO L272 TraceCheckUtils]: 39: Hoare triple {218504#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {218504#false} is VALID [2022-04-08 10:16:11,112 INFO L290 TraceCheckUtils]: 40: Hoare triple {218504#false} ~cond := #in~cond; {218504#false} is VALID [2022-04-08 10:16:11,112 INFO L290 TraceCheckUtils]: 41: Hoare triple {218504#false} assume 0 == ~cond; {218504#false} is VALID [2022-04-08 10:16:11,112 INFO L290 TraceCheckUtils]: 42: Hoare triple {218504#false} assume !false; {218504#false} is VALID [2022-04-08 10:16:11,112 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:16:11,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:16:12,497 INFO L290 TraceCheckUtils]: 42: Hoare triple {218504#false} assume !false; {218504#false} is VALID [2022-04-08 10:16:12,497 INFO L290 TraceCheckUtils]: 41: Hoare triple {218504#false} assume 0 == ~cond; {218504#false} is VALID [2022-04-08 10:16:12,497 INFO L290 TraceCheckUtils]: 40: Hoare triple {218504#false} ~cond := #in~cond; {218504#false} is VALID [2022-04-08 10:16:12,497 INFO L272 TraceCheckUtils]: 39: Hoare triple {218504#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {218504#false} is VALID [2022-04-08 10:16:12,497 INFO L290 TraceCheckUtils]: 38: Hoare triple {218504#false} assume !(~x~0 % 4294967296 > 0); {218504#false} is VALID [2022-04-08 10:16:12,497 INFO L290 TraceCheckUtils]: 37: Hoare triple {218504#false} assume !(~y~0 % 4294967296 > 0); {218504#false} is VALID [2022-04-08 10:16:12,497 INFO L290 TraceCheckUtils]: 36: Hoare triple {218687#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {218504#false} is VALID [2022-04-08 10:16:12,498 INFO L290 TraceCheckUtils]: 35: Hoare triple {218691#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {218687#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:16:12,498 INFO L290 TraceCheckUtils]: 34: Hoare triple {218691#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {218691#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:16:12,499 INFO L290 TraceCheckUtils]: 33: Hoare triple {218698#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218691#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:16:12,499 INFO L290 TraceCheckUtils]: 32: Hoare triple {218702#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218698#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:16:12,500 INFO L290 TraceCheckUtils]: 31: Hoare triple {218706#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218702#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:16:12,501 INFO L290 TraceCheckUtils]: 30: Hoare triple {218710#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218706#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:16:12,501 INFO L290 TraceCheckUtils]: 29: Hoare triple {218714#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218710#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:16:12,502 INFO L290 TraceCheckUtils]: 28: Hoare triple {218718#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218714#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:16:12,502 INFO L290 TraceCheckUtils]: 27: Hoare triple {218722#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218718#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:16:12,503 INFO L290 TraceCheckUtils]: 26: Hoare triple {218726#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218722#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:16:12,504 INFO L290 TraceCheckUtils]: 25: Hoare triple {218730#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218726#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:16:12,504 INFO L290 TraceCheckUtils]: 24: Hoare triple {218734#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218730#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:16:12,505 INFO L290 TraceCheckUtils]: 23: Hoare triple {218738#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218734#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:16:12,506 INFO L290 TraceCheckUtils]: 22: Hoare triple {218742#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218738#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:16:12,506 INFO L290 TraceCheckUtils]: 21: Hoare triple {218746#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218742#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:16:12,507 INFO L290 TraceCheckUtils]: 20: Hoare triple {218750#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218746#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:16:12,508 INFO L290 TraceCheckUtils]: 19: Hoare triple {218754#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218750#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:16:12,508 INFO L290 TraceCheckUtils]: 18: Hoare triple {218758#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218754#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:16:12,509 INFO L290 TraceCheckUtils]: 17: Hoare triple {218762#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218758#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:16:12,509 INFO L290 TraceCheckUtils]: 16: Hoare triple {218766#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218762#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:16:12,510 INFO L290 TraceCheckUtils]: 15: Hoare triple {218770#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218766#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-08 10:16:12,511 INFO L290 TraceCheckUtils]: 14: Hoare triple {218774#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218770#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-08 10:16:12,511 INFO L290 TraceCheckUtils]: 13: Hoare triple {218778#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218774#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-08 10:16:12,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {218782#(< 0 (mod (+ main_~y~0 22) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218778#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-08 10:16:12,513 INFO L290 TraceCheckUtils]: 11: Hoare triple {218786#(< 0 (mod (+ 23 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218782#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-08 10:16:12,513 INFO L290 TraceCheckUtils]: 10: Hoare triple {218790#(< 0 (mod (+ main_~y~0 24) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218786#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID [2022-04-08 10:16:12,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {218794#(< 0 (mod (+ main_~y~0 25) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218790#(< 0 (mod (+ main_~y~0 24) 4294967296))} is VALID [2022-04-08 10:16:12,514 INFO L290 TraceCheckUtils]: 8: Hoare triple {218798#(< 0 (mod (+ main_~y~0 26) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218794#(< 0 (mod (+ main_~y~0 25) 4294967296))} is VALID [2022-04-08 10:16:12,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {218802#(< 0 (mod (+ main_~y~0 27) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218798#(< 0 (mod (+ main_~y~0 26) 4294967296))} is VALID [2022-04-08 10:16:12,516 INFO L290 TraceCheckUtils]: 6: Hoare triple {218806#(< 0 (mod (+ main_~y~0 28) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {218802#(< 0 (mod (+ main_~y~0 27) 4294967296))} is VALID [2022-04-08 10:16:12,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {218503#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {218806#(< 0 (mod (+ main_~y~0 28) 4294967296))} is VALID [2022-04-08 10:16:12,516 INFO L272 TraceCheckUtils]: 4: Hoare triple {218503#true} call #t~ret13 := main(); {218503#true} is VALID [2022-04-08 10:16:12,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {218503#true} {218503#true} #72#return; {218503#true} is VALID [2022-04-08 10:16:12,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {218503#true} assume true; {218503#true} is VALID [2022-04-08 10:16:12,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {218503#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {218503#true} is VALID [2022-04-08 10:16:12,516 INFO L272 TraceCheckUtils]: 0: Hoare triple {218503#true} call ULTIMATE.init(); {218503#true} is VALID [2022-04-08 10:16:12,517 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:16:12,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396949606] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:16:12,517 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:16:12,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 64 [2022-04-08 10:16:12,517 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:16:12,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1066009600] [2022-04-08 10:16:12,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1066009600] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:16:12,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:16:12,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-08 10:16:12,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815112559] [2022-04-08 10:16:12,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:16:12,517 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 32 states have internal predecessors, (39), 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 43 [2022-04-08 10:16:12,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:16:12,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 32 states have internal predecessors, (39), 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-08 10:16:12,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:16:12,542 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-08 10:16:12,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:16:12,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-08 10:16:12,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=968, Invalid=3064, Unknown=0, NotChecked=0, Total=4032 [2022-04-08 10:16:12,542 INFO L87 Difference]: Start difference. First operand 606 states and 820 transitions. Second operand has 33 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 32 states have internal predecessors, (39), 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-08 10:16:26,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:16:26,507 INFO L93 Difference]: Finished difference Result 1051 states and 1607 transitions. [2022-04-08 10:16:26,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-08 10:16:26,508 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 32 states have internal predecessors, (39), 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 43 [2022-04-08 10:16:26,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:16:26,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 32 states have internal predecessors, (39), 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-08 10:16:26,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 291 transitions. [2022-04-08 10:16:26,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 32 states have internal predecessors, (39), 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-08 10:16:26,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 291 transitions. [2022-04-08 10:16:26,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 291 transitions. [2022-04-08 10:16:26,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 291 edges. 291 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:16:26,701 INFO L225 Difference]: With dead ends: 1051 [2022-04-08 10:16:26,702 INFO L226 Difference]: Without dead ends: 1018 [2022-04-08 10:16:26,702 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1960, Invalid=6782, Unknown=0, NotChecked=0, Total=8742 [2022-04-08 10:16:26,702 INFO L913 BasicCegarLoop]: 132 mSDtfsCounter, 220 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 7019 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 7176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 7019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:16:26,702 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 284 Invalid, 7176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 7019 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-04-08 10:16:26,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2022-04-08 10:16:29,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 629. [2022-04-08 10:16:29,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:16:29,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1018 states. Second operand has 629 states, 624 states have (on average 1.3621794871794872) internal successors, (850), 624 states have internal predecessors, (850), 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-08 10:16:29,008 INFO L74 IsIncluded]: Start isIncluded. First operand 1018 states. Second operand has 629 states, 624 states have (on average 1.3621794871794872) internal successors, (850), 624 states have internal predecessors, (850), 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-08 10:16:29,009 INFO L87 Difference]: Start difference. First operand 1018 states. Second operand has 629 states, 624 states have (on average 1.3621794871794872) internal successors, (850), 624 states have internal predecessors, (850), 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-08 10:16:29,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:16:29,034 INFO L93 Difference]: Finished difference Result 1018 states and 1272 transitions. [2022-04-08 10:16:29,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1272 transitions. [2022-04-08 10:16:29,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:16:29,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:16:29,035 INFO L74 IsIncluded]: Start isIncluded. First operand has 629 states, 624 states have (on average 1.3621794871794872) internal successors, (850), 624 states have internal predecessors, (850), 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 1018 states. [2022-04-08 10:16:29,036 INFO L87 Difference]: Start difference. First operand has 629 states, 624 states have (on average 1.3621794871794872) internal successors, (850), 624 states have internal predecessors, (850), 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 1018 states. [2022-04-08 10:16:29,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:16:29,061 INFO L93 Difference]: Finished difference Result 1018 states and 1272 transitions. [2022-04-08 10:16:29,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1272 transitions. [2022-04-08 10:16:29,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:16:29,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:16:29,062 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:16:29,062 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:16:29,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 624 states have (on average 1.3621794871794872) internal successors, (850), 624 states have internal predecessors, (850), 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-08 10:16:29,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 854 transitions. [2022-04-08 10:16:29,076 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 854 transitions. Word has length 43 [2022-04-08 10:16:29,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:16:29,076 INFO L478 AbstractCegarLoop]: Abstraction has 629 states and 854 transitions. [2022-04-08 10:16:29,077 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 32 states have internal predecessors, (39), 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-08 10:16:29,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 629 states and 854 transitions. [2022-04-08 10:16:35,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 854 edges. 854 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:16:35,055 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 854 transitions. [2022-04-08 10:16:35,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-08 10:16:35,055 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:16:35,055 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:16:35,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Forceful destruction successful, exit code 0 [2022-04-08 10:16:35,271 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95,94 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:16:35,271 INFO L403 AbstractCegarLoop]: === Iteration 97 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:16:35,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:16:35,271 INFO L85 PathProgramCache]: Analyzing trace with hash -195972048, now seen corresponding path program 95 times [2022-04-08 10:16:35,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:16:35,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1454226605] [2022-04-08 10:16:35,273 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:16:35,273 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:16:35,273 INFO L85 PathProgramCache]: Analyzing trace with hash -195972048, now seen corresponding path program 96 times [2022-04-08 10:16:35,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:16:35,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601760709] [2022-04-08 10:16:35,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:16:35,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:16:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:16:35,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:16:35,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:16:35,442 INFO L290 TraceCheckUtils]: 0: Hoare triple {224296#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {224283#true} is VALID [2022-04-08 10:16:35,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {224283#true} assume true; {224283#true} is VALID [2022-04-08 10:16:35,443 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {224283#true} {224283#true} #72#return; {224283#true} is VALID [2022-04-08 10:16:35,443 INFO L272 TraceCheckUtils]: 0: Hoare triple {224283#true} call ULTIMATE.init(); {224296#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:16:35,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {224296#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {224283#true} is VALID [2022-04-08 10:16:35,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {224283#true} assume true; {224283#true} is VALID [2022-04-08 10:16:35,443 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {224283#true} {224283#true} #72#return; {224283#true} is VALID [2022-04-08 10:16:35,443 INFO L272 TraceCheckUtils]: 4: Hoare triple {224283#true} call #t~ret13 := main(); {224283#true} is VALID [2022-04-08 10:16:35,443 INFO L290 TraceCheckUtils]: 5: Hoare triple {224283#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {224283#true} is VALID [2022-04-08 10:16:35,443 INFO L290 TraceCheckUtils]: 6: Hoare triple {224283#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {224283#true} is VALID [2022-04-08 10:16:35,443 INFO L290 TraceCheckUtils]: 7: Hoare triple {224283#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {224283#true} is VALID [2022-04-08 10:16:35,443 INFO L290 TraceCheckUtils]: 8: Hoare triple {224283#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {224283#true} is VALID [2022-04-08 10:16:35,443 INFO L290 TraceCheckUtils]: 9: Hoare triple {224283#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {224283#true} is VALID [2022-04-08 10:16:35,443 INFO L290 TraceCheckUtils]: 10: Hoare triple {224283#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {224283#true} is VALID [2022-04-08 10:16:35,443 INFO L290 TraceCheckUtils]: 11: Hoare triple {224283#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {224283#true} is VALID [2022-04-08 10:16:35,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {224283#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {224283#true} is VALID [2022-04-08 10:16:35,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {224283#true} assume !(~x~0 % 4294967296 > 0); {224288#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:16:35,444 INFO L290 TraceCheckUtils]: 14: Hoare triple {224288#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {224288#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:16:35,445 INFO L290 TraceCheckUtils]: 15: Hoare triple {224288#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {224289#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:16:35,446 INFO L290 TraceCheckUtils]: 16: Hoare triple {224289#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {224290#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:35,446 INFO L290 TraceCheckUtils]: 17: Hoare triple {224290#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {224291#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:35,447 INFO L290 TraceCheckUtils]: 18: Hoare triple {224291#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {224292#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:35,448 INFO L290 TraceCheckUtils]: 19: Hoare triple {224292#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {224293#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:16:35,449 INFO L290 TraceCheckUtils]: 20: Hoare triple {224293#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {224294#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:35,449 INFO L290 TraceCheckUtils]: 21: Hoare triple {224294#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:35,450 INFO L290 TraceCheckUtils]: 22: Hoare triple {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:35,450 INFO L290 TraceCheckUtils]: 23: Hoare triple {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:35,450 INFO L290 TraceCheckUtils]: 24: Hoare triple {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:35,451 INFO L290 TraceCheckUtils]: 25: Hoare triple {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:35,451 INFO L290 TraceCheckUtils]: 26: Hoare triple {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:35,451 INFO L290 TraceCheckUtils]: 27: Hoare triple {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:35,452 INFO L290 TraceCheckUtils]: 28: Hoare triple {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:35,452 INFO L290 TraceCheckUtils]: 29: Hoare triple {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:35,452 INFO L290 TraceCheckUtils]: 30: Hoare triple {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:35,453 INFO L290 TraceCheckUtils]: 31: Hoare triple {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {224294#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:35,454 INFO L290 TraceCheckUtils]: 32: Hoare triple {224294#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {224293#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:16:35,455 INFO L290 TraceCheckUtils]: 33: Hoare triple {224293#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {224292#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:35,456 INFO L290 TraceCheckUtils]: 34: Hoare triple {224292#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {224291#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:35,456 INFO L290 TraceCheckUtils]: 35: Hoare triple {224291#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {224290#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:35,457 INFO L290 TraceCheckUtils]: 36: Hoare triple {224290#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {224289#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:16:35,458 INFO L290 TraceCheckUtils]: 37: Hoare triple {224289#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {224288#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:16:35,458 INFO L290 TraceCheckUtils]: 38: Hoare triple {224288#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {224284#false} is VALID [2022-04-08 10:16:35,458 INFO L290 TraceCheckUtils]: 39: Hoare triple {224284#false} assume !(~x~0 % 4294967296 > 0); {224284#false} is VALID [2022-04-08 10:16:35,458 INFO L272 TraceCheckUtils]: 40: Hoare triple {224284#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {224284#false} is VALID [2022-04-08 10:16:35,458 INFO L290 TraceCheckUtils]: 41: Hoare triple {224284#false} ~cond := #in~cond; {224284#false} is VALID [2022-04-08 10:16:35,458 INFO L290 TraceCheckUtils]: 42: Hoare triple {224284#false} assume 0 == ~cond; {224284#false} is VALID [2022-04-08 10:16:35,458 INFO L290 TraceCheckUtils]: 43: Hoare triple {224284#false} assume !false; {224284#false} is VALID [2022-04-08 10:16:35,459 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-04-08 10:16:35,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:16:35,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601760709] [2022-04-08 10:16:35,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601760709] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:16:35,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035376716] [2022-04-08 10:16:35,459 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 10:16:35,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:16:35,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:16:35,460 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:16:35,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Waiting until timeout for monitored process [2022-04-08 10:16:35,617 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-08 10:16:35,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:16:35,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-08 10:16:35,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:16:35,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:16:35,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {224283#true} call ULTIMATE.init(); {224283#true} is VALID [2022-04-08 10:16:35,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {224283#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {224283#true} is VALID [2022-04-08 10:16:35,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {224283#true} assume true; {224283#true} is VALID [2022-04-08 10:16:35,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {224283#true} {224283#true} #72#return; {224283#true} is VALID [2022-04-08 10:16:35,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {224283#true} call #t~ret13 := main(); {224283#true} is VALID [2022-04-08 10:16:35,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {224283#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {224283#true} is VALID [2022-04-08 10:16:35,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {224283#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {224283#true} is VALID [2022-04-08 10:16:35,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {224283#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {224283#true} is VALID [2022-04-08 10:16:35,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {224283#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {224283#true} is VALID [2022-04-08 10:16:35,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {224283#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {224283#true} is VALID [2022-04-08 10:16:35,901 INFO L290 TraceCheckUtils]: 10: Hoare triple {224283#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {224283#true} is VALID [2022-04-08 10:16:35,901 INFO L290 TraceCheckUtils]: 11: Hoare triple {224283#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {224283#true} is VALID [2022-04-08 10:16:35,902 INFO L290 TraceCheckUtils]: 12: Hoare triple {224283#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {224283#true} is VALID [2022-04-08 10:16:35,902 INFO L290 TraceCheckUtils]: 13: Hoare triple {224283#true} assume !(~x~0 % 4294967296 > 0); {224288#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:16:35,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {224288#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {224288#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:16:35,903 INFO L290 TraceCheckUtils]: 15: Hoare triple {224288#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {224289#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:16:35,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {224289#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {224290#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:35,905 INFO L290 TraceCheckUtils]: 17: Hoare triple {224290#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {224291#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:35,906 INFO L290 TraceCheckUtils]: 18: Hoare triple {224291#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {224292#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:35,906 INFO L290 TraceCheckUtils]: 19: Hoare triple {224292#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {224293#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:16:35,907 INFO L290 TraceCheckUtils]: 20: Hoare triple {224293#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {224294#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:35,908 INFO L290 TraceCheckUtils]: 21: Hoare triple {224294#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:35,908 INFO L290 TraceCheckUtils]: 22: Hoare triple {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:35,908 INFO L290 TraceCheckUtils]: 23: Hoare triple {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:35,909 INFO L290 TraceCheckUtils]: 24: Hoare triple {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:35,909 INFO L290 TraceCheckUtils]: 25: Hoare triple {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:35,909 INFO L290 TraceCheckUtils]: 26: Hoare triple {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:35,910 INFO L290 TraceCheckUtils]: 27: Hoare triple {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:35,910 INFO L290 TraceCheckUtils]: 28: Hoare triple {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:35,911 INFO L290 TraceCheckUtils]: 29: Hoare triple {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:35,911 INFO L290 TraceCheckUtils]: 30: Hoare triple {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:35,912 INFO L290 TraceCheckUtils]: 31: Hoare triple {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {224294#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:35,912 INFO L290 TraceCheckUtils]: 32: Hoare triple {224294#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {224293#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:16:35,913 INFO L290 TraceCheckUtils]: 33: Hoare triple {224293#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {224292#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:35,914 INFO L290 TraceCheckUtils]: 34: Hoare triple {224292#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {224291#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:35,915 INFO L290 TraceCheckUtils]: 35: Hoare triple {224291#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {224290#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:35,916 INFO L290 TraceCheckUtils]: 36: Hoare triple {224290#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {224289#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:16:35,916 INFO L290 TraceCheckUtils]: 37: Hoare triple {224289#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {224288#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:16:35,917 INFO L290 TraceCheckUtils]: 38: Hoare triple {224288#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {224284#false} is VALID [2022-04-08 10:16:35,917 INFO L290 TraceCheckUtils]: 39: Hoare triple {224284#false} assume !(~x~0 % 4294967296 > 0); {224284#false} is VALID [2022-04-08 10:16:35,917 INFO L272 TraceCheckUtils]: 40: Hoare triple {224284#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {224284#false} is VALID [2022-04-08 10:16:35,917 INFO L290 TraceCheckUtils]: 41: Hoare triple {224284#false} ~cond := #in~cond; {224284#false} is VALID [2022-04-08 10:16:35,917 INFO L290 TraceCheckUtils]: 42: Hoare triple {224284#false} assume 0 == ~cond; {224284#false} is VALID [2022-04-08 10:16:35,917 INFO L290 TraceCheckUtils]: 43: Hoare triple {224284#false} assume !false; {224284#false} is VALID [2022-04-08 10:16:35,917 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-04-08 10:16:35,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:16:36,165 INFO L290 TraceCheckUtils]: 43: Hoare triple {224284#false} assume !false; {224284#false} is VALID [2022-04-08 10:16:36,165 INFO L290 TraceCheckUtils]: 42: Hoare triple {224284#false} assume 0 == ~cond; {224284#false} is VALID [2022-04-08 10:16:36,165 INFO L290 TraceCheckUtils]: 41: Hoare triple {224284#false} ~cond := #in~cond; {224284#false} is VALID [2022-04-08 10:16:36,165 INFO L272 TraceCheckUtils]: 40: Hoare triple {224284#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {224284#false} is VALID [2022-04-08 10:16:36,165 INFO L290 TraceCheckUtils]: 39: Hoare triple {224284#false} assume !(~x~0 % 4294967296 > 0); {224284#false} is VALID [2022-04-08 10:16:36,166 INFO L290 TraceCheckUtils]: 38: Hoare triple {224288#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {224284#false} is VALID [2022-04-08 10:16:36,167 INFO L290 TraceCheckUtils]: 37: Hoare triple {224289#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {224288#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:16:36,168 INFO L290 TraceCheckUtils]: 36: Hoare triple {224290#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {224289#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:16:36,168 INFO L290 TraceCheckUtils]: 35: Hoare triple {224291#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {224290#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:36,169 INFO L290 TraceCheckUtils]: 34: Hoare triple {224292#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {224291#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:36,170 INFO L290 TraceCheckUtils]: 33: Hoare triple {224293#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {224292#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:36,171 INFO L290 TraceCheckUtils]: 32: Hoare triple {224294#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {224293#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:16:36,172 INFO L290 TraceCheckUtils]: 31: Hoare triple {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {224294#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:36,172 INFO L290 TraceCheckUtils]: 30: Hoare triple {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:36,172 INFO L290 TraceCheckUtils]: 29: Hoare triple {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:36,173 INFO L290 TraceCheckUtils]: 28: Hoare triple {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:36,173 INFO L290 TraceCheckUtils]: 27: Hoare triple {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:36,174 INFO L290 TraceCheckUtils]: 26: Hoare triple {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:36,174 INFO L290 TraceCheckUtils]: 25: Hoare triple {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:36,174 INFO L290 TraceCheckUtils]: 24: Hoare triple {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:36,175 INFO L290 TraceCheckUtils]: 23: Hoare triple {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:36,175 INFO L290 TraceCheckUtils]: 22: Hoare triple {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:36,176 INFO L290 TraceCheckUtils]: 21: Hoare triple {224294#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {224295#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:36,176 INFO L290 TraceCheckUtils]: 20: Hoare triple {224293#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {224294#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:36,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {224292#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {224293#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-08 10:16:36,178 INFO L290 TraceCheckUtils]: 18: Hoare triple {224291#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {224292#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:36,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {224290#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {224291#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:36,179 INFO L290 TraceCheckUtils]: 16: Hoare triple {224289#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {224290#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-08 10:16:36,180 INFO L290 TraceCheckUtils]: 15: Hoare triple {224288#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {224289#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-08 10:16:36,180 INFO L290 TraceCheckUtils]: 14: Hoare triple {224288#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {224288#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:16:36,181 INFO L290 TraceCheckUtils]: 13: Hoare triple {224283#true} assume !(~x~0 % 4294967296 > 0); {224288#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 10:16:36,181 INFO L290 TraceCheckUtils]: 12: Hoare triple {224283#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {224283#true} is VALID [2022-04-08 10:16:36,181 INFO L290 TraceCheckUtils]: 11: Hoare triple {224283#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {224283#true} is VALID [2022-04-08 10:16:36,181 INFO L290 TraceCheckUtils]: 10: Hoare triple {224283#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {224283#true} is VALID [2022-04-08 10:16:36,181 INFO L290 TraceCheckUtils]: 9: Hoare triple {224283#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {224283#true} is VALID [2022-04-08 10:16:36,181 INFO L290 TraceCheckUtils]: 8: Hoare triple {224283#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {224283#true} is VALID [2022-04-08 10:16:36,181 INFO L290 TraceCheckUtils]: 7: Hoare triple {224283#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {224283#true} is VALID [2022-04-08 10:16:36,181 INFO L290 TraceCheckUtils]: 6: Hoare triple {224283#true} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {224283#true} is VALID [2022-04-08 10:16:36,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {224283#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {224283#true} is VALID [2022-04-08 10:16:36,181 INFO L272 TraceCheckUtils]: 4: Hoare triple {224283#true} call #t~ret13 := main(); {224283#true} is VALID [2022-04-08 10:16:36,181 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {224283#true} {224283#true} #72#return; {224283#true} is VALID [2022-04-08 10:16:36,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {224283#true} assume true; {224283#true} is VALID [2022-04-08 10:16:36,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {224283#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {224283#true} is VALID [2022-04-08 10:16:36,181 INFO L272 TraceCheckUtils]: 0: Hoare triple {224283#true} call ULTIMATE.init(); {224283#true} is VALID [2022-04-08 10:16:36,182 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-04-08 10:16:36,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035376716] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:16:36,182 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:16:36,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 11 [2022-04-08 10:16:36,182 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:16:36,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1454226605] [2022-04-08 10:16:36,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1454226605] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:16:36,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:16:36,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 10:16:36,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458944870] [2022-04-08 10:16:36,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:16:36,182 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 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 44 [2022-04-08 10:16:36,182 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:16:36,182 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 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-08 10:16:36,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:16:36,202 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 10:16:36,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:16:36,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 10:16:36,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-04-08 10:16:36,202 INFO L87 Difference]: Start difference. First operand 629 states and 854 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 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-08 10:16:40,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:16:40,758 INFO L93 Difference]: Finished difference Result 659 states and 885 transitions. [2022-04-08 10:16:40,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 10:16:40,758 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 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 44 [2022-04-08 10:16:40,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:16:40,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 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-08 10:16:40,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 66 transitions. [2022-04-08 10:16:40,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 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-08 10:16:40,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 66 transitions. [2022-04-08 10:16:40,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 66 transitions. [2022-04-08 10:16:40,809 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:16:40,823 INFO L225 Difference]: With dead ends: 659 [2022-04-08 10:16:40,823 INFO L226 Difference]: Without dead ends: 628 [2022-04-08 10:16:40,823 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-08 10:16:40,823 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 49 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:16:40,823 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 79 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 10:16:40,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2022-04-08 10:16:44,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 621. [2022-04-08 10:16:44,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:16:44,765 INFO L82 GeneralOperation]: Start isEquivalent. First operand 628 states. Second operand has 621 states, 616 states have (on average 1.3652597402597402) internal successors, (841), 616 states have internal predecessors, (841), 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-08 10:16:44,766 INFO L74 IsIncluded]: Start isIncluded. First operand 628 states. Second operand has 621 states, 616 states have (on average 1.3652597402597402) internal successors, (841), 616 states have internal predecessors, (841), 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-08 10:16:44,766 INFO L87 Difference]: Start difference. First operand 628 states. Second operand has 621 states, 616 states have (on average 1.3652597402597402) internal successors, (841), 616 states have internal predecessors, (841), 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-08 10:16:44,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:16:44,776 INFO L93 Difference]: Finished difference Result 628 states and 852 transitions. [2022-04-08 10:16:44,776 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 852 transitions. [2022-04-08 10:16:44,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:16:44,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:16:44,777 INFO L74 IsIncluded]: Start isIncluded. First operand has 621 states, 616 states have (on average 1.3652597402597402) internal successors, (841), 616 states have internal predecessors, (841), 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 628 states. [2022-04-08 10:16:44,777 INFO L87 Difference]: Start difference. First operand has 621 states, 616 states have (on average 1.3652597402597402) internal successors, (841), 616 states have internal predecessors, (841), 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 628 states. [2022-04-08 10:16:44,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:16:44,788 INFO L93 Difference]: Finished difference Result 628 states and 852 transitions. [2022-04-08 10:16:44,788 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 852 transitions. [2022-04-08 10:16:44,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:16:44,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:16:44,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:16:44,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:16:44,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 616 states have (on average 1.3652597402597402) internal successors, (841), 616 states have internal predecessors, (841), 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-08 10:16:44,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 845 transitions. [2022-04-08 10:16:44,802 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 845 transitions. Word has length 44 [2022-04-08 10:16:44,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:16:44,803 INFO L478 AbstractCegarLoop]: Abstraction has 621 states and 845 transitions. [2022-04-08 10:16:44,803 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 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-08 10:16:44,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 621 states and 845 transitions. [2022-04-08 10:16:50,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 845 edges. 845 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:16:50,675 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 845 transitions. [2022-04-08 10:16:50,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-08 10:16:50,675 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:16:50,675 INFO L499 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:16:50,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Forceful destruction successful, exit code 0 [2022-04-08 10:16:50,891 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 95 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable96 [2022-04-08 10:16:50,892 INFO L403 AbstractCegarLoop]: === Iteration 98 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:16:50,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:16:50,892 INFO L85 PathProgramCache]: Analyzing trace with hash 419283361, now seen corresponding path program 57 times [2022-04-08 10:16:50,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:16:50,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1924675803] [2022-04-08 10:16:50,894 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:16:50,894 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:16:50,894 INFO L85 PathProgramCache]: Analyzing trace with hash 419283361, now seen corresponding path program 58 times [2022-04-08 10:16:50,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:16:50,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833052170] [2022-04-08 10:16:50,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:16:50,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:16:50,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:16:51,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:16:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:16:51,393 INFO L290 TraceCheckUtils]: 0: Hoare triple {228428#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {228392#true} is VALID [2022-04-08 10:16:51,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {228392#true} assume true; {228392#true} is VALID [2022-04-08 10:16:51,393 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {228392#true} {228392#true} #72#return; {228392#true} is VALID [2022-04-08 10:16:51,393 INFO L272 TraceCheckUtils]: 0: Hoare triple {228392#true} call ULTIMATE.init(); {228428#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:16:51,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {228428#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {228392#true} is VALID [2022-04-08 10:16:51,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {228392#true} assume true; {228392#true} is VALID [2022-04-08 10:16:51,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {228392#true} {228392#true} #72#return; {228392#true} is VALID [2022-04-08 10:16:51,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {228392#true} call #t~ret13 := main(); {228392#true} is VALID [2022-04-08 10:16:51,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {228392#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {228397#(= main_~y~0 0)} is VALID [2022-04-08 10:16:51,394 INFO L290 TraceCheckUtils]: 6: Hoare triple {228397#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228398#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:16:51,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {228398#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228399#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:16:51,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {228399#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228400#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:16:51,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {228400#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228401#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:16:51,396 INFO L290 TraceCheckUtils]: 10: Hoare triple {228401#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228402#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:16:51,396 INFO L290 TraceCheckUtils]: 11: Hoare triple {228402#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228403#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:16:51,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {228403#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228404#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:16:51,397 INFO L290 TraceCheckUtils]: 13: Hoare triple {228404#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228405#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:16:51,397 INFO L290 TraceCheckUtils]: 14: Hoare triple {228405#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228406#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:16:51,398 INFO L290 TraceCheckUtils]: 15: Hoare triple {228406#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228407#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:16:51,398 INFO L290 TraceCheckUtils]: 16: Hoare triple {228407#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228408#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:16:51,399 INFO L290 TraceCheckUtils]: 17: Hoare triple {228408#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228409#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:16:51,399 INFO L290 TraceCheckUtils]: 18: Hoare triple {228409#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228410#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:16:51,399 INFO L290 TraceCheckUtils]: 19: Hoare triple {228410#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228411#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:16:51,400 INFO L290 TraceCheckUtils]: 20: Hoare triple {228411#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228412#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:16:51,400 INFO L290 TraceCheckUtils]: 21: Hoare triple {228412#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228413#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:16:51,401 INFO L290 TraceCheckUtils]: 22: Hoare triple {228413#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228414#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:16:51,401 INFO L290 TraceCheckUtils]: 23: Hoare triple {228414#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228415#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:16:51,402 INFO L290 TraceCheckUtils]: 24: Hoare triple {228415#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228416#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:16:51,402 INFO L290 TraceCheckUtils]: 25: Hoare triple {228416#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228417#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:16:51,402 INFO L290 TraceCheckUtils]: 26: Hoare triple {228417#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228418#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:16:51,403 INFO L290 TraceCheckUtils]: 27: Hoare triple {228418#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228419#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:16:51,403 INFO L290 TraceCheckUtils]: 28: Hoare triple {228419#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228420#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:16:51,404 INFO L290 TraceCheckUtils]: 29: Hoare triple {228420#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228421#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-08 10:16:51,404 INFO L290 TraceCheckUtils]: 30: Hoare triple {228421#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228422#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-08 10:16:51,405 INFO L290 TraceCheckUtils]: 31: Hoare triple {228422#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228423#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-08 10:16:51,405 INFO L290 TraceCheckUtils]: 32: Hoare triple {228423#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228424#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-08 10:16:51,405 INFO L290 TraceCheckUtils]: 33: Hoare triple {228424#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228425#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-08 10:16:51,406 INFO L290 TraceCheckUtils]: 34: Hoare triple {228425#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228426#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-08 10:16:51,406 INFO L290 TraceCheckUtils]: 35: Hoare triple {228426#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !(~x~0 % 4294967296 > 0); {228426#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-08 10:16:51,407 INFO L290 TraceCheckUtils]: 36: Hoare triple {228426#(and (<= 29 main_~y~0) (<= main_~y~0 29))} ~z~0 := ~y~0; {228427#(and (<= (div main_~z~0 4294967296) 0) (<= 29 main_~z~0))} is VALID [2022-04-08 10:16:51,407 INFO L290 TraceCheckUtils]: 37: Hoare triple {228427#(and (<= (div main_~z~0 4294967296) 0) (<= 29 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {228393#false} is VALID [2022-04-08 10:16:51,407 INFO L290 TraceCheckUtils]: 38: Hoare triple {228393#false} assume !(~y~0 % 4294967296 > 0); {228393#false} is VALID [2022-04-08 10:16:51,407 INFO L290 TraceCheckUtils]: 39: Hoare triple {228393#false} assume !(~x~0 % 4294967296 > 0); {228393#false} is VALID [2022-04-08 10:16:51,407 INFO L272 TraceCheckUtils]: 40: Hoare triple {228393#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {228393#false} is VALID [2022-04-08 10:16:51,407 INFO L290 TraceCheckUtils]: 41: Hoare triple {228393#false} ~cond := #in~cond; {228393#false} is VALID [2022-04-08 10:16:51,407 INFO L290 TraceCheckUtils]: 42: Hoare triple {228393#false} assume 0 == ~cond; {228393#false} is VALID [2022-04-08 10:16:51,407 INFO L290 TraceCheckUtils]: 43: Hoare triple {228393#false} assume !false; {228393#false} is VALID [2022-04-08 10:16:51,407 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:16:51,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:16:51,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833052170] [2022-04-08 10:16:51,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833052170] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:16:51,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088166629] [2022-04-08 10:16:51,408 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 10:16:51,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:16:51,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:16:51,409 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:16:51,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process [2022-04-08 10:16:51,455 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 10:16:51,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:16:51,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 63 conjunts are in the unsatisfiable core [2022-04-08 10:16:51,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:16:51,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:16:51,905 INFO L272 TraceCheckUtils]: 0: Hoare triple {228392#true} call ULTIMATE.init(); {228392#true} is VALID [2022-04-08 10:16:51,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {228392#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {228392#true} is VALID [2022-04-08 10:16:51,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {228392#true} assume true; {228392#true} is VALID [2022-04-08 10:16:51,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {228392#true} {228392#true} #72#return; {228392#true} is VALID [2022-04-08 10:16:51,905 INFO L272 TraceCheckUtils]: 4: Hoare triple {228392#true} call #t~ret13 := main(); {228392#true} is VALID [2022-04-08 10:16:51,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {228392#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {228397#(= main_~y~0 0)} is VALID [2022-04-08 10:16:51,906 INFO L290 TraceCheckUtils]: 6: Hoare triple {228397#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228398#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:16:51,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {228398#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228399#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:16:51,907 INFO L290 TraceCheckUtils]: 8: Hoare triple {228399#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228400#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:16:51,907 INFO L290 TraceCheckUtils]: 9: Hoare triple {228400#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228401#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:16:51,908 INFO L290 TraceCheckUtils]: 10: Hoare triple {228401#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228402#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:16:51,908 INFO L290 TraceCheckUtils]: 11: Hoare triple {228402#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228403#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:16:51,909 INFO L290 TraceCheckUtils]: 12: Hoare triple {228403#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228404#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:16:51,909 INFO L290 TraceCheckUtils]: 13: Hoare triple {228404#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228405#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:16:51,910 INFO L290 TraceCheckUtils]: 14: Hoare triple {228405#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228406#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:16:51,910 INFO L290 TraceCheckUtils]: 15: Hoare triple {228406#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228407#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:16:51,911 INFO L290 TraceCheckUtils]: 16: Hoare triple {228407#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228408#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-08 10:16:51,912 INFO L290 TraceCheckUtils]: 17: Hoare triple {228408#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228409#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-08 10:16:51,912 INFO L290 TraceCheckUtils]: 18: Hoare triple {228409#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228410#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-08 10:16:51,913 INFO L290 TraceCheckUtils]: 19: Hoare triple {228410#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228411#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-08 10:16:51,913 INFO L290 TraceCheckUtils]: 20: Hoare triple {228411#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228412#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-08 10:16:51,914 INFO L290 TraceCheckUtils]: 21: Hoare triple {228412#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228413#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-08 10:16:51,914 INFO L290 TraceCheckUtils]: 22: Hoare triple {228413#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228414#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-08 10:16:51,915 INFO L290 TraceCheckUtils]: 23: Hoare triple {228414#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228415#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-08 10:16:51,915 INFO L290 TraceCheckUtils]: 24: Hoare triple {228415#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228416#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-08 10:16:51,916 INFO L290 TraceCheckUtils]: 25: Hoare triple {228416#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228417#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-08 10:16:51,916 INFO L290 TraceCheckUtils]: 26: Hoare triple {228417#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228418#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-08 10:16:51,917 INFO L290 TraceCheckUtils]: 27: Hoare triple {228418#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228419#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-08 10:16:51,917 INFO L290 TraceCheckUtils]: 28: Hoare triple {228419#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228420#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-08 10:16:51,918 INFO L290 TraceCheckUtils]: 29: Hoare triple {228420#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228421#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-08 10:16:51,918 INFO L290 TraceCheckUtils]: 30: Hoare triple {228421#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228422#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-08 10:16:51,919 INFO L290 TraceCheckUtils]: 31: Hoare triple {228422#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228423#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-08 10:16:51,919 INFO L290 TraceCheckUtils]: 32: Hoare triple {228423#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228424#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-08 10:16:51,920 INFO L290 TraceCheckUtils]: 33: Hoare triple {228424#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228425#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-08 10:16:51,920 INFO L290 TraceCheckUtils]: 34: Hoare triple {228425#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228426#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-08 10:16:51,921 INFO L290 TraceCheckUtils]: 35: Hoare triple {228426#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !(~x~0 % 4294967296 > 0); {228426#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-08 10:16:51,921 INFO L290 TraceCheckUtils]: 36: Hoare triple {228426#(and (<= 29 main_~y~0) (<= main_~y~0 29))} ~z~0 := ~y~0; {228540#(and (<= main_~z~0 29) (<= 29 main_~z~0))} is VALID [2022-04-08 10:16:51,921 INFO L290 TraceCheckUtils]: 37: Hoare triple {228540#(and (<= main_~z~0 29) (<= 29 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {228393#false} is VALID [2022-04-08 10:16:51,921 INFO L290 TraceCheckUtils]: 38: Hoare triple {228393#false} assume !(~y~0 % 4294967296 > 0); {228393#false} is VALID [2022-04-08 10:16:51,921 INFO L290 TraceCheckUtils]: 39: Hoare triple {228393#false} assume !(~x~0 % 4294967296 > 0); {228393#false} is VALID [2022-04-08 10:16:51,921 INFO L272 TraceCheckUtils]: 40: Hoare triple {228393#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {228393#false} is VALID [2022-04-08 10:16:51,921 INFO L290 TraceCheckUtils]: 41: Hoare triple {228393#false} ~cond := #in~cond; {228393#false} is VALID [2022-04-08 10:16:51,922 INFO L290 TraceCheckUtils]: 42: Hoare triple {228393#false} assume 0 == ~cond; {228393#false} is VALID [2022-04-08 10:16:51,922 INFO L290 TraceCheckUtils]: 43: Hoare triple {228393#false} assume !false; {228393#false} is VALID [2022-04-08 10:16:51,922 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:16:51,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:16:53,109 INFO L290 TraceCheckUtils]: 43: Hoare triple {228393#false} assume !false; {228393#false} is VALID [2022-04-08 10:16:53,109 INFO L290 TraceCheckUtils]: 42: Hoare triple {228393#false} assume 0 == ~cond; {228393#false} is VALID [2022-04-08 10:16:53,109 INFO L290 TraceCheckUtils]: 41: Hoare triple {228393#false} ~cond := #in~cond; {228393#false} is VALID [2022-04-08 10:16:53,109 INFO L272 TraceCheckUtils]: 40: Hoare triple {228393#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {228393#false} is VALID [2022-04-08 10:16:53,109 INFO L290 TraceCheckUtils]: 39: Hoare triple {228393#false} assume !(~x~0 % 4294967296 > 0); {228393#false} is VALID [2022-04-08 10:16:53,109 INFO L290 TraceCheckUtils]: 38: Hoare triple {228393#false} assume !(~y~0 % 4294967296 > 0); {228393#false} is VALID [2022-04-08 10:16:53,109 INFO L290 TraceCheckUtils]: 37: Hoare triple {228580#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {228393#false} is VALID [2022-04-08 10:16:53,110 INFO L290 TraceCheckUtils]: 36: Hoare triple {228584#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {228580#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:16:53,110 INFO L290 TraceCheckUtils]: 35: Hoare triple {228584#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {228584#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:16:53,110 INFO L290 TraceCheckUtils]: 34: Hoare triple {228591#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228584#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:16:53,111 INFO L290 TraceCheckUtils]: 33: Hoare triple {228595#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228591#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:16:53,111 INFO L290 TraceCheckUtils]: 32: Hoare triple {228599#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228595#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:16:53,112 INFO L290 TraceCheckUtils]: 31: Hoare triple {228603#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228599#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:16:53,112 INFO L290 TraceCheckUtils]: 30: Hoare triple {228607#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228603#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:16:53,113 INFO L290 TraceCheckUtils]: 29: Hoare triple {228611#(< 0 (mod (+ main_~y~0 6) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228607#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:16:53,113 INFO L290 TraceCheckUtils]: 28: Hoare triple {228615#(< 0 (mod (+ 7 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228611#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-08 10:16:53,114 INFO L290 TraceCheckUtils]: 27: Hoare triple {228619#(< 0 (mod (+ main_~y~0 8) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228615#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-08 10:16:53,114 INFO L290 TraceCheckUtils]: 26: Hoare triple {228623#(< 0 (mod (+ main_~y~0 9) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228619#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-08 10:16:53,115 INFO L290 TraceCheckUtils]: 25: Hoare triple {228627#(< 0 (mod (+ main_~y~0 10) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228623#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-08 10:16:53,115 INFO L290 TraceCheckUtils]: 24: Hoare triple {228631#(< 0 (mod (+ main_~y~0 11) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228627#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-08 10:16:53,116 INFO L290 TraceCheckUtils]: 23: Hoare triple {228635#(< 0 (mod (+ main_~y~0 12) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228631#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-08 10:16:53,116 INFO L290 TraceCheckUtils]: 22: Hoare triple {228639#(< 0 (mod (+ main_~y~0 13) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228635#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-08 10:16:53,117 INFO L290 TraceCheckUtils]: 21: Hoare triple {228643#(< 0 (mod (+ main_~y~0 14) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228639#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-08 10:16:53,117 INFO L290 TraceCheckUtils]: 20: Hoare triple {228647#(< 0 (mod (+ main_~y~0 15) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228643#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-08 10:16:53,118 INFO L290 TraceCheckUtils]: 19: Hoare triple {228651#(< 0 (mod (+ main_~y~0 16) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228647#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-08 10:16:53,118 INFO L290 TraceCheckUtils]: 18: Hoare triple {228655#(< 0 (mod (+ main_~y~0 17) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228651#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-08 10:16:53,119 INFO L290 TraceCheckUtils]: 17: Hoare triple {228659#(< 0 (mod (+ main_~y~0 18) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228655#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-08 10:16:53,119 INFO L290 TraceCheckUtils]: 16: Hoare triple {228663#(< 0 (mod (+ 19 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228659#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-08 10:16:53,120 INFO L290 TraceCheckUtils]: 15: Hoare triple {228667#(< 0 (mod (+ main_~y~0 20) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228663#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-08 10:16:53,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {228671#(< 0 (mod (+ main_~y~0 21) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228667#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-08 10:16:53,121 INFO L290 TraceCheckUtils]: 13: Hoare triple {228675#(< 0 (mod (+ main_~y~0 22) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228671#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-08 10:16:53,121 INFO L290 TraceCheckUtils]: 12: Hoare triple {228679#(< 0 (mod (+ 23 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228675#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-08 10:16:53,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {228683#(< 0 (mod (+ main_~y~0 24) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228679#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID [2022-04-08 10:16:53,122 INFO L290 TraceCheckUtils]: 10: Hoare triple {228687#(< 0 (mod (+ main_~y~0 25) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228683#(< 0 (mod (+ main_~y~0 24) 4294967296))} is VALID [2022-04-08 10:16:53,123 INFO L290 TraceCheckUtils]: 9: Hoare triple {228691#(< 0 (mod (+ main_~y~0 26) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228687#(< 0 (mod (+ main_~y~0 25) 4294967296))} is VALID [2022-04-08 10:16:53,123 INFO L290 TraceCheckUtils]: 8: Hoare triple {228695#(< 0 (mod (+ main_~y~0 27) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228691#(< 0 (mod (+ main_~y~0 26) 4294967296))} is VALID [2022-04-08 10:16:53,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {228699#(< 0 (mod (+ main_~y~0 28) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228695#(< 0 (mod (+ main_~y~0 27) 4294967296))} is VALID [2022-04-08 10:16:53,124 INFO L290 TraceCheckUtils]: 6: Hoare triple {228703#(< 0 (mod (+ 29 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {228699#(< 0 (mod (+ main_~y~0 28) 4294967296))} is VALID [2022-04-08 10:16:53,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {228392#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {228703#(< 0 (mod (+ 29 main_~y~0) 4294967296))} is VALID [2022-04-08 10:16:53,125 INFO L272 TraceCheckUtils]: 4: Hoare triple {228392#true} call #t~ret13 := main(); {228392#true} is VALID [2022-04-08 10:16:53,125 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {228392#true} {228392#true} #72#return; {228392#true} is VALID [2022-04-08 10:16:53,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {228392#true} assume true; {228392#true} is VALID [2022-04-08 10:16:53,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {228392#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {228392#true} is VALID [2022-04-08 10:16:53,125 INFO L272 TraceCheckUtils]: 0: Hoare triple {228392#true} call ULTIMATE.init(); {228392#true} is VALID [2022-04-08 10:16:53,125 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:16:53,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088166629] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:16:53,125 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:16:53,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 33] total 66 [2022-04-08 10:16:53,125 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:16:53,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1924675803] [2022-04-08 10:16:53,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1924675803] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:16:53,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:16:53,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-08 10:16:53,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956254967] [2022-04-08 10:16:53,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:16:53,126 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 33 states have internal predecessors, (40), 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 44 [2022-04-08 10:16:53,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:16:53,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 33 states have internal predecessors, (40), 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-08 10:16:53,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:16:53,142 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-08 10:16:53,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:16:53,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-08 10:16:53,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1031, Invalid=3259, Unknown=0, NotChecked=0, Total=4290 [2022-04-08 10:16:53,142 INFO L87 Difference]: Start difference. First operand 621 states and 845 transitions. Second operand has 34 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 33 states have internal predecessors, (40), 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-08 10:17:10,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:17:10,317 INFO L93 Difference]: Finished difference Result 1080 states and 1657 transitions. [2022-04-08 10:17:10,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-08 10:17:10,317 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 33 states have internal predecessors, (40), 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 44 [2022-04-08 10:17:10,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:17:10,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 33 states have internal predecessors, (40), 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-08 10:17:10,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 297 transitions. [2022-04-08 10:17:10,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 33 states have internal predecessors, (40), 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-08 10:17:10,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 297 transitions. [2022-04-08 10:17:10,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 297 transitions. [2022-04-08 10:17:10,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 297 edges. 297 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:17:10,522 INFO L225 Difference]: With dead ends: 1080 [2022-04-08 10:17:10,522 INFO L226 Difference]: Without dead ends: 1046 [2022-04-08 10:17:10,522 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2087, Invalid=7225, Unknown=0, NotChecked=0, Total=9312 [2022-04-08 10:17:10,523 INFO L913 BasicCegarLoop]: 134 mSDtfsCounter, 226 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 7409 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 7574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 7409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:17:10,523 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [226 Valid, 291 Invalid, 7574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 7409 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-04-08 10:17:10,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2022-04-08 10:17:12,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 644. [2022-04-08 10:17:12,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:17:12,997 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1046 states. Second operand has 644 states, 639 states have (on average 1.3693270735524257) internal successors, (875), 639 states have internal predecessors, (875), 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-08 10:17:12,997 INFO L74 IsIncluded]: Start isIncluded. First operand 1046 states. Second operand has 644 states, 639 states have (on average 1.3693270735524257) internal successors, (875), 639 states have internal predecessors, (875), 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-08 10:17:12,998 INFO L87 Difference]: Start difference. First operand 1046 states. Second operand has 644 states, 639 states have (on average 1.3693270735524257) internal successors, (875), 639 states have internal predecessors, (875), 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-08 10:17:13,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:17:13,025 INFO L93 Difference]: Finished difference Result 1046 states and 1311 transitions. [2022-04-08 10:17:13,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1311 transitions. [2022-04-08 10:17:13,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:17:13,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:17:13,026 INFO L74 IsIncluded]: Start isIncluded. First operand has 644 states, 639 states have (on average 1.3693270735524257) internal successors, (875), 639 states have internal predecessors, (875), 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 1046 states. [2022-04-08 10:17:13,027 INFO L87 Difference]: Start difference. First operand has 644 states, 639 states have (on average 1.3693270735524257) internal successors, (875), 639 states have internal predecessors, (875), 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 1046 states. [2022-04-08 10:17:13,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:17:13,059 INFO L93 Difference]: Finished difference Result 1046 states and 1311 transitions. [2022-04-08 10:17:13,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1311 transitions. [2022-04-08 10:17:13,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:17:13,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:17:13,060 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:17:13,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:17:13,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 639 states have (on average 1.3693270735524257) internal successors, (875), 639 states have internal predecessors, (875), 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-08 10:17:13,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 879 transitions. [2022-04-08 10:17:13,075 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 879 transitions. Word has length 44 [2022-04-08 10:17:13,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:17:13,076 INFO L478 AbstractCegarLoop]: Abstraction has 644 states and 879 transitions. [2022-04-08 10:17:13,076 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 33 states have internal predecessors, (40), 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-08 10:17:13,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 644 states and 879 transitions. [2022-04-08 10:17:19,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 879 edges. 879 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:17:19,720 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 879 transitions. [2022-04-08 10:17:19,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-08 10:17:19,721 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:17:19,721 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:17:19,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Ended with exit code 0 [2022-04-08 10:17:19,935 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 96 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable97 [2022-04-08 10:17:19,935 INFO L403 AbstractCegarLoop]: === Iteration 99 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:17:19,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:17:19,936 INFO L85 PathProgramCache]: Analyzing trace with hash 63675064, now seen corresponding path program 97 times [2022-04-08 10:17:19,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:17:19,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1324137865] [2022-04-08 10:17:19,938 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:17:19,938 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:17:19,938 INFO L85 PathProgramCache]: Analyzing trace with hash 63675064, now seen corresponding path program 98 times [2022-04-08 10:17:19,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:17:19,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073015213] [2022-04-08 10:17:19,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:17:19,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:17:19,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:17:20,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:17:20,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:17:20,229 INFO L290 TraceCheckUtils]: 0: Hoare triple {234348#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {234326#true} is VALID [2022-04-08 10:17:20,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {234326#true} assume true; {234326#true} is VALID [2022-04-08 10:17:20,229 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {234326#true} {234326#true} #72#return; {234326#true} is VALID [2022-04-08 10:17:20,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {234326#true} call ULTIMATE.init(); {234348#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:17:20,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {234348#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {234326#true} is VALID [2022-04-08 10:17:20,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {234326#true} assume true; {234326#true} is VALID [2022-04-08 10:17:20,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234326#true} {234326#true} #72#return; {234326#true} is VALID [2022-04-08 10:17:20,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {234326#true} call #t~ret13 := main(); {234326#true} is VALID [2022-04-08 10:17:20,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {234326#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {234331#(= main_~y~0 0)} is VALID [2022-04-08 10:17:20,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {234331#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {234332#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:17:20,231 INFO L290 TraceCheckUtils]: 7: Hoare triple {234332#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {234333#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:17:20,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {234333#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {234334#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:17:20,232 INFO L290 TraceCheckUtils]: 9: Hoare triple {234334#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {234335#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:17:20,233 INFO L290 TraceCheckUtils]: 10: Hoare triple {234335#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {234336#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:17:20,233 INFO L290 TraceCheckUtils]: 11: Hoare triple {234336#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {234337#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:17:20,234 INFO L290 TraceCheckUtils]: 12: Hoare triple {234337#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {234338#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:17:20,234 INFO L290 TraceCheckUtils]: 13: Hoare triple {234338#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {234339#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:17:20,235 INFO L290 TraceCheckUtils]: 14: Hoare triple {234339#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {234340#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:17:20,235 INFO L290 TraceCheckUtils]: 15: Hoare triple {234340#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {234341#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:17:20,236 INFO L290 TraceCheckUtils]: 16: Hoare triple {234341#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {234341#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:17:20,236 INFO L290 TraceCheckUtils]: 17: Hoare triple {234341#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {234342#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:17:20,237 INFO L290 TraceCheckUtils]: 18: Hoare triple {234342#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {234343#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:17:20,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {234343#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {234344#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:17:20,238 INFO L290 TraceCheckUtils]: 20: Hoare triple {234344#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {234345#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:17:20,238 INFO L290 TraceCheckUtils]: 21: Hoare triple {234345#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {234346#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:17:20,239 INFO L290 TraceCheckUtils]: 22: Hoare triple {234346#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {234347#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-08 10:17:20,239 INFO L290 TraceCheckUtils]: 23: Hoare triple {234347#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {234327#false} is VALID [2022-04-08 10:17:20,239 INFO L290 TraceCheckUtils]: 24: Hoare triple {234327#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {234327#false} is VALID [2022-04-08 10:17:20,239 INFO L290 TraceCheckUtils]: 25: Hoare triple {234327#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {234327#false} is VALID [2022-04-08 10:17:20,239 INFO L290 TraceCheckUtils]: 26: Hoare triple {234327#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {234327#false} is VALID [2022-04-08 10:17:20,239 INFO L290 TraceCheckUtils]: 27: Hoare triple {234327#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {234327#false} is VALID [2022-04-08 10:17:20,239 INFO L290 TraceCheckUtils]: 28: Hoare triple {234327#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {234327#false} is VALID [2022-04-08 10:17:20,239 INFO L290 TraceCheckUtils]: 29: Hoare triple {234327#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {234327#false} is VALID [2022-04-08 10:17:20,239 INFO L290 TraceCheckUtils]: 30: Hoare triple {234327#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {234327#false} is VALID [2022-04-08 10:17:20,239 INFO L290 TraceCheckUtils]: 31: Hoare triple {234327#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {234327#false} is VALID [2022-04-08 10:17:20,240 INFO L290 TraceCheckUtils]: 32: Hoare triple {234327#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {234327#false} is VALID [2022-04-08 10:17:20,240 INFO L290 TraceCheckUtils]: 33: Hoare triple {234327#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {234327#false} is VALID [2022-04-08 10:17:20,240 INFO L290 TraceCheckUtils]: 34: Hoare triple {234327#false} assume !(~y~0 % 4294967296 > 0); {234327#false} is VALID [2022-04-08 10:17:20,240 INFO L290 TraceCheckUtils]: 35: Hoare triple {234327#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {234327#false} is VALID [2022-04-08 10:17:20,240 INFO L290 TraceCheckUtils]: 36: Hoare triple {234327#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {234327#false} is VALID [2022-04-08 10:17:20,240 INFO L290 TraceCheckUtils]: 37: Hoare triple {234327#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {234327#false} is VALID [2022-04-08 10:17:20,240 INFO L290 TraceCheckUtils]: 38: Hoare triple {234327#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {234327#false} is VALID [2022-04-08 10:17:20,240 INFO L290 TraceCheckUtils]: 39: Hoare triple {234327#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {234327#false} is VALID [2022-04-08 10:17:20,240 INFO L290 TraceCheckUtils]: 40: Hoare triple {234327#false} assume !(~x~0 % 4294967296 > 0); {234327#false} is VALID [2022-04-08 10:17:20,240 INFO L272 TraceCheckUtils]: 41: Hoare triple {234327#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {234327#false} is VALID [2022-04-08 10:17:20,240 INFO L290 TraceCheckUtils]: 42: Hoare triple {234327#false} ~cond := #in~cond; {234327#false} is VALID [2022-04-08 10:17:20,240 INFO L290 TraceCheckUtils]: 43: Hoare triple {234327#false} assume 0 == ~cond; {234327#false} is VALID [2022-04-08 10:17:20,240 INFO L290 TraceCheckUtils]: 44: Hoare triple {234327#false} assume !false; {234327#false} is VALID [2022-04-08 10:17:20,240 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-04-08 10:17:20,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:17:20,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073015213] [2022-04-08 10:17:20,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073015213] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:17:20,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352848926] [2022-04-08 10:17:20,241 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:17:20,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:17:20,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:17:20,245 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:17:20,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Waiting until timeout for monitored process [2022-04-08 10:17:20,296 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:17:20,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:17:20,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-08 10:17:20,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:17:20,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:17:20,524 INFO L272 TraceCheckUtils]: 0: Hoare triple {234326#true} call ULTIMATE.init(); {234326#true} is VALID [2022-04-08 10:17:20,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {234326#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {234326#true} is VALID [2022-04-08 10:17:20,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {234326#true} assume true; {234326#true} is VALID [2022-04-08 10:17:20,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234326#true} {234326#true} #72#return; {234326#true} is VALID [2022-04-08 10:17:20,525 INFO L272 TraceCheckUtils]: 4: Hoare triple {234326#true} call #t~ret13 := main(); {234326#true} is VALID [2022-04-08 10:17:20,525 INFO L290 TraceCheckUtils]: 5: Hoare triple {234326#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {234331#(= main_~y~0 0)} is VALID [2022-04-08 10:17:20,525 INFO L290 TraceCheckUtils]: 6: Hoare triple {234331#(= main_~y~0 0)} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {234332#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-08 10:17:20,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {234332#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {234333#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-08 10:17:20,526 INFO L290 TraceCheckUtils]: 8: Hoare triple {234333#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {234334#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-08 10:17:20,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {234334#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {234335#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-08 10:17:20,527 INFO L290 TraceCheckUtils]: 10: Hoare triple {234335#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {234336#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-08 10:17:20,527 INFO L290 TraceCheckUtils]: 11: Hoare triple {234336#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {234337#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-08 10:17:20,528 INFO L290 TraceCheckUtils]: 12: Hoare triple {234337#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {234338#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-08 10:17:20,528 INFO L290 TraceCheckUtils]: 13: Hoare triple {234338#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {234339#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-08 10:17:20,529 INFO L290 TraceCheckUtils]: 14: Hoare triple {234339#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {234340#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-08 10:17:20,529 INFO L290 TraceCheckUtils]: 15: Hoare triple {234340#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {234341#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:17:20,529 INFO L290 TraceCheckUtils]: 16: Hoare triple {234341#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {234341#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-08 10:17:20,530 INFO L290 TraceCheckUtils]: 17: Hoare triple {234341#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {234342#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-08 10:17:20,530 INFO L290 TraceCheckUtils]: 18: Hoare triple {234342#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {234343#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-08 10:17:20,531 INFO L290 TraceCheckUtils]: 19: Hoare triple {234343#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {234344#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-08 10:17:20,531 INFO L290 TraceCheckUtils]: 20: Hoare triple {234344#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {234345#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-08 10:17:20,531 INFO L290 TraceCheckUtils]: 21: Hoare triple {234345#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {234346#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-08 10:17:20,532 INFO L290 TraceCheckUtils]: 22: Hoare triple {234346#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {234418#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-08 10:17:20,532 INFO L290 TraceCheckUtils]: 23: Hoare triple {234418#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {234327#false} is VALID [2022-04-08 10:17:20,532 INFO L290 TraceCheckUtils]: 24: Hoare triple {234327#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {234327#false} is VALID [2022-04-08 10:17:20,532 INFO L290 TraceCheckUtils]: 25: Hoare triple {234327#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {234327#false} is VALID [2022-04-08 10:17:20,532 INFO L290 TraceCheckUtils]: 26: Hoare triple {234327#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {234327#false} is VALID [2022-04-08 10:17:20,532 INFO L290 TraceCheckUtils]: 27: Hoare triple {234327#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {234327#false} is VALID [2022-04-08 10:17:20,532 INFO L290 TraceCheckUtils]: 28: Hoare triple {234327#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {234327#false} is VALID [2022-04-08 10:17:20,533 INFO L290 TraceCheckUtils]: 29: Hoare triple {234327#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {234327#false} is VALID [2022-04-08 10:17:20,533 INFO L290 TraceCheckUtils]: 30: Hoare triple {234327#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {234327#false} is VALID [2022-04-08 10:17:20,533 INFO L290 TraceCheckUtils]: 31: Hoare triple {234327#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {234327#false} is VALID [2022-04-08 10:17:20,533 INFO L290 TraceCheckUtils]: 32: Hoare triple {234327#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {234327#false} is VALID [2022-04-08 10:17:20,533 INFO L290 TraceCheckUtils]: 33: Hoare triple {234327#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {234327#false} is VALID [2022-04-08 10:17:20,533 INFO L290 TraceCheckUtils]: 34: Hoare triple {234327#false} assume !(~y~0 % 4294967296 > 0); {234327#false} is VALID [2022-04-08 10:17:20,533 INFO L290 TraceCheckUtils]: 35: Hoare triple {234327#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {234327#false} is VALID [2022-04-08 10:17:20,533 INFO L290 TraceCheckUtils]: 36: Hoare triple {234327#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {234327#false} is VALID [2022-04-08 10:17:20,533 INFO L290 TraceCheckUtils]: 37: Hoare triple {234327#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {234327#false} is VALID [2022-04-08 10:17:20,533 INFO L290 TraceCheckUtils]: 38: Hoare triple {234327#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {234327#false} is VALID [2022-04-08 10:17:20,533 INFO L290 TraceCheckUtils]: 39: Hoare triple {234327#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {234327#false} is VALID [2022-04-08 10:17:20,533 INFO L290 TraceCheckUtils]: 40: Hoare triple {234327#false} assume !(~x~0 % 4294967296 > 0); {234327#false} is VALID [2022-04-08 10:17:20,533 INFO L272 TraceCheckUtils]: 41: Hoare triple {234327#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {234327#false} is VALID [2022-04-08 10:17:20,533 INFO L290 TraceCheckUtils]: 42: Hoare triple {234327#false} ~cond := #in~cond; {234327#false} is VALID [2022-04-08 10:17:20,533 INFO L290 TraceCheckUtils]: 43: Hoare triple {234327#false} assume 0 == ~cond; {234327#false} is VALID [2022-04-08 10:17:20,533 INFO L290 TraceCheckUtils]: 44: Hoare triple {234327#false} assume !false; {234327#false} is VALID [2022-04-08 10:17:20,533 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-04-08 10:17:20,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:17:20,963 INFO L290 TraceCheckUtils]: 44: Hoare triple {234327#false} assume !false; {234327#false} is VALID [2022-04-08 10:17:20,963 INFO L290 TraceCheckUtils]: 43: Hoare triple {234327#false} assume 0 == ~cond; {234327#false} is VALID [2022-04-08 10:17:20,963 INFO L290 TraceCheckUtils]: 42: Hoare triple {234327#false} ~cond := #in~cond; {234327#false} is VALID [2022-04-08 10:17:20,963 INFO L272 TraceCheckUtils]: 41: Hoare triple {234327#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {234327#false} is VALID [2022-04-08 10:17:20,963 INFO L290 TraceCheckUtils]: 40: Hoare triple {234327#false} assume !(~x~0 % 4294967296 > 0); {234327#false} is VALID [2022-04-08 10:17:20,963 INFO L290 TraceCheckUtils]: 39: Hoare triple {234327#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {234327#false} is VALID [2022-04-08 10:17:20,963 INFO L290 TraceCheckUtils]: 38: Hoare triple {234327#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {234327#false} is VALID [2022-04-08 10:17:20,963 INFO L290 TraceCheckUtils]: 37: Hoare triple {234327#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {234327#false} is VALID [2022-04-08 10:17:20,963 INFO L290 TraceCheckUtils]: 36: Hoare triple {234327#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {234327#false} is VALID [2022-04-08 10:17:20,965 INFO L290 TraceCheckUtils]: 35: Hoare triple {234327#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {234327#false} is VALID [2022-04-08 10:17:20,965 INFO L290 TraceCheckUtils]: 34: Hoare triple {234327#false} assume !(~y~0 % 4294967296 > 0); {234327#false} is VALID [2022-04-08 10:17:20,965 INFO L290 TraceCheckUtils]: 33: Hoare triple {234327#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {234327#false} is VALID [2022-04-08 10:17:20,965 INFO L290 TraceCheckUtils]: 32: Hoare triple {234327#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {234327#false} is VALID [2022-04-08 10:17:20,965 INFO L290 TraceCheckUtils]: 31: Hoare triple {234327#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {234327#false} is VALID [2022-04-08 10:17:20,965 INFO L290 TraceCheckUtils]: 30: Hoare triple {234327#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {234327#false} is VALID [2022-04-08 10:17:20,965 INFO L290 TraceCheckUtils]: 29: Hoare triple {234327#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {234327#false} is VALID [2022-04-08 10:17:20,965 INFO L290 TraceCheckUtils]: 28: Hoare triple {234327#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {234327#false} is VALID [2022-04-08 10:17:20,965 INFO L290 TraceCheckUtils]: 27: Hoare triple {234327#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {234327#false} is VALID [2022-04-08 10:17:20,965 INFO L290 TraceCheckUtils]: 26: Hoare triple {234327#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {234327#false} is VALID [2022-04-08 10:17:20,966 INFO L290 TraceCheckUtils]: 25: Hoare triple {234327#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {234327#false} is VALID [2022-04-08 10:17:20,966 INFO L290 TraceCheckUtils]: 24: Hoare triple {234327#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {234327#false} is VALID [2022-04-08 10:17:20,966 INFO L290 TraceCheckUtils]: 23: Hoare triple {234548#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {234327#false} is VALID [2022-04-08 10:17:20,966 INFO L290 TraceCheckUtils]: 22: Hoare triple {234552#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {234548#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-08 10:17:20,967 INFO L290 TraceCheckUtils]: 21: Hoare triple {234556#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {234552#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-08 10:17:20,968 INFO L290 TraceCheckUtils]: 20: Hoare triple {234560#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {234556#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-08 10:17:20,968 INFO L290 TraceCheckUtils]: 19: Hoare triple {234564#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {234560#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-08 10:17:20,969 INFO L290 TraceCheckUtils]: 18: Hoare triple {234568#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {234564#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-08 10:17:20,970 INFO L290 TraceCheckUtils]: 17: Hoare triple {234572#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} ~z~0 := ~y~0; {234568#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-08 10:17:20,970 INFO L290 TraceCheckUtils]: 16: Hoare triple {234572#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {234572#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:17:20,970 INFO L290 TraceCheckUtils]: 15: Hoare triple {234579#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {234572#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-08 10:17:20,971 INFO L290 TraceCheckUtils]: 14: Hoare triple {234583#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {234579#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-08 10:17:20,972 INFO L290 TraceCheckUtils]: 13: Hoare triple {234587#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {234583#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-08 10:17:20,972 INFO L290 TraceCheckUtils]: 12: Hoare triple {234591#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {234587#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-08 10:17:20,973 INFO L290 TraceCheckUtils]: 11: Hoare triple {234595#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {234591#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-08 10:17:20,973 INFO L290 TraceCheckUtils]: 10: Hoare triple {234599#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {234595#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-08 10:17:20,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {234603#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {234599#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-08 10:17:20,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {234607#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {234603#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-08 10:17:20,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {234611#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {234607#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-08 10:17:20,975 INFO L290 TraceCheckUtils]: 6: Hoare triple {234615#(< 0 (mod (+ 5 main_~y~0) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {234611#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-08 10:17:20,976 INFO L290 TraceCheckUtils]: 5: Hoare triple {234326#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {234615#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-08 10:17:20,976 INFO L272 TraceCheckUtils]: 4: Hoare triple {234326#true} call #t~ret13 := main(); {234326#true} is VALID [2022-04-08 10:17:20,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234326#true} {234326#true} #72#return; {234326#true} is VALID [2022-04-08 10:17:20,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {234326#true} assume true; {234326#true} is VALID [2022-04-08 10:17:20,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {234326#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {234326#true} is VALID [2022-04-08 10:17:20,976 INFO L272 TraceCheckUtils]: 0: Hoare triple {234326#true} call ULTIMATE.init(); {234326#true} is VALID [2022-04-08 10:17:20,976 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-04-08 10:17:20,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352848926] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:17:20,977 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 10:17:20,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-08 10:17:20,977 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:17:20,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1324137865] [2022-04-08 10:17:20,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1324137865] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:17:20,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:17:20,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 10:17:20,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230001739] [2022-04-08 10:17:20,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:17:20,977 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 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 45 [2022-04-08 10:17:20,977 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:17:20,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 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-08 10:17:20,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:17:20,993 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 10:17:20,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:17:20,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 10:17:20,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1172, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 10:17:20,994 INFO L87 Difference]: Start difference. First operand 644 states and 879 transitions. Second operand has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 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-08 10:17:27,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:17:27,641 INFO L93 Difference]: Finished difference Result 775 states and 1020 transitions. [2022-04-08 10:17:27,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-08 10:17:27,641 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 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 45 [2022-04-08 10:17:27,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:17:27,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 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-08 10:17:27,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 110 transitions. [2022-04-08 10:17:27,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 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-08 10:17:27,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 110 transitions. [2022-04-08 10:17:27,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 110 transitions. [2022-04-08 10:17:27,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:17:27,719 INFO L225 Difference]: With dead ends: 775 [2022-04-08 10:17:27,719 INFO L226 Difference]: Without dead ends: 753 [2022-04-08 10:17:27,719 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=759, Invalid=3273, Unknown=0, NotChecked=0, Total=4032 [2022-04-08 10:17:27,719 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 44 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-08 10:17:27,719 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 116 Invalid, 1299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-08 10:17:27,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2022-04-08 10:17:30,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 644. [2022-04-08 10:17:30,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:17:30,210 INFO L82 GeneralOperation]: Start isEquivalent. First operand 753 states. Second operand has 644 states, 639 states have (on average 1.3677621283255086) internal successors, (874), 639 states have internal predecessors, (874), 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-08 10:17:30,210 INFO L74 IsIncluded]: Start isIncluded. First operand 753 states. Second operand has 644 states, 639 states have (on average 1.3677621283255086) internal successors, (874), 639 states have internal predecessors, (874), 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-08 10:17:30,210 INFO L87 Difference]: Start difference. First operand 753 states. Second operand has 644 states, 639 states have (on average 1.3677621283255086) internal successors, (874), 639 states have internal predecessors, (874), 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-08 10:17:30,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:17:30,225 INFO L93 Difference]: Finished difference Result 753 states and 998 transitions. [2022-04-08 10:17:30,225 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 998 transitions. [2022-04-08 10:17:30,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:17:30,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:17:30,226 INFO L74 IsIncluded]: Start isIncluded. First operand has 644 states, 639 states have (on average 1.3677621283255086) internal successors, (874), 639 states have internal predecessors, (874), 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 753 states. [2022-04-08 10:17:30,226 INFO L87 Difference]: Start difference. First operand has 644 states, 639 states have (on average 1.3677621283255086) internal successors, (874), 639 states have internal predecessors, (874), 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 753 states. [2022-04-08 10:17:30,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:17:30,240 INFO L93 Difference]: Finished difference Result 753 states and 998 transitions. [2022-04-08 10:17:30,240 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 998 transitions. [2022-04-08 10:17:30,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:17:30,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:17:30,241 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:17:30,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:17:30,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 639 states have (on average 1.3677621283255086) internal successors, (874), 639 states have internal predecessors, (874), 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-08 10:17:30,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 878 transitions. [2022-04-08 10:17:30,257 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 878 transitions. Word has length 45 [2022-04-08 10:17:30,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:17:30,257 INFO L478 AbstractCegarLoop]: Abstraction has 644 states and 878 transitions. [2022-04-08 10:17:30,257 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 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-08 10:17:30,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 644 states and 878 transitions.